<!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>How to Interpret Implicit User Feedback?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>RBT Pageview Mouse Scroll Time Purchase</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ladislav Peska, Peter Vojtas Faculty of Mathematics and Physics, Charles University in Prague</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Triggered event JavaScript Load() JavaScript MouseOver() JavaScript Scroll() Total time spent on page Object was purchased</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <abstract>
        <p>Our research is focused on interpreting user preference from his/her implicit behavior. There are many types of relevant behavior e.g. time on page, scrolling, clickstream etc. which we will further denote as Relevant Behavior Types (RBT). RBT s varies both in quality and incidence and thus we might need different approaches to process them. In this early work we focus on how to derive user preference from each RBT separately. We selected number of common indicators, design two novel e-commerce specific RBT interpreting methods and conducted series of offline experiments. After the off-line evaluation an A/B test on the real-world users of a travel agency was conducted comparing best off-line method with simple binary feedback. The experiments, although preliminary, showed importance of considering multiple RBTs together.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Implicit Feedback</kwd>
        <kwd>Recommender Systems</kwd>
        <kwd>User preference</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        Recommender Systems have been widely studied in the last two
decades. They successfully complement search engines or on-site
catalogues on video streaming services, book databases1,
ecommerce2 etc. Although the recommender systems are relatively
widespread nowadays, we focus on yet neglected domain:
recommending on small e-commerce websites without dominant
position on the market. Among the most sewer challenges of this
domain is users’ disloyalty and high ratio between number of
objects and users. This disqualifies otherwise successful
Collaborative Filtering (CF) methods as they stuck in persistent cold-start
problem [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Another related challenge is the scarcity of explicit
feedback. Due to users disloyalty and absence of incentives to do
so, users generally do not provide explicit feedback in small
ecommerce websites. Our only option is to focus on implicit user
feedback. Unlike e.g. Hu et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], we focus on multiple behavior
types relevant for user preference (e.g. time on page, scrolling,
purchases etc.), which will hopefully provide better user
understanding and thus better recommendations than a single type of
feedback. In our previous works we focused on deriving negative
preference from implicit feedback [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] or various approaches to
      </p>
      <sec id="sec-1-1">
        <title>1 Librarything.com</title>
      </sec>
      <sec id="sec-1-2">
        <title>2 Amazon.com</title>
        <p>
          combine RBTs e.g. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. Our current research switched towards
correct interpretation of RBT values as the first step towards
learning user preference. We can track several similar approaches
in the literature e.g. [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] comparing implicit signals with explicit
user rating on an open-web user study, [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] categorizing several
user activities as positive or negative feedback on an online music
service, RSS feed recommender analyzing implicit reading-related
user actions [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] or using normalized item level dwell time as
relevance measure [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. However to our best knowledge, there are
no approach in the literature focusing on interpreting RBTs in
small e-commerce and thus our set of RBTs and methods for their
interpretation based on purchasing behavior are rather unique.
        </p>
        <p>Coverage
99%
44%
49%
69%
0.5%</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>3. PREFERENCE LEARNING METHODS</title>
      <p>
        The key research question of this poster is to learn dependence
between values of each RBTs and user preference . It is possible
to use simple binary model like “all visited objects are equally
preferred” or simple numeric model with linear dependence
between the value of RBT and user preference [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. We added two
collaborative approaches specific for the e-commerce domain,
considering other users purchasing behavior.
      </p>
      <sec id="sec-2-1">
        <title>Binary user preference is defined as</title>
        <p>for all visited objects.</p>
      </sec>
      <sec id="sec-2-2">
        <title>Direct preference normalization is a user-wise linear normaliza</title>
        <p>
          tion of each indicator into the [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ] interval. This approach is
similar to [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. For user u and type t, the preference based on type
is:
Purchase-based approaches considers whether other users with
similar values of RBTs purchased the object or not and computes
purchase rate PR. The approaches differ in definition of
neighborhood ε for RBT values:
 KNN: use K nearest neighbor visits to compute PR. K is
defined as ε * total number of all visits
 Distance: use all visits from interval [(1-ε) * val(RBT), (1+ε)
* val(RBT)]
The PR is then computed as: ,
where #purch is volume of purchases from defined ε
neighborhood, #all_purch is volume of all purchases in the dataset.
Intuitively PR for KNN represents ratio between mass of purchases in
current interval and expected one for uniform distribution. Finally
we use PR in sigmoid function to smoothly normalize user rating
into [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ] interval: .
        </p>
        <p>The hypothesis behind purchase-based approaches is that
purchase is the only RBT with “guaranteed” effect on user
preference, so if users evaluate other objects similarly, then although
they did not purchase them, they still probably like them. Another
reason for this approach is that although we can expect that higher
value of each RBT implicates higher preference, the exact
dependence is unknown. Purchasee-based approaches allow us to
derive non-linear parametric dependence between the value of
RBT and expected user preference . On the other hand in this
approach we neglect different behavior patterns for different users
as well as various cognitive demands to evaluate different objects.
We would like to perform user clustering of more loyal users with
enough feedback in the future work.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>4. EVALUATION</title>
    </sec>
    <sec id="sec-4">
      <title>4.1 Off-line Evaluation</title>
      <p>In the first phase of evaluation we compared various RBT
interpretation methods on a travel agency dataset. As we did not
consider any specific method for aggregating RBTs, we opted for
pairwise comparison of purchased and non-purchased objects for
each user. For each (strictly rated) pair and each indicator
preference we state that this pair is correctly ordered, if the indicator
preference of purchased object is greater than preference of
non-purchased object . Incorrect and equal are defined
likewise. Let Corr/Inc/Eq are sums of all correctly/incorrectly/equally
ordered pairs. We can now define paired error metric as follows:
Note that we consider Eq as an error too, however its significance
is lower than Inc. We use α=0.5 in the evaluation.</p>
      <p>The evaluation dataset contains 9 months usage data from a travel
agency. For the purpose of the experiment, the dataset was
restricted to only users with at least one purchase and at least two
visited objects (some outliers were also removed) leaving over
8400 pairs of objects from 380 users with 450 purchases.
for various values of ε.</p>
      <p>Direct Dist, 0.2 Dist, 0.9 KNN, 0.01
KNN, 0.7
RBT</p>
      <sec id="sec-4-1">
        <title>Pageview</title>
      </sec>
      <sec id="sec-4-2">
        <title>Mouse</title>
      </sec>
      <sec id="sec-4-3">
        <title>Scroll Time</title>
        <p>The KNN has peak performance around ε=0.7 for all RBTs except
scrolling.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4.2 A/B testing</title>
      <p>After the off-line evaluation we selected 3 methods for on-line
testing: Binary user preference as baseline, average of direct
normalization of all RBTs and average of best resulting methods
for each RBT according to Table 2. The recommendations were
computed via VSM algorithm and we opted for the number of
click throughs (CT) as target metric. The evaluation was carried
out in June 2015 with in total over 2900 users randomly assigned
to one of the preference learning methods.</p>
      <p>Binary Direct norm. Best according to Table 2
CT 208 232 213
Users 971 979 976
The on-line experiments are not conclusive yet, but it seems that
direct normalization outperforms other methods. We will further
experiment with other settings and definitions of purchase-based
approaches in the future work. Our current working hypothesis is
to use exact values instead of ε expressions.</p>
    </sec>
    <sec id="sec-6">
      <title>5. CONCLUSIONS AND FUTURE WORK</title>
      <p>In this poster, our aim was to design novel methods to infer user
preference from relevant behavior types and to determine optimal
approaches to handle different RBTs. The purchase-based
methods succeeded in off-line experiments, however further tuning and
enhanced on-line evaluation is necessary. Also incorporation of
various aggregation methods is in our future work.</p>
      <p>Acknowledgements: The work on this paper was supported by
the grant SVV-2015-260222, GAUK-126313 and P46.
0.695
0.582
0.632
0.825
0.822
0.573
0.649
According to the off-line evaluation, each RBT needs to be treated
differently. As for the Time, the best method was direct
normalization for Mouse it was KNN with larger ε, for Pageview was
optimal Distance with large ε and Scrolling on the other hand
requires either KNN with small ε. For Distance method, we can
clearly see grading improvements with increasing ε for all RBTs,</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Claypool</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Wased</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Brown</surname>
          </string-name>
          , D.:
          <article-title>Implicit interest indicators</article-title>
          .
          <source>In IUI 2001. ACM</source>
          ,
          <year>2001</year>
          ,
          <fpage>33</fpage>
          -
          <lpage>40</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Koren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ; &amp;
          <string-name>
            <surname>Volinsky</surname>
          </string-name>
          , Ch.:
          <article-title>Collaborative Filtering for Implicit Feedback Datasets</article-title>
          .
          <source>In ICDM '08. IEEE</source>
          ,
          <fpage>263</fpage>
          -
          <lpage>272</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Lai</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          <article-title>User interest prediction based on behaviors analysis</article-title>
          .
          <source>Int. Jour. of Digital Content Technology and its Applications</source>
          ,
          <volume>6</volume>
          (
          <issue>13</issue>
          ),
          <year>2012</year>
          ,
          <fpage>192</fpage>
          -
          <lpage>204</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Peska</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Vojtás</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Recommending for Disloyal Customers with Low Consumption Rate</article-title>
          .
          <source>In SOFSEM 2014</source>
          , Springer, LNCS
          <volume>8327</volume>
          ,
          <year>2014</year>
          ,
          <fpage>455</fpage>
          -
          <lpage>465</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Peska</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>IPIget - The Component for Collecting Implicit User Preference Indicators</article-title>
          .
          <source>In ITAT</source>
          <year>2014</year>
          ,
          <article-title>Ustav informatiky</article-title>
          AV CR,
          <year>2014</year>
          ,
          <fpage>22</fpage>
          -
          <lpage>26</lpage>
          , http://itat.ics.upjs.sk/workshops.pdf .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Peska</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Vojtas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Negative Implicit Feedback in Ecommerce Recommender Systems</article-title>
          .
          <source>In WIMS</source>
          <year>2013</year>
          , ACM,
          <year>2013</year>
          ,
          <volume>45</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>45</lpage>
          :
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Peska</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Vojtas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Evaluating Various Implicit Factors in E-commerce</article-title>
          .
          <source>In RUE</source>
          <year>2012</year>
          , CEUR,
          <year>2012</year>
          ,
          <volume>910</volume>
          ,
          <fpage>51</fpage>
          -
          <lpage>55</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ; Park,
          <string-name>
            <given-names>S.</given-names>
            &amp;
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          :
          <article-title>Exploiting Various Implicit Feedback for Collaborative Filtering</article-title>
          .
          <source>In WWW</source>
          <year>2012</year>
          , ACM,
          <year>2012</year>
          ,
          <fpage>639</fpage>
          -
          <lpage>640</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Yi</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Hong</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Zhong</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ; Liu,
          <string-name>
            <given-names>N.</given-names>
            ; &amp;
            <surname>Rajan</surname>
          </string-name>
          . S.: Beyond Clicks:
          <article-title>Dwell Time for Personalization</article-title>
          .
          <source>In RecSys '14. ACM</source>
          ,
          <year>2014</year>
          ,
          <fpage>113</fpage>
          -
          <lpage>120</lpage>
          <source>0.797 0.772 0.569 0.791 0.695 0.561 0.555 0.502 0.850 0.799 0.578 0.589 0</source>
          .
          <fpage>753</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>