<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Carl: A Sports Award Recommender</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Martin</forename><surname>Pichl</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Medaillen GmbH</orgName>
								<address>
									<addrLine>Schießstand 10</addrLine>
									<settlement>Pichl, Inzing</settlement>
									<country key="AT">Austria</country>
								</address>
							</affiliation>
							<affiliation key="aff2">
								<address>
									<settlement>Ann Arbor</settlement>
									<region>Michigan</region>
									<country key="US">USA</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Bernward</forename><surname>Pichl</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Medaillen GmbH</orgName>
								<address>
									<addrLine>Schießstand 10</addrLine>
									<settlement>Pichl, Inzing</settlement>
									<country key="AT">Austria</country>
								</address>
							</affiliation>
							<affiliation key="aff2">
								<address>
									<settlement>Ann Arbor</settlement>
									<region>Michigan</region>
									<country key="US">USA</country>
								</address>
							</affiliation>
						</author>
						<author role="corresp">
							<persName><forename type="first">Eva</forename><surname>Zangerle</surname></persName>
							<email>eva.zangerle@uibk.ac.at</email>
							<affiliation key="aff1">
								<orgName type="department">Department of Computer Science</orgName>
								<orgName type="institution">Universität Innsbruck Austria</orgName>
							</affiliation>
							<affiliation key="aff2">
								<address>
									<settlement>Ann Arbor</settlement>
									<region>Michigan</region>
									<country key="US">USA</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Carl: A Sports Award Recommender</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">63393565E3073D6106B14F47126C66D3</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T06:31+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><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></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">INTRODUCTION</head><p>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 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 <ref type="bibr" target="#b18">[19]</ref>, 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 <ref type="bibr" target="#b25">[26]</ref>. 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 <ref type="bibr" target="#b9">[10]</ref> provides the best performance for the prediction task, compared to Factorization Machines <ref type="bibr" target="#b20">[21]</ref> and Multilayer Perceptron Neural Networks <ref type="bibr" target="#b19">[20]</ref>. 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. 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.</p><p>accuracies <ref type="bibr" target="#b6">[7,</ref><ref type="bibr" target="#b16">17,</ref><ref type="bibr" target="#b24">25]</ref> and to be useful for implicit feedback <ref type="bibr" target="#b13">[14,</ref><ref type="bibr" target="#b21">22]</ref>. 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 <ref type="bibr" target="#b25">[26]</ref>. 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 <ref type="bibr" target="#b3">[4,</ref><ref type="bibr" target="#b8">9,</ref><ref type="bibr" target="#b23">24]</ref> and initially focused on recommending items containing text, for instance, news articles, websites or UseNet messages <ref type="bibr" target="#b0">[1]</ref>. 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++ <ref type="bibr" target="#b17">[18]</ref>. As context is a broad concept, subsuming any circumstances that in uencing the perceived usefulness of an item <ref type="bibr" target="#b1">[2]</ref>, a variety of additional contextual information has been exploited in the eld recommender systems, for instance, the current time <ref type="bibr" target="#b5">[6,</ref><ref type="bibr" target="#b17">18]</ref>, the current emotion and mood of a user <ref type="bibr" target="#b4">[5,</ref><ref type="bibr" target="#b7">8,</ref><ref type="bibr" target="#b12">13,</ref><ref type="bibr" target="#b22">23]</ref> or the user's location <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b10">11,</ref><ref type="bibr" target="#b14">15,</ref><ref type="bibr" target="#b15">16]</ref>. 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).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3">METHODOLOGY</head><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) <ref type="bibr" target="#b9">[10]</ref>, Factorization Machines (FM) <ref type="bibr" target="#b20">[21]</ref> and Multilayer Perceptron Neural Networks (MLP) <ref type="bibr" target="#b19">[20]</ref>. 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.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">SYSTEM OVERVIEW</head><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 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 <ref type="figure" target="#fig_0">1</ref>. We describe both components along with their interaction next. 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 coecient <ref type="bibr" target="#b11">[12]</ref>. 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 <ref type="formula" target="#formula_0">1</ref>, we show the computation of the Gower similarity G between two products i and j. We denote i, j,k to the contribution provided by the feature k weighted by w i, j,k . e computation of the feature contribution i, j,k for numeric features as price or height is shown in Equation <ref type="formula">2</ref>, where we denote r k to the range of feature k. For the factorial features in our dataset (color, design, …), i, j,k is computed as depicted in Equation <ref type="formula" target="#formula_1">3</ref>.</p><formula xml:id="formula_0">G i, j = k w i, j,k i, j,k k w i, j,k<label>(1)</label></formula><formula xml:id="formula_1">i, j,k = 1 − |x i,k − x j , k | r k (2) i, j,k = 1 i f x i,k = x j,k 0 i f x i,k x j,k<label>(3)</label></formula><p>For the nal similarity computation of products that is used in the real-life system, we set all weights w i, 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 coecient 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 <ref type="formula" target="#formula_2">4</ref>.</p><formula xml:id="formula_2">r i, j = w 1 i, j + w 2 s j<label>(4)</label></formula><p>In Equation <ref type="formula" target="#formula_2">4</ref>, we denote r i, 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 i, j as the Gower coe cient between item i and j and s j as the predicted saleability of an item j. For the real-life application, we set w 1 = w 2 = 0.5 and hence, consider the personalization aspect represented by the Gower coe cient and the saleability aspect equally.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5">EXPERIMENTS</head><p>As already outlined in the previous section, we evaluate the classication 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.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1">Dataset</head><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 <ref type="table" target="#tab_0">1</ref>, 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Feature</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2">Experimental Setup</head><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 ∈ {1, 5, 10, 25, 50}) and the number nodes per layer n l as well as layers l of the neural network (n l ∈ 1, 2, 5, 10, 20, l ∈ {1, 2, 3}). 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.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3">Experimental Results</head><p>e results of the conducted o ine evaluations are stated in Table <ref type="table">2</ref>. 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Algorithm</head><p>Accuracy Kappa XGBoost 0.74 0.37 FM (k = 25) 0.69 0.02 MLP (n 1 = 10, n 2 = 5, n 3 = 5) 0.60 0.29 Table <ref type="table">2</ref></p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>: Prediction Accuracy</head><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 eCom <ref type="bibr">'</ref>  <ref type="table">3</ref>: Recommender Key Metrics 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.</p><p>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.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6">REAL-LIFE APPLICATION</head><p>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 <ref type="table">3</ref>, 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 <ref type="table">3</ref>) 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7">CONCLUSION</head><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></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Work ow for Computing Recommendations</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 :</head><label>1</label><figDesc>Product Features Overview</figDesc><table><row><cell></cell><cell>Type</cell></row><row><cell>height</cell><cell>numeric</cell></row><row><cell>price</cell><cell>numeric</cell></row><row><cell>color</cell><cell>factor</cell></row><row><cell>accent color 1</cell><cell>factor</cell></row><row><cell>accent color 2</cell><cell>factor</cell></row><row><cell>handle</cell><cell>boolean</cell></row><row><cell>decorative</cell><cell>factor</cell></row><row><cell cols="2">emblem holder boolean</cell></row><row><cell>emblem</cell><cell>boolean</cell></row><row><cell>design</cell><cell>factor</cell></row><row><cell>stand</cell><cell>factor</cell></row><row><cell>cap</cell><cell>boolean</cell></row><row><cell>material</cell><cell>factor</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head></head><label></label><figDesc>18, July 2018, Ann Arbor, Michigan, USA Martin Pichl, Bernward Pichl and Eva Zangerle</figDesc><table><row><cell>Source</cell><cell cols="5">Website Visits Avg. Session Duration Viewed Pages Conv./E-Mail Conv./Users</cell></row><row><cell>Carl</cell><cell>20.61%</cell><cell>6.57</cell><cell>8.32</cell><cell>4.61%</cell><cell>22.34%</cell></row><row><cell>Corporate Newsle er</cell><cell>1.38%</cell><cell>2.37</cell><cell>4.41</cell><cell>0.03%</cell><cell>2.50%</cell></row><row><cell></cell><cell>Table</cell><cell></cell><cell></cell><cell></cell><cell></cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions</title>
		<author>
			<persName><forename type="first">G</forename><surname>Adomavicius</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Tuzhilin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Knowledge and Data Engineering</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="734" to="749" />
			<date type="published" when="2005-06">Jun 2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Context-aware recommender systems</title>
		<author>
			<persName><forename type="first">G</forename><surname>Adomavicius</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Tuzhilin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Recommender Systems Handbook</title>
				<editor>
			<persName><forename type="first">F</forename><surname>Ricci</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">L</forename><surname>Rokach</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">B</forename><surname>Shapira</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">P</forename><forename type="middle">B</forename><surname>Kantor</surname></persName>
		</editor>
		<meeting><address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="2010">2010</date>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="page" from="217" to="253" />
		</imprint>
	</monogr>
	<note>1st edn</note>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Foxtrot: a soundtrack for where you are</title>
		<author>
			<persName><forename type="first">A</forename><surname>Ankolekar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Sandholm</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of Interacting with Sound Workshop: Exploring Context-Aware, Local and Social Audio Applications</title>
				<meeting>Interacting with Sound Workshop: Exploring Context-Aware, Local and Social Audio Applications<address><addrLine>IwS</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2011">2011. 2011</date>
			<biblScope unit="page" from="26" to="31" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title level="m" type="main">Modern Information Retrieval</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">A</forename><surname>Baeza-Yates</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Ribeiro-Neto</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1999">1999</date>
			<publisher>Addison-Wesley Longman Publishing Co., Inc</publisher>
			<pubPlace>Boston, MA, USA</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Incarmusic: Context-aware music recommendations in a car</title>
		<author>
			<persName><forename type="first">L</forename><surname>Baltrunas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kaminskas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Ludwig</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Moling</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ricci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Aydin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">H</forename><surname>Lke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Schwaiger</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">E-Commerce and Web Technologies</title>
		<title level="s">Lecture Notes in Business Information Processing</title>
		<editor>
			<persName><forename type="first">C</forename><surname>Huemer</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">T</forename><surname>Setzer</surname></persName>
		</editor>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="volume">85</biblScope>
			<biblScope unit="page" from="89" to="100" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Matrix factorization techniques for context aware recommendation</title>
		<author>
			<persName><forename type="first">L</forename><surname>Baltrunas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Ludwig</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ricci</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 5th ACM Conference on Recommender Systems (RecSys</title>
				<meeting>the 5th ACM Conference on Recommender Systems (RecSys</meeting>
		<imprint>
			<date type="published" when="2011">2011. 2011</date>
			<biblScope unit="page" from="301" to="304" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Lessons from the net ix prize challenge</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">M</forename><surname>Bell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Koren</surname></persName>
		</author>
		<idno type="DOI">//doi.acm.org/10.1145/1345448.1345465</idno>
	</analytic>
	<monogr>
		<title level="j">ACM SIGKDD Explorations Newsle er -Special issue on visual analytics</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="75" to="79" />
			<date type="published" when="2007-12">Dec 2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Recommending music for places of interest in a mobile travel guide</title>
		<author>
			<persName><forename type="first">M</forename><surname>Braunhofer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kaminskas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ricci</surname></persName>
		</author>
		<idno type="DOI">//doi.acm.org/10.1145/2043932.2043977</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 5th ACM Conference on Recommender Systems (RecSys 2011</title>
				<meeting>the 5th ACM Conference on Recommender Systems (RecSys 2011<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="253" to="256" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">Music Recommendation and Discovery: e Long Tail, Long Fail, and Long Play in the Digital Music Space</title>
		<author>
			<persName><forename type="first">O</forename><surname>Celma</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2010">2010</date>
			<publisher>Incorporated</publisher>
		</imprint>
	</monogr>
	<note>1st edn</note>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">XGBoost: A scalable tree boosting system</title>
		<author>
			<persName><forename type="first">T</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Guestrin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</title>
				<meeting>the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining</meeting>
		<imprint>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="785" to="794" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Just-for-me: An adaptive personalization system for locationaware social music recommendation</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Cheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Shen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 16th ACM International Conference on Multimedia Retrieval (ICMR</title>
				<meeting>the 16th ACM International Conference on Multimedia Retrieval (ICMR</meeting>
		<imprint>
			<date type="published" when="2014">2014. 2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">A general coe cient of similarity and some of its properties</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">C</forename><surname>Gower</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Biometrics</title>
		<imprint>
			<biblScope unit="volume">27</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="857" to="871" />
			<date type="published" when="1971">1971</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Music emotion classi cation and contextbased music recommendation</title>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">J</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Rho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Jun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Hwang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Multimedia Tools and Applications</title>
		<imprint>
			<biblScope unit="volume">47</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="433" to="460" />
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Collaborative ltering for implicit feedback datasets</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Koren</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Volinsky</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 8th IEEE International Conference on Data Mining (ICDM</title>
				<meeting>the 8th IEEE International Conference on Data Mining (ICDM</meeting>
		<imprint>
			<date type="published" when="2008">2008. 2008</date>
			<biblScope unit="page" from="263" to="272" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Location-adapted music recommendation using tags</title>
		<author>
			<persName><forename type="first">M</forename><surname>Kaminskas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ricci</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">User Modeling, Adaption and Personalization</title>
				<meeting><address><addrLine>Heidelberg</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2011">2011</date>
			<biblScope unit="page" from="183" to="194" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Location-aware music recommendation using auto-tagging and hybrid matching</title>
		<author>
			<persName><forename type="first">M</forename><surname>Kaminskas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ricci</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Schedl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 7th ACM Conference on Recommender Systems (RecSys</title>
				<meeting>the 7th ACM Conference on Recommender Systems (RecSys</meeting>
		<imprint>
			<date type="published" when="2013">2013. 2013</date>
			<biblScope unit="page" from="17" to="24" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Collaborative ltering based on iterative principal component analysis</title>
		<author>
			<persName><forename type="first">D</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">J</forename><surname>Yum</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Expert Systems with Applications</title>
		<imprint>
			<biblScope unit="volume">28</biblScope>
			<biblScope unit="issue">4</biblScope>
			<biblScope unit="page" from="823" to="830" />
			<date type="published" when="2005-05">May 2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Collaborative ltering with temporal dynamics</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Koren</surname></persName>
		</author>
		<idno type="DOI">//doi.acm.org/10.1145/1557019.1557072</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD 2009)</title>
				<meeting>the 15th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD 2009)<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2009">2009</date>
			<biblScope unit="page" from="447" to="456" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Matrix factorization techniques for recommender systems</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Koren</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Bell</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Volinsky</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Computer Journal</title>
		<imprint>
			<biblScope unit="volume">42</biblScope>
			<biblScope unit="issue">8</biblScope>
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Multilayer perceptron and neural networks</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">C</forename><surname>Popescu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><forename type="middle">E</forename><surname>Balas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Perescu-Popescu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Mastorakis</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">WSEAS Transactions on Circuits and Systems</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="issue">7</biblScope>
			<biblScope unit="page" from="579" to="588" />
			<date type="published" when="2009">2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Factorization machines with libFM</title>
		<author>
			<persName><forename type="first">S</forename><surname>Rendle</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Intelligent Systems and Technology</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page">22</biblScope>
			<date type="published" when="2012-05">May 2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Bpr: Bayesian personalized ranking from implicit feedback</title>
		<author>
			<persName><forename type="first">S</forename><surname>Rendle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Freudenthaler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Gantner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Schmidt-Ieme</surname></persName>
		</author>
		<ptr target="//dl.acm.org/citation.cfm?id=1795114.1795167" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 25th Conference on Uncertainty in Arti cial Intelligence (UAI 2009)</title>
				<meeting>the 25th Conference on Uncertainty in Arti cial Intelligence (UAI 2009)<address><addrLine>Arlington, Virginia, United States</addrLine></address></meeting>
		<imprint>
			<publisher>AUAI Press</publisher>
			<date type="published" when="2009">2009</date>
			<biblScope unit="page" from="452" to="461" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Svr-based music mood classi cation and contextbased music recommendation</title>
		<author>
			<persName><forename type="first">S</forename><surname>Rho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">J</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Hwang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 17th ACM International Conference on Multimedia</title>
				<meeting>the 17th ACM International Conference on Multimedia<address><addrLine>MM</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2009">2009. 2009</date>
			<biblScope unit="page" from="713" to="716" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<monogr>
		<title level="m" type="main">Automatic Text Processing: e Transformation, Analysis, and Retrieval of Information by Computer</title>
		<author>
			<persName><forename type="first">G</forename><surname>Salton</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1989">1989</date>
			<publisher>Addison-Wesley Longman Publishing Co., Inc</publisher>
			<pubPlace>Boston, MA, USA</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Application of dimensionality reduction in recommender systems: A case study</title>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">M</forename><surname>Sarwar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Karypis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Konstan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">T</forename><surname>Riedl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the WebKDD Workshop at the 6th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD</title>
				<meeting>the WebKDD Workshop at the 6th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD</meeting>
		<imprint>
			<date type="published" when="2000">2000. 2000</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Methods and metrics for cold-start recommendations</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">I</forename><surname>Schein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Popescul</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">H</forename><surname>Ungar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Pennock</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 25th International Conference on Research and Development in Information Retrieval (SIGIR</title>
				<meeting>the 25th International Conference on Research and Development in Information Retrieval (SIGIR</meeting>
		<imprint>
			<date type="published" when="2002">2002. 2002</date>
			<biblScope unit="page" from="253" to="260" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
