<!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>Carl: A Sports Award Recommender</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Martin Pichl, Bernward Pichl</string-name>
          <email>rstname.lastname@pichl.com</email>
          <email>rstname.lastname@pichl.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Eva Zangerle</string-name>
          <email>eva.zangerle@uibk.ac.at</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, Universita ̈t Innsbruck</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Pichl Medaillen GmbH</institution>
          ,
          <addr-line>Schießstand 10, Inzing</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <abstract>
        <p>Due to the rise of the web, today's huge open source community and the numerous publications of industry as well as academia in the eld of computer science, nowadays even small and mid-sized companies can access state-of-the-art machine learning technologies, that can be leveraged for their businesses. In this paper, we present Carl, a hybrid recommender system utilizing content-based ltering combined with a context-aware sales model trained via XGBoost to recommend sports awards to customers. e computed recommendations are sent via e-mail to regular customers, who have already bought sports awards before. Hence, this systems aims to increase customer satisfaction by simplifying the decision which sports awards to buy every season. In oine experiments we observe, that XGBoost compared to other state-of-the-art approaches as Factorization Machines and Neural Networks provides the best recommendation performance. However, more importantly, in the complementary online evaluation, we monitor that the interaction- and conversion rates of the e-mails sent via Carl are a magnitude higher compared to our corporate newsleer, relying on a non-personalized most popular approach.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        INTRODUCTION
e Pichl Medaillen GmbH is a family business founded in 1846
and specialized in producing custom medals and mints. Since the
1980s, Pichl also sells sports awards. Today, this segment is
responsible for about 20% of the whole annual turnover. Due to the
highly standardized products in this segment and the fact that
customers demand those products regularly to have dierent awards
for their events, Pichl decided to implement the company’s rst
recommender system in this segment as part of the digital
innovation agenda. e system Carl, named aer Karl Pichl introducing
the industrial manufacturing in the company, aims at helping the
company to (i) design the workow of selling sports awards more
eciently and (ii) increase customer satisfaction by suggesting
products, as these suggestions ease the choice overow by
decreasing the search time for sports awards. Because customers demand
Permission to make digital or hard copies of part or all of this work for personal or
classroom use is granted without fee provided that copies are not made or distributed
for prot or commercial advantage and that copies bear this notice and the full citation
on the rst page. Copyrights for third-party components of this work must be honored.
For all other uses, contact the owner/author(s).
eCom’18, Ann Arbor, Michigan, USA
© 2018 Copyright held by the owner/author(s). 123-4567-24-567/08/06. . . $15.00
DOI: 10.475/123 4
new products for each season, this segment is moreover
characterized by a regularly changing product assortment. Particularly,
every year, about one-third of the complete assortment is replaced
by new products. is is the reason why collaborative-ltering
approaches or model-based approaches leveraging a user-item matrix
as SVD [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], which are already available in shop applications and
known to work well in other domains, fail in the presented use case:
for collaborative ltering-based systems, the estimation of a
useror item-similarity by leveraging user-item interactions is dicult
with always changing items as no interactions for new items are
available. is cold-start problem is referred to as the new item
problem [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. To avoid this problem, together with the Databases
and Information System Group at the University of Innsbruck, the
Pichl Medaillen GmbH decided to develop a hybrid approach
recommendation facilitating content- and contextual information.
      </p>
      <p>e developed approach is a hybrid recommender system
facilitating both, content-based ltering and predictive modeling. e
rst component based on content-based ltering covers the
personalization aspect, whereas the second component is a global (not
personalized) classication model that is capable to predict whether
a certain product (with certain features) is likely to be sold in a
certain period (i.e., winter or summer seasons) or not. We refer to
this as saleability.</p>
      <p>
        Using an oine evaluation, we show that eXtreme Gradient
Boosting [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] provides the best performance for the prediction task,
compared to Factorization Machines [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and Multilayer Perceptron
Neural Networks [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. Moreover, we are able to show that such a
hybrid system overcomes the limitation of collaborative ltering
for domains where the product assortment is changing regularly.
Along with that, we show that the recommendations computed by
the proposed system are not only highly precise if evaluated oine
but also deliver a high conversion rate in the real-life application.
Hence, our proposed hybrid recommendation model is capable of
recommending new products to customers and thus is applicable
for domains with regularly changing product assortments.
      </p>
      <p>e remainder of this paper is structured as follows: We
introduce the used machine learning methodologies in Section 3 and
give the reader an overview about the whole recommender system
in Section 4, where we also present the underlying
recommendation model in more detail. Next, we introduce the dataset and the
conducted oine evaluations in Section 5. We present the real-life
application in Section 6 and nally conclude this work Section 7.
2</p>
    </sec>
    <sec id="sec-2">
      <title>BACKGROUND</title>
      <p>
        Since the 2000s, recommender system research focused on
collaborative ltering approaches and in particular, on matrix-factorization
techniques such as singular value decomposition (SVD) as these
approaches have been shown to achieve the best recommendation
accuracies [
        <xref ref-type="bibr" rid="ref17 ref25 ref7">7, 17, 25</xref>
        ] and to be useful for implicit feedback [
        <xref ref-type="bibr" rid="ref14 ref22">14, 22</xref>
        ].
However, as outlined in the introduction, collaborative
lteringbased approaches fail in our seing due to the new item problem.
To handle the new item problem, content-based approaches or
hybrids facilitating content-based information to nd similar items
to the new item are suitable [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]. In this work, we present a
hybrid approach leveraging content-based information. Generally,
content-based recommender systems focus on item
characteristics to nd similar items. In particular, these systems recommend
items that are similar to the items a user already interacted with in
the past. is is why these are also called content-based ltering
approaches: they lter items based on previous user-item
interactions. ese approaches have their roots in the eld of information
retrieval [
        <xref ref-type="bibr" rid="ref24 ref4 ref9">4, 9, 24</xref>
        ] and initially focused on recommending items
containing text, for instance, news articles, websites or UseNet
messages [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In this work, we use content-based ltering to derive
an initial set of recommendation candidates. We rank the computed
candidates using a context-aware classication approach similar to
the approaches introduced next.
      </p>
      <p>
        In the late 2000s, research shied towards hybrid approaches
additionally integrating contextual information on top of the
presented content- and collaborative ltering-based approaches:
Several extensions of matrix factorization techniques have been
introduced, e.g., time-aware SVD++ [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. As context is a broad
concept, subsuming any circumstances that inuencing the perceived
usefulness of an item [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], a variety of additional contextual
information has been exploited in the eld recommender systems, for
instance, the current time [
        <xref ref-type="bibr" rid="ref18 ref6">6, 18</xref>
        ], the current emotion and mood
of a user [
        <xref ref-type="bibr" rid="ref13 ref23 ref5 ref8">5, 8, 13, 23</xref>
        ] or the user’s location [
        <xref ref-type="bibr" rid="ref11 ref15 ref16 ref3">3, 11, 15, 16</xref>
        ]. Due
to the success of context-aware approaches, we follow up this
research and incorporate the current month as a proxy for the current
season as contextual information into our recommender system,
allowing us to estimate a product bias for certain seasons. To
incorporate context along with content-based features, we rely on a
classication approach (cf. Section 3).
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>METHODOLOGY</title>
      <p>
        To select the best methodology for classifying whether a product
will be successfully sold or not, we evaluate three state-of-the-art
classication approaches in an oine evaluation. We evaluate
eXtreme Gradient Boosting (XGBoost) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], Factorization Machines
(FM) [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] and Multilayer Perceptron Neural Networks (MLP) [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
Using these three approaches, we cover a wide range of
methodologies. In particular, we cover trees, factorization approaches
leveraging latent features and neural networks. To contextualize
the performance of the dierent classication approaches, we
conduct an oine evaluation (Section 5). In this evaluation, we require
the classiers to predict whether a certain product will be successful
or not. For this two-class classication task, we consider products
as successful if they exceed a certain turnover threshold.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>SYSTEM OVERVIEW</title>
      <p>As already outlined in the introduction, our proposed recommender
system is based on two major components (C): C1 is responsible
for nding the top-n new and similar products to the products that
are found in the customers’ purchase history. C2 is responsible for</p>
      <sec id="sec-4-1">
        <title>C1: Personalization C2: Predictive Model</title>
        <p>select purchase histories
of relevant customers
compute top-n
nearest new products
select current
turnover data
compute model for new
product success prediction</p>
      </sec>
      <sec id="sec-4-2">
        <title>Recommendations</title>
        <p>compute top-1
recommendation
send e-mail to customers
predicting whether a certain product is likely to be sold. Hence,
it additionally ranks the top-n new products by the probability
whether these will be sold. Finally, the top-1 recommendation is
sent by a personalized e-mail to the customer periodically. In
particular, we send the e-mails two weeks prior to a potential customer
order. A potential customer order is computed using last order plus
one period. For example, if a customer buys once a year sports
awards, he or she will get the e-mail 351 days aer their last order.
An overview of the system is given in Figure 1. We describe both
components along with their interaction next.</p>
        <p>
          C1 nds the top-n nearest new products based on the products
contained in a user’s purchase history. For the computation of
product similarity, we utilize a generalization of the Gower
coecient [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. We use this distance, as in contrast to Pearson correlation,
a measure that is widely used in the eld of recommender systems,
the Gower coecient allows us to incorporate factor variables into
the similarity computation. In Equation 1, we show the
computation of the Gower similarity G between two products i and j. We
denote gi; j;k to the contribution provided by the feature k weighted
by wi; j;k . e computation of the feature contribution gi; j;k for
numeric features as price or height is shown in Equation 2, where
we denote rk to the range of feature k. For the factorial features
in our dataset (color, design, …), gi; j;k is computed as depicted in
Equation 3.
        </p>
        <p>Gi; j =
gi; j;k = 1
Ík wi; j;k gi; j;k
Ík wi; j;k
jxi;k</p>
        <p>xj ; k j
rk
gi; j;k =
(
1 i f xi;k = xj;k
0 i f xi;k , xj;k
(1)
(2)
(3)</p>
        <p>For the nal similarity computation of products that is used in
the real-life system, we set all weights wi; j;k = 1 and hence let
each feature equally contribute to the product similarity. We leave
a weighting scheme for future work. Using the presented
computation of the Gower distance, we derive the set of recommendation
candidates for each user by computing the top-n similar new items.
A new item is an item that is (i) newly added to the assortment in
the current year and simultaneously an item that is (ii) not found
in a user’s buying history. We rank this set of recommendation
candidates using C2 as described in the remainder of this section.</p>
        <p>C2 is responsible for estimating the saleability of a product (in
a certain season) and hence computes the probability whether a
certain product will be sold or not. As we observe that XGBoost
delivers the best performance for this prediction task (cf. Section 5.3),
we use XGBoost to compute the saleability of the recommendations
candidates computed by C1. e saleability is computed by
applying the pre-trained XGBoost model (trained with the turnover data
of the last three years as described in Section 5) to the
recommendation candidates. For each candidate, we get a saleability value s
scaled between 0 and 1.</p>
        <p>Using both, the product similarity based on the Gower
coecient g and the saleability s, we compute the nal ranking of the
new items for each user using the average of both values as depicted
in Equation 4.</p>
        <p>ri; j = w1gi; j + w2sj
(4)</p>
        <p>In Equation 4, we denote ri; j as the ranking coecient for an
item i (contained in a user’s purchase history) and a new item j.
Furthermore, we denote gi; j as the Gower coecient between item
i and j and sj as the predicted saleability of an item j. For the
real-life application, we set w1 = w2 = 0:5 and hence, consider the
personalization aspect represented by the Gower coecient and
the saleability aspect equally.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>EXPERIMENTS</title>
      <p>As already outlined in the previous section, we evaluate the
classication accuracy of the predictive model using k-fold cross-validation.
Before describing the experimental setup and discussing the results,
we introduce the reader to the used dataset.
5.1</p>
    </sec>
    <sec id="sec-6">
      <title>Dataset</title>
      <p>For evaluating the dierent classication methods, we use the
turnover data of the previous three years (2015, 2016 and 2017)
as training- and test data. Please note that we are not able to use
the turnover data of the current year (2018), as we cannot estimate
the success of the products yet. e dataset contains 538 main
products and 1,939 product variations. A main product is available in
dierent sizes, where each size is considered as a product variation.
Hence, a product variant shares the same features besides the price
and the height. As stated in Table 1, we characterize each product
by 13 features.e features price and height are self-explanatory.
Color, accent color 1 and accent color 2 specify the main color
along with two accent colors of a product,i.e., silver or gold.
Handle is a boolean feature, considering whether a cup has handles.
Analogously, cap, emblem, and emblem holder are boolean features
dening whether a cup or trophy features an emblem (holder) or
a cap. Please note that an emblem can be mounted on an emblem
holder or on a cap. Stand indicates the material of a cup’s stand,
i.e., marble, wood or plastic. Decorative states whether there is a
decorative element and the type, for instance, a colored orb.</p>
      <p>Feature Type
height numeric
price numeric
color factor
accent color 1 factor
accent color 2 factor
handle boolean
decorative factor
emblem holder boolean
emblem boolean
design factor
stand factor
cap boolean
material factor</p>
      <p>Table 1: Product Features Overview
5.2</p>
    </sec>
    <sec id="sec-7">
      <title>Experimental Setup</title>
      <p>Utilizing the previously introduced dataset, we conduct a k-fold
cross-validation to determine the most accurate model for the new
product success prediction. For this, we randomly split the dataset
into 5 folds of equal size where we use each fold as the test set once
and the remaining folds for the training. For this evaluation, we
use the packages’ default parameters but vary the number of latent
features for the FM (k 2 f1; 5; 10; 25; 50g) and the number nodes per
layer nl as well as layers l of the neural network (nl 2 1; 2; 5; 10; 20,
l 2 f1; 2; 3g). To measure the classication performance, we rely on
the accuracy measure and the Kappa statistic. While the rst
measure solely considers the number of correctly classied instances,
the Kappa statistic compares an observed accuracy with an
expected accuracy. e expected accuracy is based on the inter-rater
agreement. Due to this, the Kappa takes the possibility of correctly
classifying a product to be successful by chance into account and
hence is the more meaningful measure in our experiments.
5.3</p>
    </sec>
    <sec id="sec-8">
      <title>Experimental Results</title>
      <p>e results of the conducted oine evaluations are stated in Table 2.
For the FM and the MLP classiers, we only state the best result of
our evaluations with dierent k and dierent n as well as l values
respectively.</p>
      <sec id="sec-8-1">
        <title>Algorithm Accuracy</title>
        <p>XGBoost 0.74
FM (k = 25) 0.69
MLP (n1 = 10, n2 = 5, n3 = 5) 0.60
Table 2: Prediction Accuracy</p>
      </sec>
      <sec id="sec-8-2">
        <title>Kappa</title>
        <p>0.37
0.02
0.29</p>
        <p>We observe that though the accuracies of XGBoost and the FM
only diers by 6.76%, the Kappa value of the FM is only 0.03. Hence,
we cannot see a substantial performance dierence to the random
baseline or rather an approach always predicting a product to be</p>
      </sec>
      <sec id="sec-8-3">
        <title>Source</title>
        <p>Carl
Corporate Newsleer</p>
      </sec>
      <sec id="sec-8-4">
        <title>Website Visits</title>
        <p>20.61%
1.38%
not successful. is is, as the FM predicts a success only for 0.72% of
the products. In contrast, XGBoost classies 39.62% of the products
as a success, a more realistic number.</p>
        <p>For the MLP-based classier, using a grid search, we nd that
a neural network with three layers containing 10, 5 and 5 nodes
performs well with an accuracy of 0.60. However, though a good
classication accuracy, according to the Kappa value, XGBoost
works substantially beer. In particular, the Kappa value is 27.59%
higher.</p>
        <p>To conclude, we see that according to the Kappa statistic, both
XGBoost and MLP classiers show a fair agreement in contrast to
the FM which shows only a slight agreement. In addition, we
observe that to predict whether a product will be sold or not, XGBoost
works best in terms of prediction accuracy and the Kappa statistic.
is is why we use XGBoost’s computed probability that a product
will be sold for our proposed recommender system. We refer to this
probability as the saleability of the product. In the next section, we
show how the computed saleability is leveraged for sports award
predictions.
6 REAL-LIFE APPLICATION
e go-live of Carl was on January, the 4th 2018 and until April,
the 31st, more than 2,000 e-mails have been sent. As our business
is highly seasonal with a peak in the beginning and the end of
a year, we consider the current analysis as late-breaking results
and aim to perform a more detailed online evaluation using the
sales data of a complete year in a future work. Nevertheless, in
the current stage, we observe a very high interaction rate with the
personalized recommendations in the e-mails sent via Carl
compared to the corporate newsleer. e laer follows a simple most
popular approach, which suggests the most popular products of
the current season and the globally most popular sale articles to
our customers. In Table 3, we state the relative number of users
who have visited the website via a link in the sent e-mail, which
is the relative portion of the recipients actually visiting the
website, the corresponding average session duration in minutes, the
average number of viewed pages as well as the relative number of
conversions per user and per e-mail. For the laer two measures,
we divided the number of conversions by the number of e-mails
sent and by the number of users respectively. Please note that for
this analysis, we only tracked orders made in the online shop as
a conversion, no oine conversions as orders via telephone or an
informal mail. We observe, (cf. Table 3) that the conversion rate of
the personalized e-mail is a magnitude higher compared to the
standard (unpersonalized) newsleer. e 8.94 times higher conversion
rate per user is accompanied by a 2.77 times higher session duration
with 1.89 as many page views per session. Moreover, we observe
that the relative number of website visits is already a magnitude
higher. However, we assume that this is not only rooted in the
recommendations but also in the personalized the e-mail is sent as
well as the precise timing. is will be a subject for further research
in the next months.</p>
        <p>Summing up, we see an excellent conversion rate in the e-mails
sent via Carl. Our results show that for selecting products to
be promoted in e-mail newsleers, combining the predictor for
the saleability of products with a traditional content-based
recommender system allows for a substantial improvement in a diverse
set of quality measures. Hence, in a future work, we will run
experiments on ne-tuning the recommender system and aim to
implement a latent feature approach for the content-based part.
Besides that, we aim to conduct a profound online analysis aer a
whole year to capture all seasonal eects.</p>
      </sec>
    </sec>
    <sec id="sec-9">
      <title>7 CONCLUSION</title>
      <p>In this paper, we present Carl, a recommender system that aims to
improve customer satisfaction by suggesting sports awards to
customers of the Pichl Medaillen GmbH, an Austrian SME. In particular,
the presented system aims to increase the customer satisfaction by
sending the recommendations via e-mail to our regular customers
who buy sports awards every season (i.e., yearly) and hence helps to
nd suitable sports awards out of a set of more than 200 awards that
change regularly. e recommendations are computed using a
hybrid approach that leverages content-based ltering combined with
a context-aware sales model. e laer is trained via XGBoost and
estimates a general saleability coecient for each product based on
product features and contextual information as the current season
approximated by the current month. In an oine evaluation, we
show that XGBoost delivers the best performance compared to
Factorization Machines and multilayer perceptron neural networks. In
a complementary online study can show that the conversion rate is
substantially higher than the conversion rate of the unpersonalized
corporate newsleer, promoting the most popular articles.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Adomavicius</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tuzhilin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions</article-title>
          .
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          <volume>17</volume>
          (
          <issue>6</issue>
          ),
          <fpage>734</fpage>
          -
          <lpage>749</lpage>
          (
          <year>Jun 2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Adomavicius</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tuzhilin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Context-aware recommender systems</article-title>
          . In: Ricci,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Rokach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Shapira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Kantor</surname>
          </string-name>
          , P.B. (eds.)
          <source>Recommender Systems Handbook, chap. 7</source>
          , pp.
          <fpage>217</fpage>
          -
          <lpage>253</lpage>
          . Springer-Verlag, New York, NY, USA, 1st edn. (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Ankolekar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sandholm</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Foxtrot: a soundtrack for where you are</article-title>
          .
          <source>In: Proceedings of Interacting with Sound Workshop: Exploring Context-Aware, Local and Social Audio Applications (IwS</source>
          <year>2011</year>
          ). pp.
          <fpage>26</fpage>
          -
          <lpage>31</lpage>
          . ACM (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Baeza-Yates</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ribeiro-Neto</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Modern Information Retrieval</article-title>
          . AddisonWesley Longman Publishing Co., Inc., Boston, MA, USA (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Baltrunas</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaminskas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ludwig</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moling</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ricci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aydin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lke</surname>
            ,
            <given-names>K.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwaiger</surname>
          </string-name>
          , R.: Incarmusic:
          <article-title>Context-aware music recommendations in a car</article-title>
          . In: Huemer,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Setzer</surname>
          </string-name>
          , T. (eds.) E-Commerce and
          <source>Web Technologies, Lecture Notes in Business Information Processing</source>
          , vol.
          <volume>85</volume>
          , pp.
          <fpage>89</fpage>
          -
          <lpage>100</lpage>
          . Springer (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Baltrunas</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ludwig</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ricci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Matrix factorization techniques for context aware recommendation</article-title>
          .
          <source>In: Proceedings of the 5th ACM Conference on Recommender Systems (RecSys</source>
          <year>2011</year>
          ). pp.
          <fpage>301</fpage>
          -
          <lpage>304</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Bell</surname>
            ,
            <given-names>R.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Lessons from the netix prize challenge. ACM SIGKDD Explorations Newsleer - Special issue on visual analytics 9(2</article-title>
          ),
          <fpage>75</fpage>
          -
          <lpage>79</lpage>
          (
          <year>Dec 2007</year>
          ), hp://doi.acm.
          <source>org/10</source>
          .1145/1345448.1345465
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Braunhofer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaminskas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ricci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Recommending music for places of interest in a mobile travel guide</article-title>
          .
          <source>In: Proceedings of the 5th ACM Conference on Recommender Systems (RecSys</source>
          <year>2011</year>
          ). pp.
          <fpage>253</fpage>
          -
          <lpage>256</lpage>
          . ACM, New York, NY, USA (
          <year>2011</year>
          ), hp://doi.acm.
          <source>org/10</source>
          .1145/2043932.2043977
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Celma</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Music Recommendation and Discovery: e Long Tail, Long Fail, and Long Play in the Digital Music Space</article-title>
          . Springer Publishing Company, Incorporated, 1st edn. (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guestrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>XGBoost: A scalable tree boosting system</article-title>
          .
          <source>In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</source>
          . pp.
          <fpage>785</fpage>
          -
          <lpage>794</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Cheng</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Just-for-me: An adaptive personalization system for locationaware social music recommendation</article-title>
          .
          <source>In: Proceedings of the 16th ACM International Conference on Multimedia Retrieval (ICMR</source>
          <year>2014</year>
          )
          <article-title>(</article-title>
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Gower</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          :
          <article-title>A general coecient of similarity and some of its properties</article-title>
          .
          <source>Biometrics</source>
          <volume>27</volume>
          (
          <issue>4</issue>
          ),
          <fpage>857</fpage>
          -
          <lpage>871</lpage>
          (
          <year>1971</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>B.j.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rho</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jun</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hwang</surname>
          </string-name>
          , E.:
          <article-title>Music emotion classication and contextbased music recommendation</article-title>
          .
          <source>Multimedia Tools and Applications</source>
          <volume>47</volume>
          (
          <issue>3</issue>
          ),
          <fpage>433</fpage>
          -
          <lpage>460</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Volinsky</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Collaborative ltering for implicit feedback datasets</article-title>
          .
          <source>In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM</source>
          <year>2008</year>
          ). pp.
          <fpage>263</fpage>
          -
          <lpage>272</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Kaminskas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ricci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Location-adapted music recommendation using tags</article-title>
          .
          <source>In: User Modeling, Adaption and Personalization</source>
          , pp.
          <fpage>183</fpage>
          -
          <lpage>194</lpage>
          . Springer Berlin Heidelberg (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Kaminskas</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ricci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schedl</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Location-aware music recommendation using auto-tagging and hybrid matching</article-title>
          .
          <source>In: Proceedings of the 7th ACM Conference on Recommender Systems (RecSys</source>
          <year>2013</year>
          ). pp.
          <fpage>17</fpage>
          -
          <lpage>24</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yum</surname>
            ,
            <given-names>B.J.:</given-names>
          </string-name>
          <article-title>Collaborative ltering based on iterative principal component analysis</article-title>
          .
          <source>Expert Systems with Applications</source>
          <volume>28</volume>
          (
          <issue>4</issue>
          ),
          <fpage>823</fpage>
          -
          <lpage>830</lpage>
          (May
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Koren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Collaborative ltering with temporal dynamics</article-title>
          .
          <source>In: Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD</source>
          <year>2009</year>
          ). pp.
          <fpage>447</fpage>
          -
          <lpage>456</lpage>
          . ACM, New York, NY, USA (
          <year>2009</year>
          ), hp: //doi.acm.
          <source>org/10</source>
          .1145/1557019.1557072
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Koren</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bell</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Volinsky</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Matrix factorization techniques for recommender systems</article-title>
          .
          <source>Computer Journal</source>
          <volume>42</volume>
          (
          <issue>8</issue>
          ) (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Popescu</surname>
            ,
            <given-names>M.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Balas</surname>
            ,
            <given-names>V.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perescu-Popescu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mastorakis</surname>
          </string-name>
          , N.:
          <article-title>Multilayer perceptron and neural networks</article-title>
          .
          <source>WSEAS Transactions on Circuits and Systems</source>
          <volume>8</volume>
          (
          <issue>7</issue>
          ),
          <fpage>579</fpage>
          -
          <lpage>588</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <surname>Rendle</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Factorization machines with libFM</article-title>
          .
          <source>ACM Intelligent Systems and Technology</source>
          <volume>3</volume>
          (
          <issue>3</issue>
          ),
          <volume>57</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>57</lpage>
          :22 (May
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <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>
          , Schmidt-
          <string-name>
            <surname>ieme</surname>
          </string-name>
          , L.:
          <article-title>Bpr: Bayesian personalized ranking from implicit feedback</article-title>
          .
          <source>In: Proceedings of the 25th Conference on Uncertainty in Articial Intelligence (UAI</source>
          <year>2009</year>
          ). pp.
          <fpage>452</fpage>
          -
          <lpage>461</lpage>
          . AUAI Press, Arlington, Virginia, United
          <string-name>
            <surname>States</surname>
          </string-name>
          (
          <year>2009</year>
          ), hp://dl.acm.org/citation.cfm? id=
          <volume>1795114</volume>
          .
          <fpage>1795167</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Rho</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Han,
          <string-name>
            <given-names>B.j.</given-names>
            ,
            <surname>Hwang</surname>
          </string-name>
          , E.:
          <article-title>Svr-based music mood classication and contextbased music recommendation</article-title>
          .
          <source>In: Proceedings of the 17th ACM International Conference on Multimedia (MM</source>
          <year>2009</year>
          ). pp.
          <fpage>713</fpage>
          -
          <lpage>716</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Salton</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Automatic Text Processing: e Transformation, Analysis, and Retrieval of Information by Computer</article-title>
          . Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA (
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Sarwar</surname>
            ,
            <given-names>B.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karypis</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Konstan</surname>
            ,
            <given-names>J.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riedl</surname>
            ,
            <given-names>J.T.</given-names>
          </string-name>
          :
          <article-title>Application of dimensionality reduction in recommender systems: A case study</article-title>
          .
          <source>In: Proceedings of the WebKDD Workshop at the 6th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD</source>
          <year>2000</year>
          )
          <article-title>(</article-title>
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <surname>Schein</surname>
            ,
            <given-names>A.I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Popescul</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ungar</surname>
            ,
            <given-names>L.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pennock</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          :
          <article-title>Methods and metrics for cold-start recommendations</article-title>
          .
          <source>In: Proceedings of the 25th International Conference on Research and Development in Information Retrieval (SIGIR</source>
          <year>2002</year>
          ). pp.
          <fpage>253</fpage>
          -
          <lpage>260</lpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>