<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Exploiting Relationship Among Cases to Make the Best Use of Users Feedback</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anbarasu Sekar</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Indian Institute of Technology Madras</institution>
          ,
          <addr-line>Chennai 600036</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Recommender systems (RSs) are built with the aim to reduce the cognitive load on the user. An e cient RS should ensure that a user spends minimal time in the process. Conversational Case-Based Recommender systems (CCBR-RSs) depend on the feedback provided by the user to learn about the preferences of the user. In our work, we exploit the relationship among the cases/products in addition to the feedback (preference-based feedback (PBF)) provided by the user in several ways to develop an e cient CCBR-RS.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        aim of our work is to reduce the cognitive load on the user by reducing the
conversation length. Our work has three broad goals, (a) We deal with pro ling
products based on the feature weights under which a particular product
dominates its competitors and use it to enrich the measure of utility, (b) The second
work identi es the trade-o relationship among products and helps users
identify products that make trade-o s that are in line with their preferences and
(c) We aggregate evidence for each product in the domain through the feedback
provided by the user, the feedback provided on a set of products is propagated
to every product in the domain based on its relationship with them. In each of
these works, we show how our methods help to boost the performance of the
system by empirically evaluating it on three datasets [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
2
2.1
      </p>
    </sec>
    <sec id="sec-2">
      <title>Research Progress</title>
      <sec id="sec-2-1">
        <title>Utility based on dominance relation among products</title>
        <p>
          Status: Published. \Towards Bridging the Gap between Manufacturer and Users
to Facilitate Better Recommendation" [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]
        </p>
        <p>
          The work by Mouli et al. [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ] points out the drawback in learning weights of
the features without considering the dependency among features. For example
among a set of cameras shown to the user, if the user prefers a product with the
least zoom, it doesn't mean the importance given to zoom is the least but it may
also be the reason that the user rejected products are costlier. The authors use
a Multi-Attribute Utility Theory (MAUT) [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] based formulation to capture the
utility of a product. A fair assumption that the utility of the product preferred
by the user is higher or equal to every other product rejected by the user in a
given interaction cycle is made. The above assumption allows us to formulate
inequalities that can be solved for the feature weights. In a given interaction cycle
the number of inequalities one can derive would be far less than the number of
features in the domain and hence the solutions to the inequalities would be a
convex region of vectors in the feature weights space, let us term the region,
preference region of the user. A single weight vector from the preference region
is selected as the feature weights to compute weighted similarity. The selection
of the weight vector is based on the assumption that the preferences of the user
does not change drastically in successive interaction cycles. So a weight vector
that is closest to the feature weights vector assumed in the previous interaction
cycle is selected. The method is termed Compromise Driven Preference Model
(CDPM) [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ].
        </p>
        <p>As the rst part of our doctoral research, we enrich the utility of the weighted
similarity measure (feature weights determined based on CDPM) with additional
information from the domain. We call this additional information dominance
knowledge. We argue that each product has prospective buyers and the
importance that the buyers of a particular product would give to the features of that
product would be similar. We make an assumption that the products that are
similar to each other are competitors to each other and a prospective buyer of
a particular product would prefer it over its competitors. Similar to CDPM we
can derive inequalities by comparing every product with its competitors. The
solutions to the feature weights are contained in a convex region in the feature
weights space. We term this region dominance region of the product. Under the
feature weights assumptions from the dominance region of a particular product,
the utility of that product is greater or equal to all its competitors. Each
product has its own dominance region and each user has their preference region. The
dominance region characterises the prospective buyer of the product in terms of
feature weights. We de ne a measure of overlap between the dominance region
of a certain product and the preference region of the user. We combine the
overlap score of a product and its weighted similarity to get the enriched utility of
the product. We term our method Predicted Preference Region based Method
(PPRM).
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Utility based on trade-o relations among products</title>
        <p>
          Status: Published. \Why Did Naethan Pick Android over Apple? Exploiting
Trade-o s in Learning User Preferences" [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]
        </p>
        <p>
          Given a user query and a product, we can determine the compromises the
users have to make in accepting the product. McSherry [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] in his work shows
how the success of the recommender system can be improved by o ering the
user all possible compromises available in the domain as the compromise a user
would make is not known in advance. Compromise is a relationship between
the user query and a product. We argue in our work that trade-o s are the
relationship among products and can be determined even before the user's query
is encountered. Given a pair of cars, one a high-performance car and another a
commuter car, we can determine what features dominate in each of the cars.
Irrespective of the query, if the two cars are shown to the user and if the user
prefers the commuter car, then we can identify the set of features the user prefers
over the other set of features. The dominance relation is based on MIB and LIB
categorization of the features. The user who prefers a commuter car will mostly
prefer the feature Fuel e ciency over Top Speed.
        </p>
        <p>In our work, we de ne a representation for trade-o s and a similarity measure
between a pair of trade-o s. In each interaction cycle, we get the PBF from the
user. We compare the PBF with each of the rejected products and determine the
trade-o s the user preferred product makes with each of the rejected products.
In the next interaction cycle, the usefulness of a product is determined by its
similarity with the PBF and the similarity between the trade-o s with the user
rejected products. For a product to be included in the recommendation set its
similarity with the PBF should be high and the trade-o s it makes with the
rejected products should be similar to the trade-o s the PBF makes with the
rejected products.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>From PBF to Evidences</title>
        <p>
          Status: Accepted. \Show me your friends, I'll tell you who you are:
Recommending products based on hidden evidence" [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]
        </p>
        <p>
          Published. \Exploiting the interplay among products for e cient
recommendations" [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]
        </p>
        <p>We propose a novel view to the process of conversation. The feedback in
each interaction cycle is used for aggregating evidence for each product in the
domain. The evidence could be both positive and negative. We try to model a
sales executive who associates the preferences expressed by a user with some
product in the domain and recommends the same to the user. The relation
among products both in terms of its MAUT based similarity and its similarity
based on trade-o is exploited to propagate positive and negative evidences.
In each interaction cycle, one product is preferred and the rest are rejected. A
product gets positive evidence proportional to its similarity to PBF and negative
evidence proportional to its similarity with the rejected products. We categorize
the evidence into dominance based evidence and trade-o based evidence. We
discuss how the works from literature can be viewed in the light of
evidencebased recommendation and suggest ways in which the propagation of noise in
the evidence can be minimised.</p>
        <p>
          In our latest work in [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] we incorporated higher-order evidence mining based
on the relationship among products. We proposed a way of constructing
precedence graph with the products in the domain as the nodes and the edge from one
product to another denoting the precedence of one product over the other with
the weights implying the strength of evidence. We used the random surfer model
to compute the stationary distribution of the products(nodes in the graph) and
use it as a measure of utility.
2.4
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Evaluation and Results</title>
        <p>
          We evaluate the e ciency of our methods based on leave-one-out methodology
[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. The product that is most similar to the left out product is set as the target.
We assume an arti cial agent that gives PBF in every interaction cycle. In each
recommendation phase, the PBF choice is decided based on similarity to the
left out product. We simulate easy, medium and hard conditions by randomly
picking feature values of di erent sizes from the left out product as the initial
query. The sizes chosen are 5, 3 and 1 respective to easy, medium and hard
conditions. Instead of leaving out every product we randomly pick one product
from the domain and measure the number of cycles it takes for the three query
sizes. We do this process for 1000 times and the average cycle length for each
of the query sizes is used as the metric for comparison against several methods.
We split the 1000 queries into 10 folds and check for statistical signi cance of
the di erence in average across methods.
        </p>
        <p>
          We have found our methods to have signi cantly better performance
supporting our hypotheses. The best performance is recorded for the Used Car dataset.
The average reduction in the number of cycles compared to the baseline work
for Used Car dataset for the three methods is as follows. PPRM [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] showed 40,
43 and 40 percent reduction in average number of cycles for hard, medium and
easy queries respectively. Similarly our trade-o based method [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] showed 54,
49 and 43 percent reduction and the Evidence based method showed 61, 60 and
61 percent reduction in the average number of cycles compared to the vanilla
similarity based CCBR-RS.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Future Works</title>
      <p>The advantage with CCBR-RSs is its ability to explain why a recommendation
is made to the user. We would like to explore the task of explaining
recommendations in our approaches.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Gediminas</given-names>
            <surname>Adomavicius</surname>
          </string-name>
          , Alexander Tuzhilin:
          <article-title>Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions, IEEE Transactions on Knowledge and Data Engineering</article-title>
          , v.
          <volume>17</volume>
          n.
          <issue>6</issue>
          , pp.
          <fpage>734</fpage>
          -
          <lpage>749</lpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>McSherry</surname>
          </string-name>
          , David.:
          <string-name>
            <surname>Coverage-Optimized Retrieval</surname>
          </string-name>
          .
          <source>Proceedings of the Eighteenth International Joint Conference on Arti cial Intelligence</source>
          , pages
          <fpage>1349</fpage>
          -
          <lpage>1350</lpage>
          . Morgan Kaufmann Publishers Inc. (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>McSherry</surname>
          </string-name>
          , David.:
          <article-title>Similarity and compromise</article-title>
          .
          <source>International Conference on CaseBased Reasoning</source>
          . Springer Berlin Heidelberg (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Mouli</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Chandra</surname>
          </string-name>
          , and Sutanu Chakraborti.
          <article-title>: Making the Most of Preference Feedback by Modeling Feature Dependencies</article-title>
          .
          <source>Proceedings of the 9th ACM Conference on Recommender Systems. ACM</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Keeney</surname>
          </string-name>
          , Ralph L.,
          <article-title>and Howard Rai a.: Decisions with multiple objectives: preferences and value trade-o s</article-title>
          . Cambridge university press (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Anbarasu</given-names>
            <surname>Sekar</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Sutanu</given-names>
            <surname>Chakraborti</surname>
          </string-name>
          .
          <article-title>Towards Bridging the Gap between Manufacturer and Users to Facilitate Better Recommendation</article-title>
          .
          <source>The Thirty-First International Flairs Conference</source>
          . (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>McGinty</surname>
            <given-names>L.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Smyth</surname>
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Evaluating preference-based feedback in recommender systems</article-title>
          .
          <source>In Arti cial Intelligence and Cognitive Science</source>
          , pp
          <fpage>209</fpage>
          -
          <lpage>214</lpage>
          . Springer (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Sekar</surname>
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ganesan</surname>
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chakraborti</surname>
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Why Did</surname>
          </string-name>
          <article-title>Naethan Pick Android over Apple? Exploiting Trade-o s in Learning User Preferences</article-title>
          . In:
          <string-name>
            <surname>Cox</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Funk</surname>
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Begum</surname>
            <given-names>S</given-names>
          </string-name>
          .
          <source>(eds) Case-Based Reasoning Research and Development. ICCBR 2018. Lecture Notes in Computer Science</source>
          , v. 11156. Springer (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>Anbarasu</given-names>
            <surname>Sekar</surname>
          </string-name>
          and
          <string-name>
            <given-names>Sutanu</given-names>
            <surname>Chakraborti</surname>
          </string-name>
          .:
          <article-title>Show me your friends, I'll tell you who you are: Recommending products based on hidden evidence</article-title>
          .
          <source>In 27th International Conference on Case-Based Reasoning</source>
          , Otzenhausen, (
          <year>2019</year>
          )
          <article-title>(Accepted)</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>Anbarasu</given-names>
            <surname>Sekar</surname>
          </string-name>
          and
          <string-name>
            <given-names>Sutanu</given-names>
            <surname>Chakraborti</surname>
          </string-name>
          .
          <article-title>: Exploiting the interplay among products for e cient recommendations</article-title>
          . In
          <source>International Journal of Advanced Computer Science and Applications</source>
          , Volume:
          <volume>10</volume>
          Issue: 6,
          <string-name>
            <surname>ISSN</surname>
          </string-name>
          <source>2158-107X (Print)</source>
          , pp.
          <fpage>549</fpage>
          -
          <lpage>556</lpage>
          , The Science and
          <string-name>
            <surname>Information (SAI) Organization</surname>
            <given-names>Limited</given-names>
          </string-name>
          , (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>11. http://www.mycbr-project.net/download.html</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>