<!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>
      <issn pub-type="ppub">1613-0073</issn>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Multimodal Implicit Feedback for Recommender Systems</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Ladislav Peska Department of Software Engineering, Faculty of Mathematics and Physics Charles University</institution>
          ,
          <addr-line>Prague</addr-line>
          ,
          <country country="CZ">Czech Republic</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <volume>1885</volume>
      <fpage>240</fpage>
      <lpage>245</lpage>
      <abstract>
        <p>In this paper, we present an overview of our work towards utilization of multimodal implicit feedback in recommender systems for small e-commerce enterprises. We focus on deeper understanding of implicit user feedback as a rich source of heterogeneous information. We present a model of implicit feedback for e-commerce, discuss important contextual features affecting its values and describe ways to utilize it in the process of user preference learning and recommendation. We also briefly report on our previous experiments within this scope and describe a publicly available dataset containing such multimodal implicit feedback.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Recommender systems belong to the class of automated
content-processing tools, aiming to provide users with
unknown, surprising, yet relevant objects without the
necessity of explicitly query for them. The core of
recommender systems are machine learning algorithms
applied on the matrix of user to object preferences. In large
enterprises, user preference is primarily derived from
explicit user rating (also referred as explicit feedback) and
collaborative-filtering algorithms [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] usually outperforms
other approaches [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>In our research, however, we foucus on small or
medium-sized e-commerce enterprises. This domain
introduce several specific problems and obstacles making
the deployment of recommender systems more challenging.
Let us briefly list the key challenges:

</p>
      <p>High concurrency has a negative impact on user
loyalty. Typical sessions are very short, users quickly
leave to other vendors, if their early experience is not
satisfactory enough. Only a fraction of users ever
returns.</p>
      <p>For those single-time visitors, it is not sensible to
provide any unnecessary information (e.g., ratings,
reviews, registration details).
 Consumption rate is low, users often visit only a
handful (0-5) of objects.</p>
      <p>All the mentioned factors contribute to the data
sparsity problem. Although the total number of users may
be relatively large (hundreds or thousands per day), explicit
feedback is very scarce. Also the volume of visited objects
per user is limited and utilizing popularity-based
approaches w.r.t. purchases is questionable at best.
Furthermore the identification of unique user is quite
challenging.</p>
      <p>Despite these obstacles, the potential benefit of
recommender systems is considerable, it can contribute
towards better user experience, increase user loyalty and
consumption and thus also improve vendor’s key success
metrics.</p>
      <p>Our work within this framework aims to bridge the
data sparsity problem and the lack of relevant feedback by
modelling, combining and utilizing novel/enhanced sources
of information, foremost various implicit feedback features,
i.e., features based on the observed user behavior.</p>
      <p>
        Contrary to the explicit feedback, usage of implicit
feedback [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ] requires no additional effort
from the users. Monitoring implicit feedback in general
varies from simple features like user visits or play counts to
more sophisticated ones like scrolling or mouse movement
tracking [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. Due to its effortlessness, data are
obtained in much larger quantities for each user. On the
other hand, data are inherently noisy, messy and harder to
interpret [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Figure 1 depicts a simplified view of
human-computer interaction on small e-commerce
enterprises with accent on the implicit feedback provided
by the user.
      </p>
      <p>
        Our work lies a bit further from the mainstream of the
implicit feedback research. To our best knowledge, the vast
majority of researchers focus on interpreting single type of
implicit feedback [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], proposing various latent factor
models [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ], its adjustments [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] or focusing on
other aspects of recommendations using implicit feedback
based datasets [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ]. Also papers using binary implicit
feedback derived from explicit user rating are quite
common [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
      </p>
      <p>
        In contrast to the majority of research trends, we
consider implicit feedback as multimodal and
contextdependent. As our aim in this direction is a long-term one,
we already published some of our findings [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ],
[
        <xref ref-type="bibr" rid="ref22">22</xref>
        ], [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ]. In our aim towards improving recommender
systems on small e-commerce enterprises, we focused on
following aspects of implicit feedback:
 Cover the multimodality of implicit feedback.
 Propose relevant context of collected feedback.
 Derive models of negative preference based on
implicit feedback
      </p>
      <p>We reserve Section 2.1 to the description of multimodal
implicit feedback, Section 2.2 to the contextualization of
user feedback and Section 2.3 to the problem of learning
negative preference. For each problem, we describe
relevant state of the art, current challenges as well as our
proposed methods and models. Finally, we remark on the
evaluation of proposed methods in Section 3 and conclude
in Section 4.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Materials and Methods</title>
      <sec id="sec-2-1">
        <title>Multimodal Implicit Feedback</title>
        <p>
          Despite the large volume of research based on a single
implicit feedback feature, we consider implicit feedback to
be inherently multimodal. Users utilize various I/O devices
(mouse, keybord) to interact with different webpage’s GUI
controls, so there is an abundant amount of potentially Figure 2: An example of mouse movement-based feedback
interesting user actions. As the complexity of such collection on an e-commerce product detail page. Cursor
environment is overwhelming, we imposed some positions (red line) are sampled periodically. Based on the
restrictions: samples, approximated mouse in-motion time (green boxes)
 Limit to the feedback related directly to some and travelled distance (blue line) are calculated. Cursor
specific object, i.e., collect the feedback only from motion log is also stored for later reasoning.
the object’s detail page.
 Aggregate the same types of user actions on per this data gap was done quite recently in RecSys Challenges
session and per object basis. 2016 and 20172. Both challenges’ datasets focused on job
 Focus only on user actions which can be recommendation and contained several types of positive
numerically aggregated, i.e., the desired feedback and negative user feedback. Although the dataset was not
features have numerical domain. made publicly available, some approaches proposed
See Figure 2 for an example of feedback features relevant methods to deal with multimodal implicit
derived from user actions. In the following experiments, we feedback, e.g., fixed weighting scheme [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ], hierarchical
consider these implicit feedback features1: model of features [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] or utilizing features separately [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ].
 Number of views of the page Swoitmheobaujetchtosrosnalssoommeednotimonainthse[4p]r,o[b3a3b]i.lity of re-interaction
 Dwell Time (i.e., the time spent on the object)
 Total distance travelled by the mouse cursor. 2.1.1 Methods Utilizing Multimodal Feedback
 Total mouse in motion time.
 Total scrolled distance.
 Scroll Time (i.e., the time spent by scrolling)
 Clicks count (i.e., the volume of mouse clicks)
 Purchase (i.e., binary information whether user
        </p>
        <p>bought this object).</p>
        <p>
          Although multimodal implicit feedback is not a
mainstream research topic, we were able to trace some
research papers. One of the first paper mentioning implicit
feedback was Claypool et al. [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], which compared three
implicit preference indicators against explicit user rating.
        </p>
        <p>
          More recently Yang et al. [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ] analyzed several types of
user behavior on YouTube. Authors described both positive
and negative implicit indicators of preference and proposed
linear model to combine them. Also Lai et al. [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] work on
RSS feed recommender utilizing multiple reading-related
user actions.
        </p>
        <p>However, the lack of publicly available datasets
containing multimodal implicit feedback significantly
hinders advance of the area. Some work towards bridging</p>
        <p>
          Vast majority of the state-of-the-art approaches
transforms multimodal implicit feedback into a single
numeric output  ̅, which can be viewed as a proxy towards
user rating. However, these methods mostly use some fixed
model of implicit feedback (i.e., predefined weights or
hierarchy of feedback features), or perform predictions
based on each feedback feature separately [
          <xref ref-type="bibr" rid="ref28">28</xref>
          ].
        </p>
        <p>In contrast to the other approaches, we aim on
estimating  ̅ via machine learning methods applied on a
purchase prediction task. Our approach is based on the fact
that the only measurable implicit feedback with direct
interpretation of preference is buying an object. Such
events are however too scarce to be used as a sole user
preference indicator. However, we can define a
classification task to determine, based on the values of
other feedback types, whether the object will be purchased
by the user. The estimated rating  ̅ is defined as the
probability of the purchased class.</p>
        <p>
          We evaluated several machine learning methods, such as
decision trees, random forests, boosting, lasso regression
and linear regressions. We also evaluated approaches based
on the more feedback the better heuristics, i.e., the higher
value of particular feedback feature implies higher user
preference. In order to make the domains of all feedback
features comparable, we utilized either standardization of
1 Please note that the dataset used for the experiments
contains also other feedback features such as number of
page prints, followed links count, several non-numeric
feedback features etc. These features seemed not relevant
for the current task, however they may be utilized in the
future.
2 [2016|2017].recsyschallenge.com
feedback values (denoted as Heuristical with STD in
results), or used empirical cumulative distribution instead
of raw feedback values (Heuristical with CDF). The
estimated rating  ̅ is defined as the mean of STD or CDF
values of all feedback features for the respective user and
object. For more details on heuristical approaches please
refer to [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ], for more details on machine learning
approaches please refer to [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ].
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Context of User Feedback</title>
        <p>Although the user feedback may be processed directly,
the perceived feedback values are significantly affected by
the presentation of the page (i.e., device parameters) and
also by the amount of contained information. Both the
displaying device and the page’s complexity can be
described by several numeric parameters, which we
generally denote as the presentation context. See Figure 4
for some examples of relevant presentation context.</p>
        <p>
          We can trace some notions of presentation context in the
literature. Yi et al. [
          <xref ref-type="bibr" rid="ref30">30</xref>
          ], proposed to use dwell time as an
indicator of user engagement. Authors discussed the usage
of several contextual features, e.g., content type, device
type or article length as a baseline dwell time estimators.
Furthermore, Radlinski et al. [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] and Fang et al. [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]
considered object position as a relevant context for
clickstream events.
        </p>
        <p>
          The presentation context differs significantly from more
commonly used user context [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] in both its definition,
methods for feature collection as well as ways to
incorporate it into the recommending pipeline. While the
nature of user context is rather restrictive [
          <xref ref-type="bibr" rid="ref32">32</xref>
          ], we interpret
presentation context as a baseline predictor or an input
feature for machine learning process.
        </p>
        <p>In our work, we considered following presentation
context features:




</p>
        <p>Volumes of text, images and links on the page.</p>
        <p>Page dimensions (width, height).</p>
        <p>Browser’s visible area dimensions (width, height).
Visible area ratio.</p>
        <p>Hand-held device indicator.</p>
        <p>We evaluated several approaches utilizing biases for
feedback feature values based on the current presentation
context. Such approaches, however, were not very
successful and in particular often did not improve over the
baselines without any context at all. On the other hand, we
signifficantly improve over the baseline methods while
using presentation context features as additional input of
the machine learning methods described in Section 2.1.1.
2.3</p>
      </sec>
      <sec id="sec-2-3">
        <title>Negative Implicit</title>
      </sec>
      <sec id="sec-2-4">
        <title>Relations</title>
      </sec>
      <sec id="sec-2-5">
        <title>Feedback and</title>
      </sec>
      <sec id="sec-2-6">
        <title>Preferential</title>
        <p>
          One of the open problems in implicit feedback utilization
is learning negative preference from implicit feedback.
Several approaches were proposed for this task including
uniform negative preference of all unvisited objects [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ],
considering low volume of feedback as negative
preference [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ] or defining special negative feedback
feature [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], [
          <xref ref-type="bibr" rid="ref29">29</xref>
          ], [
          <xref ref-type="bibr" rid="ref31">31</xref>
          ].
        </p>
        <p>
          We propose to utilize negative preference as relations
among less and more preferred objects, i.e. to model
a partial ordering  1 &lt;  2. This model is based on the
work of Eckhardt et al. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] proposing to consider user
ratings (implicit feedback in our scenario) in the context of
other objects available on the current page. Implicit
preferential relations can be naturally obtained from
implicit feedback collected on category pages, search
results or similar pages. In such cases, user usually selects
one (or more) objects out of the list of available objects for
further inspection. By this behavior, user also implicitly
provides negative feedback on the ignored choices and thus
induce a preferential relation  &lt;  .
However, we need to approach to such negative feedback
with caution as some of the options might not be visible for
the user at all, or only for a very short time. This is quite
serious problem, because, in average, only 47% of the
catalogue page content was visible in the browser window
in our dataset. Thus, we also introduce intensity of the
relation &lt; based on the visibility of the ignored object.
Figure 3 illustrates this.
        </p>
        <p>
          We incorporate preferential relations into the
recommendation pipeline by extending collected relations
along the content-based similarity of both ignored and
selected objects (decreasing level of similarity effectively
decreases also the intensity of the relation). Afterwards, we
apply re-ranking approach taking output of some baseline
recommender and re-order the objects so that the relations
with higher intensity holds. Re-ranking algorithm considers
the relations according to the increasing intensity and
corrects the ordering induced by the relation. Thus, more
intense relations should be preferred in case of conflicts.
Details of the re-ranking algorithm can be found in [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ].
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Evaluation</title>
      <p>In this section, we would like to report on the
experiments conducted to evaluate models and methods
utilizing multimodal implicit feedback. However, let us
first briefly describe the dataset and evaluation procedures.
3.1</p>
      <sec id="sec-3-1">
        <title>Evaluation Procedure</title>
        <p>
          The dataset of multimodal user feedback (including
presentation context) was collected by observing real
visitors of a mid-sized Czech travel agency. The dataset
was collected by the IPIget tool [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] over the period of
more than one year, contains over 560K records and is
available for research purposes3. In addition to the feedback
features, the dataset also contains several content-based
attributes of objects and thus enables usage of
contentbased recommender systems as well.
        </p>
        <p>In evaluation of the methods, we considered following
tasks:


</p>
        <p>Purchase prediction based on the other feedback
available for particular user-object pair. This
scenario provides preliminary results for the
methods aiming to estimate user rating  ̅.</p>
        <p>Recommending purchased objects. In this scenario,
we employ leave-one-out cross-validation protocol
on purchased objects (i.e., for each purchased object,
all other feedback is used as a train set and we aim
to recommend object, which was actually purchased
by the user).</p>
        <p>Recommending “future” user actions. In this
scenario, we use older user feedback (usually 2/3 of
available feedback per user) as a train set. During
the recommendation phase, we recommend top-k
objects to each user, while the objects from the test
set visited by the user should appear on top of the
list.</p>
        <p>
          In several of our previous works (see, e.g., [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] or the
results of Matrix Factorization [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] in Table 3) we have
shown that purely collaborative methods are not very
suitable for small e-commerce enterprises due to the
ongoing cold-start problem. Thus, we mostly focus on the
content-based and hybrid recommending techniques. More
specifically, we utilized Vector Space Model (VSM) [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ],
its combination with the most popular recommendations
and a hybrid algorithm proposing most popular objects
from the categories similar (based on collaborative
filtering) to the visited ones [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. As we consider
recommending problem as a ranking optimization, all
methods were evaluated w.r.t. normalized discounted
cumulative gain (nDCG).
        </p>
        <p>Results of several methods aiming to learn estimated
rating  ̅ based on various feature sets are displayed in Table
1 (purchase prediction task) and Table 2 (recommending
purchased objects task). As we can see in Table 1,
multimodal feedback significantly improves purchase
prediction capability across all methods. Usage of
presentation context can further improve the results, if used
as additional input feature (Feedback + Context). However,
if the contextual features are used as baseline predictors,
the results across all methods are inferior to the results of
Feedback + Context with just one exception. In several
cases, the results are worse than using multimodal feedback
alone. This observation indicates that some more complex
dependence exists between implicit feedback, presentation
context and user preference. Although it seems that the
examined machine learning methods can partially discover
this relation, another option to try is to hand-pick only
several relevant contextual scenarios instead of the global
model applied so far. Results of recommendation task also
revealed a potential problem of overfitting on the purchase
prediction task. Linear regression, although it performed
the best in purchase prediction scenario, did not improve
over binary feedback baseline. On the other hand, we can
conclude that if a suitable rating prediction is selected,
multimodal implicit feedback together with presentation
context can improve the list of recommended objects.</p>
        <p>
          Results of re-ranking approach based on preferential
relations are depict in Table 3. Re-ranking based on
preferential relations improved results of all evaluated
recommending algorithms, although the improvement was
rather modest in case of VSM. During evaluation, we
observed that in case of VSM, only the relations with
highest intensity should be applied to improve the results.
For matrix factorization approach, on the other hand, also
relations with very low intensities should be incorporated.
Another point is that the offline evaluation is naturally
focused on mere learning past user behavior and both VSM
and Popular SimCat are largely biased towards exploitation
in exploration vs. exploitation problem [
          <xref ref-type="bibr" rid="ref27">27</xref>
          ]. Hence, there
may be further benefits of using preferential relations in
online scenarios.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>In this paper, we describe our work in progress towards
utilizing multimodal implicit feedback in small
ecommerce enterprises. Specifically, we focused on three
related tasks. Integrate multiple types of feedback collected
on the detail of an object into an estimated user rating  ̅,
incorporate presentation context into the previous model
and utilize negative implicit feedback collected on category
pages. We propose models and methods for each of the
task and also provide evaluation w.r.t. top-k ranking.</p>
      <p>Although the proposed methods statistically
signifficantly improved over the baselines, the relative
improvement is not too large, so our work is not finished
yet. One of the important future tasks is to perform online
evaluation as the offline evaluation was focused on the
exploitation only. Further tasks are to propose context
incorporation models specific for some context-feedback
feature pairs, explore other possibilities to incorporate
negative feedback and also to evaluate unified approach
integrating all presented methods.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgment</title>
      <p>The work on this project was supported by Czech grant
P46. Source codes and datasets for incorporation of
presentation context can be obtained from
http://bit.ly/2rJZzg3, source codes of preferential relations
approach can be obtained from http://bit.ly/2symm17 and
raw dataset can be obtained from http://bit.ly/2tWtRg2.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Adomavicius</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Tuzhilin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Context-Aware Recommender Systems</surname>
          </string-name>
          .
          <source>Recommender Systems Handbook</source>
          , Springer US,
          <year>2015</year>
          ,
          <fpage>191</fpage>
          -
          <lpage>226</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Baltrunas</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Amatriain</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Towards time-dependant recommendation based on implicit feedback</article-title>
          .
          <source>In CARS</source>
          <year>2009</year>
          (
          <article-title>RecSys).</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>de Campos</surname>
            ,
            <given-names>L. M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Fernandez-Luna</surname>
            ,
            <given-names>J. M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Huete</surname>
            ,
            <given-names>J. F.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Rueda-Morales</surname>
            ,
            <given-names>M. A.</given-names>
          </string-name>
          <article-title>Combining content-based and collaborative recommendations: A hybrid approach based on Bayesian networks</article-title>
          .
          <source>International Journal of Approximate Reasoning</source>
          ,
          <year>2010</year>
          ,
          <volume>51</volume>
          ,
          <fpage>785</fpage>
          -
          <lpage>799</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Carpi</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Edemanti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Kamberoski</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Sacchi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Cremonesi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Pagano</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Quadrana</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Multi-stack Ensemble for Job Recommendation</article-title>
          .
          <source>In proceedings of the Recommender Systems Challenge, ACM</source>
          ,
          <year>2016</year>
          ,
          <volume>8</volume>
          :
          <fpage>1</fpage>
          -
          <issue>8</issue>
          :
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <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 '01</source>
          ,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          ,
          <year>2001</year>
          ,
          <fpage>33</fpage>
          -
          <lpage>40</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Cremonesi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Garzotto</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Turrin</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>User-Centric vs. System-Centric Evaluation of Recommender Systems</article-title>
          .
          <source>In INTERACT 2013</source>
          , Springer LNCS 8119,
          <year>2013</year>
          ,
          <fpage>334</fpage>
          -
          <lpage>351</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Eckhardt</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Horvath</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Vojtas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <article-title>PHASES: A User Profile Learning Approach for Web Search</article-title>
          .
          <source>In WI-IAT '07</source>
          , IEEE Computer Society,
          <year>2007</year>
          ,
          <fpage>780</fpage>
          -
          <lpage>783</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Fang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Si</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <article-title>A Latent Pairwise Preference Learning Approach for Recommendation from Implicit Feedback</article-title>
          .
          <source>In CIKM</source>
          <year>2012</year>
          , ACM,
          <year>2012</year>
          ,
          <fpage>2567</fpage>
          -
          <lpage>2570</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Hidasi</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Tikk</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Initializing Matrix Factorization Methods on Implicit Feedback Databases</article-title>
          .
          <source>J. UCS</source>
          ,
          <year>2013</year>
          ,
          <volume>19</volume>
          ,
          <fpage>1834</fpage>
          -
          <lpage>1853</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <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>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Collaborative Filtering for Implicit Feedback Datasets</article-title>
          .
          <source>In ICDM</source>
          <year>2008</year>
          ,
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          <year>2008</year>
          ,
          <volume>263</volume>
          -
          <fpage>272</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Koren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Bell</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Volinsky</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>Matrix Factorization Techniques for Recommender Systems</article-title>
          . Computer, IEEE Computer Society Press,
          <year>2009</year>
          ,
          <volume>42</volume>
          ,
          <fpage>30</fpage>
          -
          <lpage>37</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <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. Journal 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="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>D. H.</given-names>
          </string-name>
          <article-title>and</article-title>
          <string-name>
            <surname>Brusilovsky</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Reinforcing Recommendation Using Implicit Negative Feedback</article-title>
          .
          <source>In UMAP 2009</source>
          , Springer, LNCS,
          <year>2009</year>
          ,
          <volume>5535</volume>
          ,
          <fpage>422</fpage>
          -
          <lpage>427</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Lops</surname>
            , P.; de Gemmis,
            <given-names>M.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Semeraro</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Content-based Recommender Systems: State of the Art and Trends</article-title>
          .
          <source>Recommender Systems Handbook</source>
          , Springer,
          <year>2011</year>
          ,
          <fpage>73</fpage>
          -
          <lpage>105</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Mishra</surname>
            ,
            <given-names>S. K.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Reddy</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>A Bottom-up Approach to Job Recommendation System</article-title>
          .
          <source>In proceedings of the Recommender Systems Challenge, ACM</source>
          ,
          <year>2016</year>
          ,
          <volume>4</volume>
          :
          <fpage>1</fpage>
          -
          <issue>4</issue>
          :
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Ostuni</surname>
            ,
            <given-names>V. C.</given-names>
          </string-name>
          ; Di Noia,
          <string-name>
            <given-names>T.</given-names>
            ;
            <surname>Di Sciascio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            &amp;
            <surname>Mirizzi</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.</surname>
          </string-name>
          :
          <article-title>Top-N recommendations from implicit feedback leveraging linked open data</article-title>
          .
          <source>In RecSys</source>
          <year>2013</year>
          , ACM,
          <year>2013</year>
          ,
          <fpage>85</fpage>
          -
          <lpage>92</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <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="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Peska</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Using the Context of User Feedback in Recommender Systems</article-title>
          .
          <source>MEMICS</source>
          <year>2016</year>
          , EPTSC 233,
          <year>2016</year>
          ,
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Peska</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Linking Content Information with Bayesian Personalized Ranking via Multiple Content Alignments</article-title>
          . To appear
          <source>in HT</source>
          <year>2017</year>
          , ACM,
          <year>2017</year>
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <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 In WIMS 2013</article-title>
          , ACM,
          <year>2013</year>
          ,
          <volume>45</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>45</lpage>
          :
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <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>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="ref22">
        <mixed-citation>
          [22]
          <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>Using Implicit Preference Relations to Improve Recommender System</article-title>
          .
          <source>J Data Semant</source>
          ,
          <volume>6</volume>
          (
          <issue>1</issue>
          ),
          <year>2017</year>
          ,
          <fpage>15</fpage>
          -
          <lpage>30</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <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>Towards Complex User Feedback and Presentation Context in Recommender Systems</article-title>
          .
          <article-title>BTW 2017 Workshops, GI-Edition</article-title>
          , LNI, P-
          <volume>266</volume>
          ,
          <year>2017</year>
          ,
          <fpage>203</fpage>
          -
          <lpage>207</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Radlinski</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Joachims</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <article-title>Query chains: learning to rank from implicit feedback</article-title>
          .
          <source>In ACM SIGKDD</source>
          <year>2005</year>
          , ACM,
          <year>2005</year>
          ,
          <fpage>239</fpage>
          -
          <lpage>248</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Raman</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Shivaswamy</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Joachims</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Online Learning to Diversify from Implicit Feedback</article-title>
          .
          <source>In KDD</source>
          <year>2012</year>
          , ACM,
          <year>2012</year>
          ,
          <fpage>705</fpage>
          -
          <lpage>713</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Rendle</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Freudenthaler</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Gantner</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>SchmidtThieme</surname>
          </string-name>
          , L. BPR:
          <article-title>Bayesian Personalized Ranking from Implicit Feedback</article-title>
          .
          <source>In UAI</source>
          <year>2009</year>
          , AUAI Press,
          <year>2009</year>
          ,
          <fpage>452</fpage>
          -
          <lpage>461</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>Rubens</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Kaplan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Sugiyama</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Active Learning in Recommender Systems</article-title>
          .
          <source>In Recommender Systems Handbook</source>
          , Springer US,
          <year>2011</year>
          ,
          <fpage>735</fpage>
          -
          <lpage>767</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Liang</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Mao</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Job Recommendation with Hawkes Process: An Effective Solution for RecSys Challenge 2016</article-title>
          .
          <source>In proceedings of the Recommender Systems Challenge, ACM</source>
          ,
          <year>2016</year>
          ,
          <volume>11</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          :
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <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="ref30">
        <mixed-citation>
          [30]
          <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. N.</given-names>
            &amp;
            <surname>Rajan</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Beyond Clicks: Dwell Time for Personalization</article-title>
          .
          <source>In RecSys</source>
          <year>2014</year>
          , ACM,
          <year>2014</year>
          ,
          <fpage>113</fpage>
          -
          <lpage>120</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Cheng</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          <article-title>An Ensemble Method for Job Recommender Systems</article-title>
          .
          <source>In proceedings of the Recommender Systems Challenge, ACM</source>
          ,
          <year>2016</year>
          ,
          <volume>2</volume>
          :
          <fpage>1</fpage>
          -
          <issue>2</issue>
          :
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Zheng</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ;
          <string-name>
            <surname>Burke</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          &amp;
          <string-name>
            <surname>Mobasher</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <article-title>Recommendation with Differential Context Weighting</article-title>
          .
          <source>In UMAP 2013</source>
          , Springer,
          <year>2013</year>
          ,
          <fpage>152</fpage>
          -
          <lpage>164</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <surname>Zibriczky</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>A Combination of Simple Models by Forward Predictor Selection for Job Recommendation</article-title>
          .
          <source>In proceedings of the Recommender Systems Challenge, ACM</source>
          ,
          <year>2016</year>
          ,
          <volume>9</volume>
          :
          <fpage>1</fpage>
          -
          <issue>9</issue>
          :
          <fpage>4</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>