DOCSLIB.ORG

Managing Popularity Bias in Recommender Systems with Personalized Re-Ranking

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Managing Popularity Bias in Recommender Systems with Personalized Re-Ranking Managing Popularity Bias in Recommender Systems with Personalized Re-ranking Himan Abdollahpouri Robin Burke Bamshad Mobasher [email protected] [email protected] [email protected] Department of Information Science Department of Information Science Web Intelligence Lab, DePaul University of Colorado Boulder University of Colorado Boulder University ABSTRACT Many recommender systems suffer from popularity bias: popular items are recommended frequently while less popular, niche prod- ucts, are recommended rarely or not at all. However, recommending the ignored products in the “long tail” is critical for businesses as they are less likely to be discovered. In this paper, we introduce a personalized diversification re-ranking approach to increase the representation of less popular items in recommendations while main- taining acceptable recommendation accuracy. Our approach is a post-processing step that can be applied to the output of any recom- mender system. We show that our approach is capable of managing popularity bias more effectively, compared with an existing method based on regularization. We also examine both new and existing metrics to measure the coverage of long-tail items in the recommen- Figure 1: The long-tail of item popularity. dation. items are the very popular items, such as blockbuster movies in a ACM Reference Format: Himan Abdollahpouri, Robin Burke, and Bamshad Mobasher. 2019. Manag- movie recommender system, that garner much more viewer attention. ing Popularity Bias in Recommender Systems with Personalized Re-ranking. Similar distributions can be found in other consumer domains. In AAAI Florida Artificial Intelligence Research Society (FLAIRS ’19), May The second vertical line divides the tail of the distribution into two 18–22, 2019, Sarasota, Florida, USA. ACM, New York, NY, USA, 6 pages. parts. We call the first part the long tail: these items are amenable to https://doi.org/10.1145/XXXXXXX collaborative recommendation, even though many algorithms fail to include them in recommendation lists. The second part, the distant INTRODUCTION tail, are items that receive so few ratings that meaningful cross-user comparison of their ratings becomes unreliable. For these cold-start Recommender systems have an important role in e-commerce and items, content-based and hybrid recommendation techniques must information sites, helping users find new items. One obstacle to the be employed. Our work in this paper is concerned with collaborative effectiveness of recommenders is the problem of popularity bias [6]: recommendation and therefore focuses on the long-tail segment. collaborative filtering recommenders typically emphasize popular We present a general and flexible approach for controlling the items (those with more ratings) over other “long-tail” items [16] balance of item exposure in different portions of the item catalog as a that may only be popular among small groups of users. Although post-processing phase for standard recommendation algorithms. Our popular items are often good recommendations, they are also likely work is inspired by [18] where authors introduced a novel probabilis- to be well-known. So delivering only popular items will not enhance tic framework called xQuAD for Web search result diversification new item discovery and will ignore the interests of users with niche which aims to generate search results that explicitly account for tastes. It also may be unfair to the producers of less popular or newer arXiv:1901.07555v4 [cs.IR] 12 Aug 2019 various aspects associated with an under-specified query. We adapt items since they are rated by fewer users. the xQuAD approach to the popularity bias problem. Our approach Figure 1 illustrates the long-tail phenomenon in recommender enables the system designer to tune the system to achieve the desired systems. The y axis represents the number of ratings per item and the trade-off between accuracy and better coverage of long-tail, less x axis shows the product rank. The first vertical line separates the top popular items. 20% of items by popularity – these items cumulatively have many more ratings than the 80% tail items to the right. These “short head” Related Work Permission to make digital or hard copies of part or all of this work for personal or Recommending serendipitous items from the long tail is generally classroom use is granted without fee provided that copies are not made or distributed considered to be a key function of recommendation [5], as these for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. are items that users are less likely to know about. Authors in [7] For all other uses, contact the owner/author(s). showed that 30-40% of Amazon book sales are represented by titles FLAIRS ’19, May 18–22, 2019, Sarasota, Florida, USA that would not normally be found in brick-and-mortar stores. © 2019 Copyright held by the owner/author(s). ACM ISBN 978-1-4503-XXXXXX. Long-tail items are also important for generating a fuller under- https://doi.org/10.1145/XXXXXXX standing of users’ preferences. Systems that use active learning to FLAIRS ’19, May 18–22, 2019, Sarasota, Florida, USA Himan Abdollahpouri, Robin Burke, and Bamshad Mobasher explore each user’s profile will typically need to present more long that adds a personalized bonus to the items that belong to the under- tail items because these are the ones that the user is less likely to represented group (i.e. the long-tail items). The personalization fac- know about, and where user’s preferences are more likely to be tor is determined based on each user’s historical interest in long-tail diverse [17]. items. Finally, long-tail recommendation can also be understood as a social good. A market that suffers from popularity bias will lack METHODOLOGY opportunities to discover more obscure products and will be, by defi- We build on the xQuAD model to control popularity bias in recom- nition, dominated by a few large brands or well-known artists [11]. mendation algorithms. We assume that for a given user u, a ranked Such a market will be more homogeneous and offer fewer opportu- recommendation list R has already been generated by a base recom- nities for innovation and creativity. mendation algorithm. The task of the modified xQuAD method is to The idea of the long-tail of item popularity and its impact on produce a new re-ranked list S (jSj < jRj) that manages popularity recommendation quality has been explored by some researchers bias while still being accurate. [7, 16]. In those works, authors tried to improve the performance of The new list is built iteratively according to the following crite- the recommender system in terms of accuracy and precision, given rion: the long-tail in the ratings. Our work, instead, focuses on reducing P¹vjuº + λP¹v; S 0juº (1) popularity bias and balancing the representation of items across the where P¹vjuº is the likelihood of user u 2 U being interested in popularity distribution. item v 2 V , independent of the items on the list so far as, predicted A regularization-based approach to improving long tail recom- by the base recommender. The second term P¹v; S 0juº denotes the mendations is found in [2]. One limitation with that work is that likelihood of user u being interested in an item v as an item not in this work is restricted to factorization models where the long-tail the currently generated list S. preference can be encoded in terms of the latent factors. In contrast, Intuitively, the first term incorporates ranking accuracy while the a re-ranking approach can be applied to the output of any algo- second term promotes diversity between two different categories of rithm. Another limitation of that work is that it does not account items (i.e. short head and long tail). The parameter λ controls how for user tolerance towards long-tail items: the fact that there may be strongly controlling popularity bias is weighted in general. The item some users only interested in popular items. In our model, we take that scores most highly under the equation 1 is added to the output personalization of long-tail promotion into account as well. list S and the process is repeated until S has achieved the desired And finally, there is substantial research in recommendation di- length. versity, where the goal is to avoid recommending too many similar To achieve more diverse recommendation containing items from items [10, 23, 24]. Personalized diversity is also another related both short head and long tail items, the marginal likelihood P¹v; S 0juº area of research where the amount of diversification is dependent over both item categories long-tail head (Γ) and short head (Γ’) is on the user’s tolerance for diversity [12, 21]. Another similar work computed by: to ours is [20] where authors used a modified version of xQuAD called relevance based xQuAD for intent-oriented diversification of Õ P¹v; S 0juº = P¹v; S 0jdºP¹djuº (2) search results and recommendations. Another work used a similar 2f 0 g approach but for fairness-aware recommendation [14] where xQuAD d Γ;Γ was used to make a fair representation of items from different item Following the approach of [18], we assume that the remaining providers. Our work is different from all these previous diversifica- items are independent of the current contents of S and that the items are independent of each other given the short head and long tail tion approaches in that it is not dependent on the characteristics of 0 items, but rather on the relative popularity of items. categories. Under these assumptions, we can compute P¹v; S jdº in Eq.2 as Ö P¹v; S 0jdº = P¹vjdºP¹S 0jdº = P¹vjdº ¹1 − P¹ijd; Sºº (3) CONTROLLING POPULARITY BIAS i 2S By substituting equation 3 into equation 2, we can obtain xQuAD Õ Ö Result diversification has been studied in the context of information score = ¹1−λºP¹vjuº+λ P¹cjuºP¹vjcº ¹1−P¹ijc; Sºº (4) 0 retrieval, especially for web search engines, which have a similar c 2fΓ;Γ g i 2S goal to find a ranking of documents that together provide a complete where P¹vjdº is equal to 1 if v 2 d and 0 otherwise.
Load more

Recommended publications
  • Dual Transfer Learning Framework for Improved Long-Tail Item Recommendation
    A Model of Two Tales: Dual Transfer Learning Framework for Improved Long-tail Item Recommendation Yin Zhang*, Derek Zhiyuan Cheng, Tiansheng Yao, Xinyang Yi, Lichan Hong, Ed H. Chi [email protected],{zcheng,tyao,xinyang,lichan,edchi}@google.com Google, Inc, USA Texas A&M University, USA ABSTRACT Highly skewed long-tail item distribution is very common in recom- mendation systems. It significantly hurts model performance on tail items. To improve tail-item recommendation, we conduct research to transfer knowledge from head items to tail items, leveraging the rich user feedback in head items and the semantic connec- tions between head and tail items. Specifically, we propose a novel dual transfer learning framework that jointly learns the knowledge transfer from both model-level and item-level: 1. The model-level knowledge transfer builds a generic meta-mapping of model param- eters from few-shot to many-shot model. It captures the implicit data augmentation on the model-level to improve the represen- tation learning of tail items. 2. The item-level transfer connects head and tail items through item-level features, to ensure a smooth transfer of meta-mapping from head items to tail items. The two types of transfers are incorporated to ensure the learned knowledge from head items can be well applied for tail item representation learning in the long-tail distribution settings. Through extensive experiments on two benchmark datasets, results show that our pro- posed dual transfer learning framework significantly outperforms other state-of-the-art methods for tail item recommendation in hit ratio and NDCG. It is also very encouraging that our framework further improves head items and overall performance on top of the gains on tail items.
    [Show full text]
  • Branch and Bramble-Youtube Guide-Download
    YOUTUBE SEO A GUIDE Why YouTube SEO? Dos and Don’ts Overall Recommended Steps Keyword Tools & Processes THE GIST Best Prac4ces: Before Uploading Best Prac4ces: Uploading Best Prac4ces: AIer Publica4on YouTube Stories Appendix WHY YOUTUBE SEO? Op4mizing around YouTube SEO is essen4al to the success of a video and is slightly different than tradi4onal SEO. Unlike web pages or digital copy, videos cannot be ”read” by search engines’ algorithms. This significantly reduces discoverability if certain steps are not taken when crea4ng, producing, and uploading project to the plaSorm. YouTube is the 2nd largest YouTube is improving video search engine a4er Google. discovery by offering capon uploading. Videos are not “read” by Titles, descripons, keywords, search engines’ algorithms. hashtags, and metatags are several elements that help increase a video’s searchability. DO THIS: • Include long tail keywords that are more than 3 words long. • Focus on choosing 5-7 keywords. YOUTUBE KEYWORDS • Determine why someone would watch the video. Today’s YouTube SEO focuses on user intent, par4cularly when it comes to language. Since algorithms know language just as well, if not beWer, than we do, choosing keywords based on why individuals are looking for a par4cular video is DON’T DO THIS: paramount. • Do not keyword stuff — write as many There are two different methods for finding keywords and keywords as possible. they should be tailored based on where you’re at in the video process. • Use keywords that are unrelated to the video. • Use the same keyword finding process for new videos vs. already published videos. RECOMMENDED ACTIONS Find 5-7 relevant video keywords based on 1 7 Upload cap4ons for every video.
    [Show full text]
  • Evaluation of Recommendation System for Sustainable E-Commerce: Accuracy, Diversity and Customer Satisfaction
    Preprints (www.preprints.org) | NOT PEER-REVIEWED | Posted: 2 January 2020 doi:10.20944/preprints202001.0015.v1 Article Evaluation of Recommendation System for Sustainable E-Commerce: Accuracy, Diversity and Customer Satisfaction Qinglong Li 1, Ilyoung Choi 2 and Jaekyeong Kim 3,* 1 Department of Social Network Science, KyungHee University, 26, Kyungheedae-ro, Dongdaemun-gu, Seoul, 02453, Republic of Korea; [email protected] 2 Graduate School of Business Administration, KyungHee University, 26, Kyungheedae-ro, Dongdaemun- gu, Seoul, 02453, Republic of Korea; [email protected] 3 School of Management, KyungHee University, 26, Kyungheedae-ro, Dongdaemun-gu, Seoul, 02453, Republic of Korea; [email protected] * Correspondence: [email protected]; Tel.: +82-2-961-9355 (F.L.) Abstract: With the development of information technology and the popularization of mobile devices, collecting various types of customer data such as purchase history or behavior patterns became possible. As the customer data being accumulated, there is a growing demand for personalized recommendation services that provide customized services to customers. Currently, global e-commerce companies offer personalized recommendation services to gain a sustainable competitive advantage. However, previous research on recommendation systems has consistently raised the issue that the accuracy of recommendation algorithms does not necessarily lead to the satisfaction of recommended service users. It also claims that customers are highly satisfied when the recommendation system recommends diverse items to them. In this study, we want to identify the factors that determine customer satisfaction when using the recommendation system which provides personalized services. To this end, we developed a recommendation system based on Deep Neural Networks (DNN) and measured the accuracy of recommendation service, the diversity of recommended items and customer satisfaction with the recommendation service.
    [Show full text]
  • Collaborative Filtering: a Machine Learning Perspective by Benjamin Marlin a Thesis Submitted in Conformity with the Requirement
    Collaborative Filtering: A Machine Learning Perspective by Benjamin Marlin A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Computer Science University of Toronto Copyright c 2004 by Benjamin Marlin Abstract Collaborative Filtering: A Machine Learning Perspective Benjamin Marlin Master of Science Graduate Department of Computer Science University of Toronto 2004 Collaborative filtering was initially proposed as a framework for filtering information based on the preferences of users, and has since been refined in many different ways. This thesis is a comprehensive study of rating-based, pure, non-sequential collaborative filtering. We analyze existing methods for the task of rating prediction from a machine learning perspective. We show that many existing methods proposed for this task are simple applications or modifications of one or more standard machine learning methods for classification, regression, clustering, dimensionality reduction, and density estima- tion. We introduce new prediction methods in all of these classes. We introduce a new experimental procedure for testing stronger forms of generalization than has been used previously. We implement a total of nine prediction methods, and conduct large scale prediction accuracy experiments. We show interesting new results on the relative performance of these methods. ii Acknowledgements I would like to begin by thanking my supervisor Richard Zemel for introducing me to the field of collaborative filtering, for numerous helpful discussions about a multitude of models and methods, and for many constructive comments about this thesis itself. I would like to thank my second reader Sam Roweis for his thorough review of this thesis, as well as for many interesting discussions of this and other research.
    [Show full text]
  • A Recommender System for Groups of Users
    PolyLens: A Recommender System for Groups of Users Mark O’Connor, Dan Cosley, Joseph A. Konstan, and John Riedl Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455 USA {oconnor;cosley;konstan;riedl}@cs.umn.edu Abstract. We present PolyLens, a new collaborative filtering recommender system designed to recommend items for groups of users, rather than for individuals. A group recommender is more appropriate and useful for domains in which several people participate in a single activity, as is often the case with movies and restaurants. We present an analysis of the primary design issues for group recommenders, including questions about the nature of groups, the rights of group members, social value functions for groups, and interfaces for displaying group recommendations. We then report on our PolyLens prototype and the lessons we learned from usage logs and surveys from a nine-month trial that included 819 users. We found that users not only valued group recommendations, but were willing to yield some privacy to get the benefits of group recommendations. Users valued an extension to the group recommender system that enabled them to invite non-members to participate, via email. Introduction Recommender systems (Resnick & Varian, 1997) help users faced with an overwhelming selection of items by identifying particular items that are likely to match each user’s tastes or preferences (Schafer et al., 1999). The most sophisticated systems learn each user’s tastes and provide personalized recommendations. Though several machine learning and personalization technologies can attempt to learn user preferences, automated collaborative filtering (Resnick et al., 1994; Shardanand & Maes, 1995) has become the preferred real-time technology for personal recommendations, in part because it leverages the experiences of an entire community of users to provide high quality recommendations without detailed models of either content or user tastes.
    [Show full text]
  • Making History Useful: the Long Tail, the Search Economy and the U.S. Latino & Latina World War II Oral History Project Web Site
    Making History Useful: The Long Tail, the Search Economy and the U.S. Latino & Latina World War II Oral History Project Web Site BY Dr. J. Richard Stevens Dr. Maggie Rivas-Rodriguez Assistant Professor Associate Professor Division of Journalism School of Journalism Southern Methodist University The University of Texas at Austin P.O. Box 750113 1 University Station A1000 Dallas, TX 75275 Austin, Texas, 78712 214-768-1915 512-471-0405 [email protected] [email protected] Abstract This article presents two cases involving personally relevant searches that led users to the U.S. Latino & Latina World War II Oral History Project Web site. Using the long tail and the search economy paradigms (core components of current Web 2.0 development), the authors argue that the relevant searches were only possible because of the open archives of the site, and that the practice of denying open and free access to content by online news media affects their relevance to Web users. Key Words: Web 2.0, long tail, search economy, archives Making History Useful 1 Introduction Though online journalism remains in its infancy (Foust, 2005), development of its forms and structure are beginning to emerge. All media forms must adapt to their environment or die (Fidler, 1995), and how online journalism adapts to the ways in which Web users create relevancy is a critical issue facing news organizations. Aizu (1997, p. 473) argued that the Internet provides a global arena for “minor culture” that “the mass media and or the mass economy cannot pay attention to.” These observations are consistent with the niche element of the long tail paradigm.
    [Show full text]
  • The Long Tail: Why the Future of Business Is Selling Less of More
    J PROD INNOV MANAG 2007;24;274­281 © 2007 Product Development & Management Association increases, the impact of the long tail phenomenon increases. Chris Anderson states “Many of our assumptions about popular taste are actually artifacts of poor supply­and­demand matching – a market response to inefficient distribution” (p. 16). For example, fifty years ago a few television network executives controlled the few programs available for viewing on a given evening. Decades ago, viewers were more likely to accept whatever the networks offered. Today, viewing behavior is more diverse and there is more efficient distribution. There are more many The Long Tail: Why the Future of Business more television networks (for example, a science Is Selling Less of More fiction network), more televisions per capita, and Chris Anderson. New York: Hyperion, 2006. 230 + compelling alternatives, so it is unlikely that a given xii pages. US$24.95 network program will be seen by more than 30 percent of potential viewers. Now, it is more likely The Long Tail is an extension of an influential article that consumers will find and view their personal published in Wired Magazine (Anderson, 2004). As a favorites from a choice of hundreds of channels and business concept, the long tail phenomenon is then interact with an online community that shares attractive because “products that are in low demand similar preferences. or have low sales volume can collectively make up a Chapter 4 explores specific supply and demand market share that rivals or exceeds the relatively few conditions necessary for narrowly targeted goods and current bestsellers and blockbusters, if the store or services to be economically attractive.
    [Show full text]
  • Indian Regional Movie Dataset for Recommender Systems
    Indian Regional Movie Dataset for Recommender Systems Prerna Agarwal∗ Richa Verma∗ Angshul Majumdar IIIT Delhi IIIT Delhi IIIT Delhi [email protected] [email protected] [email protected] ABSTRACT few years with a lot of diversity in languages and viewers. As per Indian regional movie dataset is the rst database of regional Indian the UNESCO cinema statistics [9], India produces around 1,724 movies, users and their ratings. It consists of movies belonging to movies every year with as many as 1,500 movies in Indian regional 18 dierent Indian regional languages and metadata of users with languages. India’s importance in the global lm industry is largely varying demographics. rough this dataset, the diversity of Indian because India is home to Bollywood in Mumbai. ere’s a huge base regional cinema and its huge viewership is captured. We analyze of audience in India with a population of 1.3 billion which is evident the dataset that contains roughly 10K ratings of 919 users and by the fact that there are more than two thousand multiplexes in 2,851 movies using some supervised and unsupervised collaborative India where over 2.2 billion movie tickets were sold in 2016. e box ltering techniques like Probabilistic Matrix Factorization, Matrix oce revenue in India keeps on rising every year. erefore, there Completion, Blind Compressed Sensing etc. e dataset consists of is a huge need for a dataset like Movielens in Indian context that can metadata information of users like age, occupation, home state and be used for testing and bench-marking recommendation systems known languages.
    [Show full text]
  • Recommender Systems User-Facing Decision Support Systems
    Recommender Systems User-Facing Decision Support Systems Michael Hahsler Intelligent Data Analysis Lab (IDA@SMU) CSE, Lyle School of Engineering Southern Methodist University EMIS 5/7357: Decision Support Systems February 22, 2012 Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 1 / 44 Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 2 / 44 Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 3 / 44 Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 4 / 44 Table of Contents 1 Recommender Systems & DSS 2 Content-based Approach 3 Collaborative Filtering (CF) Memory-based CF Model-based CF 4 Strategies for the Cold Start Problem 5 Open-Source Implementations 6 Example: recommenderlab for R 7 Empirical Evidence Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 5 / 44 Decision Support Systems ? Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 6 / 44 Decision Support Systems \Decision Support Systems are defined broadly [...] as interactive computer-based systems that help people use computer communications, data, documents, knowledge, and models to solve problems and make decisions." Power (2002) Main Components: Knowledge base Model User interface Michael Hahsler (IDA@SMU) Recommender Systems EMIS 5/7357: DSS 6 / 44 ! A recommender system is a decision support systems which help a seller to choose suitable items to offer given a limited information channel. Recommender Systems Recommender systems apply statistical and knowledge discovery techniques to the problem of making product recommendations. Sarwar et al. (2000) Advantages of recommender systems (Schafer et al., 2001): Improve conversion rate: Help customers find a product she/he wants to buy.
    [Show full text]
  • Incorporating Contextual Information in Recommender Systems Using a Multidimensional Approach
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by CiteSeerX Incorporating Contextual Information in Recommender Systems Using a Multidimensional Approach Gediminas Adomavicius Department of Information & Decision Sciences Carlson School of Management University of Minnesota [email protected] Ramesh Sankaranarayanan Department of Information, Operations & Management Sciences Stern School of Business New York University [email protected] Shahana Sen Marketing Department Silberman College of Business Fairleigh Dickinson University [email protected] Alexander Tuzhilin Department of Information, Operations & Management Sciences Stern School of Business New York University [email protected] Abstract The paper presents a multidimensional (MD) approach to recommender systems that can provide recommendations based on additional contextual information besides the typical information on users and items used in most of the current recommender systems. This approach supports multiple dimensions, extensive profiling, and hierarchical aggregation of recommendations. The paper also presents a multidimensional rating estimation method capable of selecting two- dimensional segments of ratings pertinent to the recommendation context and applying standard collaborative filtering or other traditional two-dimensional rating estimation techniques to these segments. A comparison of the multidimensional and two-dimensional rating estimation approaches is made, and the tradeoffs between the two are studied. Moreover, the paper introduces a combined rating estimation method that identifies the situations where the MD approach outperforms the standard two-dimensional approach and uses the MD approach in those situations and the standard two-dimensional approach elsewhere. Finally, the paper presents a pilot empirical study of the combined approach, using a multidimensional movie recommender system that was developed for implementing this approach and testing its performance.
    [Show full text]
  • How-Relevant-Is-The-Long-Tail.Pdf
    How Relevant is the Long Tail? A Relevance Assessment Study on Million Short Philipp Schaer1, Philipp Mayr2, Sebastian S¨unkler3, and Dirk Lewandowski3 1 Cologne University of Applied Sciences, Cologne, Germany 2 GESIS – Leibniz Institute for the Social Sciences, Cologne, Germany 3 Hamburg University of Applied Sciences, Hamburg, Germany Abstract. Users of web search engines are known to mostly focus on the top ranked results of the search engine result page. While many studies support this well known information seeking pattern only few studies concentrate on the question what users are missing by neglecting lower ranked results. To learn more about the relevance distributions in the so-called long tail we conducted a relevance assessment study with the Million Short long-tail web search engine. While we see a clear difference in the content between the head and the tail of the search engine result list we see no statistical significant differences in the binary relevance judgments and weak significant differences when using graded relevance. The tail contains different but still valuable results. We argue that the long tail can be a rich source for the diversification of web search engine result lists but it needs more evaluation to clearly describe the differences. 1 Introduction The ranking algorithms of web search engines try to predict the relevance of web pages to a given search query by a user. By incorporating hundreds of “signals” modern search engines do a great job in bringing a usable order to the vast amounts of web data available. Users are used to rely mostly on the first few results presented in search engine result pages (SERP).
    [Show full text]
  • Music Recommendation and Discovery in the Long Tail
    MUSIC RECOMMENDATION AND DISCOVERY IN THE LONG TAIL Oscar` Celma Herrada 2008 c Copyright by Oscar` Celma Herrada 2008 All Rights Reserved ii To Alex and Claudia who bring the whole endeavour into perspective. iii iv Acknowledgements I would like to thank my supervisor, Dr. Xavier Serra, for giving me the opportunity to work on this very fascinating topic at the Music Technology Group (MTG). Also, I want to thank Perfecto Herrera for providing support, countless suggestions, reading all my writings, giving ideas, and devoting much time to me during this long journey. This thesis would not exist if it weren’t for the the help and assistance of many people. At the risk of unfair omission, I want to express my gratitude to them. I would like to thank all the colleagues from MTG that were —directly or indirectly— involved in some bits of this work. Special mention goes to Mohamed Sordo, Koppi, Pedro Cano, Mart´ın Blech, Emilia G´omez, Dmitry Bogdanov, Owen Meyers, Jens Grivolla, Cyril Laurier, Nicolas Wack, Xavier Oliver, Vegar Sandvold, Jos´ePedro Garc´ıa, Nicolas Falquet, David Garc´ıa, Miquel Ram´ırez, and Otto W¨ust. Also, I thank the MTG/IUA Administration Staff (Cristina Garrido, Joana Clotet and Salvador Gurrera), and the sysadmins (Guillem Serrate, Jordi Funollet, Maarten de Boer, Ram´on Loureiro, and Carlos Atance). They provided help, hints and patience when I played around with the machines. During my six months stage at the Center for Computing Research of the National Poly- technic Institute (Mexico City) in 2007, I met a lot of interesting people ranging different disciplines.
    [Show full text]