Proceedings of the 7th ACM conference on Recommender systems最新文献

筛选
英文 中文
Beyond friendship: the art, science and applications of recommending people to people in social networks 超越友谊:在社交网络中向他人推荐的艺术、科学和应用
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508064
L. Pizzato, Anmol Bhasin
{"title":"Beyond friendship: the art, science and applications of recommending people to people in social networks","authors":"L. Pizzato, Anmol Bhasin","doi":"10.1145/2507157.2508064","DOIUrl":"https://doi.org/10.1145/2507157.2508064","url":null,"abstract":"While Recommender Systems are powerful drivers of engagement and transactional utility in social networks, People recommenders are a fairly involved and diverse subdomain. Consider that movies are recommended to be watched, news is recommended to be read, people however, are recommended for a plethora of reasons -- such as recommendation of people to befriend, follow, partner, targets for an advertisement or service, recruiting, partnering romantically and to join thematic interest groups. This tutorial aims to first describe the problem domain, touch upon classical approaches like link analysis and collaborative filtering and then take a rapid deep dive into the unique aspects of this problem space like reciprocity, intent understanding of recommender and the recomendee, contextual people recommendations in communication flows and social referrals -- a paradigm for delivery of recommendations using the social graph. These aspects will be discussed in the context of published original work developed by the authors and their collaborators and in many cases deployed in massive-scale real world applications on professional networks such as LinkedIn.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122657958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Selecting content-based features for collaborative filtering recommenders 为协同过滤推荐选择基于内容的特征
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507203
Royi Ronen, Noam Koenigstein, Elad Ziklik, Nir Nice
{"title":"Selecting content-based features for collaborative filtering recommenders","authors":"Royi Ronen, Noam Koenigstein, Elad Ziklik, Nir Nice","doi":"10.1145/2507157.2507203","DOIUrl":"https://doi.org/10.1145/2507157.2507203","url":null,"abstract":"We study the problem of scoring and selecting content-based features for a collaborative filtering (CF) recommender system. Content-based features play a central role in mitigating the ``cold start'' problem in commercial recommenders. They are also useful in other related tasks, such as recommendation explanation and visualization. However, traditional feature selection methods do not generalize well to recommender systems. As a result, commercial systems typically use manually crafted and selected features. This work presents a framework for automated selection of informative content-based features, that is independent of the type of recommender system or the type of features. We evaluate on recommenders from different domains: books, movies and smart-phone apps, and show effective results on each. In addition, we show how to use the proposed methods to generate meaningful features from text.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122884046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 41
PEN RecSys: a personalized news recommender systems framework PEN RecSys:一个个性化的新闻推荐系统框架
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508218
Florent Garcin, B. Faltings
{"title":"PEN RecSys: a personalized news recommender systems framework","authors":"Florent Garcin, B. Faltings","doi":"10.1145/2507157.2508218","DOIUrl":"https://doi.org/10.1145/2507157.2508218","url":null,"abstract":"We present the Personalized News (PEN) recommender systems framework, currently in use by a newspaper website to evaluate various algorithms for news recommendations. We briefly describe its system architecture and related components. We show how a researcher can easily evaluate different algorithms thanks to a web-based interface.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131148960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
GAIN: web service for user tracking and preference learning - a smart TV use case GAIN:用于用户跟踪和偏好学习的web服务——一个智能电视用例
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508217
Jaroslav Kuchař, Tomáš Kliegr
{"title":"GAIN: web service for user tracking and preference learning - a smart TV use case","authors":"Jaroslav Kuchař, Tomáš Kliegr","doi":"10.1145/2507157.2508217","DOIUrl":"https://doi.org/10.1145/2507157.2508217","url":null,"abstract":"GAIN (inbeat.eu) is a web application and service for capturing and preprocessing user interactions with semantically described content. GAIN outputs a set of instances in tabular form suitable for further processing with generic machine-learning algorithms. GAIN is demoed as a component of a \"SMART-TV\" recommender system. Content is automatically described with DBpedia types using a Named Entity Recognition (NER) system. Interest is determined based on explicit user actions and user's attention computed by 3D head pose estimation. Preference rules are learnt with an association rule mining algorithm. These can be e.g. deployed to a business rules system, acting as a recommender.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133659145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Nonlinear latent factorization by embedding multiple user interests 嵌入多个用户兴趣的非线性潜在因子分解
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507209
J. Weston, Ron J. Weiss, H. Yee
{"title":"Nonlinear latent factorization by embedding multiple user interests","authors":"J. Weston, Ron J. Weiss, H. Yee","doi":"10.1145/2507157.2507209","DOIUrl":"https://doi.org/10.1145/2507157.2507209","url":null,"abstract":"Classical matrix factorization approaches to collaborative filtering learn a latent vector for each user and each item, and recommendations are scored via the similarity between two such vectors, which are of the same dimension. In this work, we are motivated by the intuition that a user is a much more complicated entity than any single item, and cannot be well described by the same representation. Hence, the variety of a user's interests could be better captured by a more complex representation. We propose to model the user with a richer set of functions, specifically via a set of latent vectors, where each vector captures one of the user's latent interests or tastes. The overall recommendation model is then nonlinear where the matching score between a user and a given item is the maximum matching score over each of the user's latent interests with respect to the item's latent representation. We describe a simple, general and efficient algorithm for learning such a model, and apply it to large scale, real-world datasets from YouTube and Google Music, where our approach outperforms existing techniques.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125619359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 72
Recommendation in heterogeneous information networks with implicit user feedback 隐含用户反馈的异构信息网络推荐
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507230
Xiao Yu, Xiang Ren, Yizhou Sun, Bradley Sturt, Urvashi Khandelwal, Quanquan Gu, Brandon Norick, Jiawei Han
{"title":"Recommendation in heterogeneous information networks with implicit user feedback","authors":"Xiao Yu, Xiang Ren, Yizhou Sun, Bradley Sturt, Urvashi Khandelwal, Quanquan Gu, Brandon Norick, Jiawei Han","doi":"10.1145/2507157.2507230","DOIUrl":"https://doi.org/10.1145/2507157.2507230","url":null,"abstract":"Recent studies suggest that by using additional user or item relationship information when building hybrid recommender systems, the recommendation quality can be largely improved. However, most such studies only consider a single type of relationship, e.g., social network. Notice that in many applications, the recommendation problem exists in an attribute-rich heterogeneous information network environment. In this paper, we study the entity recommendation problem in heterogeneous information networks. We propose to combine various relationship information from the network with user feedback to provide high quality recommendation results. The major challenge of building recommender systems in heterogeneous information networks is to systematically define features to represent the different types of relationships between entities, and learn the importance of each relationship type. In the proposed framework, we first use meta-path-based latent features to represent the connectivity between users and items along different paths in the related information network. We then define a recommendation model with such latent features and use Bayesian ranking optimization techniques to estimate the model. Empirical studies show that our approach outperforms several widely employed implicit feedback entity recommendation techniques.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133928274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 169
Personalized next-song recommendation in online karaokes 在线卡拉ok个性化推荐下一首歌曲
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507215
Xiang Wu, Qi Liu, Enhong Chen, Liang He, Jingsong Lv, Can Cao, Guoping Hu
{"title":"Personalized next-song recommendation in online karaokes","authors":"Xiang Wu, Qi Liu, Enhong Chen, Liang He, Jingsong Lv, Can Cao, Guoping Hu","doi":"10.1145/2507157.2507215","DOIUrl":"https://doi.org/10.1145/2507157.2507215","url":null,"abstract":"In this paper, we propose Personalized Markov Embedding (PME), a next-song recommendation strategy for online karaoke users. By modeling the sequential singing behavior, we first embed songs and users into a Euclidean space in which distances between songs and users reflect the strength of their relationships. Then, given each user's last song, we can generate personalized recommendations by ranking the candidate songs according to the embedding. Moreover, PME can be trained without any requirement of content information. Finally, we perform an experimental evaluation on a real world data set provided by ihou.com which is an online karaoke website launched by iFLYTEK, and the results clearly demonstrate the effectiveness of PME.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132641406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 66
Which app will you use next?: collaborative filtering with interactional context 接下来你会使用哪个应用程序?:具有交互上下文的协同过滤
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507186
Nagarajan Natarajan, D. Shin, I. Dhillon
{"title":"Which app will you use next?: collaborative filtering with interactional context","authors":"Nagarajan Natarajan, D. Shin, I. Dhillon","doi":"10.1145/2507157.2507186","DOIUrl":"https://doi.org/10.1145/2507157.2507186","url":null,"abstract":"The application a smart phone user will launch next intuitively depends on the sequence of apps used recently. More generally, when users interact with systems such as shopping websites or online radio, they click on items that are of interest in the current context. We call the sequence of clicks made in the current session interactional context. It is desirable for a recommender system to use the context set by the user to update recommendations. Most current context-aware recommender systems focus on a relatively less dynamic representational context defined by attributes such as season, location and tastes. In this paper, we study the problem of collaborative filtering with interactional context, where the goal is to make personalized and dynamic recommendations to a user engaged in a session. To this end, we propose the methodname algorithm that works in two stages. First, users are clustered by their transition behavior (one-step Markov transition probabilities between items), and cluster-level Markov models are computed. Then personalized PageRank is computed for a given user on the corresponding cluster Markov graph, with a personalization vector derived from the current context. We give an interpretation of the second stage of the algorithm as adding an appropriate context bias, in addition to click bias (or rating bias), to a classical neighborhood-based collaborative filtering model, where the neighborhood is determined from a Markov graph. Experimental results on two real-life datasets demonstrate the superior performance of our algorithm, where we achieve at least 20% (up to 37%) improvement over competitive methods in the recall level at top-20.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133016471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 96
Evaluating top-n recommendations "when the best are gone" “当最好的已经消失的时候”评估排名靠前的推荐
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507225
P. Cremonesi, F. Garzotto, Massimo Quadrana
{"title":"Evaluating top-n recommendations \"when the best are gone\"","authors":"P. Cremonesi, F. Garzotto, Massimo Quadrana","doi":"10.1145/2507157.2507225","DOIUrl":"https://doi.org/10.1145/2507157.2507225","url":null,"abstract":"In a number of domains of interest for recommender systems, items are characterized by constrained and variable \"capacity\": the same product or service can be consumed by a limited number of users and the possibility of item consumption depends on contextual circumstances (e.g., time). Our work explores recommenders in the context of these \"bounded\" domains. We consider online hotel booking as a case study, and investigates if and how \"missing\" items (hotels that eventually becomes unavailable for users' consumption) affect the quality of recommendations. The paper proposes a technique for defining \"missing\" items as \"best items\", and presents an articulated empirical research in which recommendations for hotel online booking are evaluated in different experimental conditions with a user centric approach involving 142 participants.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123443745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Sage: recommender engine as a cloud service Sage:作为云服务的推荐引擎
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508221
Royi Ronen, Noam Koenigstein, Elad Ziklik, Mikael Sitruk, R. Yaari, Neta Haiby-Weiss
{"title":"Sage: recommender engine as a cloud service","authors":"Royi Ronen, Noam Koenigstein, Elad Ziklik, Mikael Sitruk, R. Yaari, Neta Haiby-Weiss","doi":"10.1145/2507157.2508221","DOIUrl":"https://doi.org/10.1145/2507157.2508221","url":null,"abstract":"Project Sage is Microsoft's all-purpose recommender system, designed and deployed as an ultra-high scale cloud service. Sage focuses on both state of the art research and high scale robust implementation. In the research front, we demonstrate new pre-processing and cleaning techniques, a novel probabilistic matrix factorization model for implicit one-class data, and a relatively new evaluation framework. In the engineering front, we present a working service deployed on the Microsoft Azure cloud, which provides easy-to-use interfaces to integrate a recommendation service into any website.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124402881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书