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

筛选
英文 中文
Hybrid event recommendation using linked data and user diversity 使用关联数据和用户多样性的混合事件推荐
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507171
Houda Khrouf, Raphael Troncy
{"title":"Hybrid event recommendation using linked data and user diversity","authors":"Houda Khrouf, Raphael Troncy","doi":"10.1145/2507157.2507171","DOIUrl":"https://doi.org/10.1145/2507157.2507171","url":null,"abstract":"An ever increasing number of social services offer thousands of diverse events per day. Users tend to be overwhelmed by the massive amount of information available, especially with limited browsing options perceived in many event web services. To alleviate this information overload, a recommender system becomes a vital component for assisting users selecting relevant events. However, such system faces a number of challenges owed to the the inherent complex nature of an event. In this paper, we propose a novel hybrid approach built on top of Semantic Web. On the one hand, we use a content-based system enriched with Linked Data to overcome the data sparsity, a problem induced by the transiency of events. On the other hand, we incorporate a collaborative filtering to involve the social aspect, an influential feature in decision making. This hybrid system is enhanced by the integration of a user diversity model designed to detect user propensity towards specific topics. We show how the hybridization of CB+CF systems and the integration of interest diversity features are important to improve predictions. Experimental results demonstrate the effectiveness of our approach using precision and recall measures.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"32 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":"127172598","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}
引用次数: 125
Set-oriented personalized ranking for diversified top-n recommendation 面向集合的个性化排名,多样化的top-n推荐
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507207
Ruilong Su, Li'ang Yin, Kailong Chen, Yong Yu
{"title":"Set-oriented personalized ranking for diversified top-n recommendation","authors":"Ruilong Su, Li'ang Yin, Kailong Chen, Yong Yu","doi":"10.1145/2507157.2507207","DOIUrl":"https://doi.org/10.1145/2507157.2507207","url":null,"abstract":"In this paper, we propose a set-oriented personalized ranking model for diversified top-N recommendation. Users may have various individual ranges of interests. For personalized top-N recommendation task, the combination of relevance and diversity in recommendation results would be desirable. For this purpose, we integrate the concept of diversity into traditional matrix factorization model to construct a set-oriented collaborative filtering model. By optimizing this model with a set-oriented pairwise ranking method, we directly achieve personalized top-N recommendation results which are both relevant and diversified. We also utilize category information explicitly for learning personalized diversity. Experimental results show that our model outperforms traditional models in terms of personalized diversity and maintains good performance on relevance prediction.","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":"123510647","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}
引用次数: 33
Distributed matrix factorization with mapreduce using a series of broadcast-joins 使用一系列广播连接的mapreduce分布式矩阵分解
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507195
Sebastian Schelter, Christoph Boden, M. Schenck, Alexander B. Alexandrov, V. Markl
{"title":"Distributed matrix factorization with mapreduce using a series of broadcast-joins","authors":"Sebastian Schelter, Christoph Boden, M. Schenck, Alexander B. Alexandrov, V. Markl","doi":"10.1145/2507157.2507195","DOIUrl":"https://doi.org/10.1145/2507157.2507195","url":null,"abstract":"The efficient, distributed factorization of large matrices on clusters of commodity machines is crucial to applying latent factor models in industrial-scale recommender systems. We propose an efficient, data-parallel low-rank matrix factorization with Alternating Least Squares which uses a series of broadcast-joins that can be efficiently executed with MapReduce. We empirically show that the performance of our solution is suitable for real-world use cases. We present experiments on two publicly available datasets and on a synthetic dataset termed Bigflix, generated from the Netflix dataset. Bigflix contains 25 million users and more than 5 billion ratings, mimicking data sizes recently reported as Netflix' production workload. We demonstrate that our approach is able to run an iteration of Alternating Least Squares in six minutes on this dataset. Our implementation has been contributed to the open source machine learning library Apache Mahout.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"108 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":"116303150","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}
引用次数: 54
Beyond rating prediction accuracy: on new perspectives in recommender systems 超越评级预测的准确性:推荐系统的新视角
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508073
Panagiotis Adamopoulos
{"title":"Beyond rating prediction accuracy: on new perspectives in recommender systems","authors":"Panagiotis Adamopoulos","doi":"10.1145/2507157.2508073","DOIUrl":"https://doi.org/10.1145/2507157.2508073","url":null,"abstract":"This paper proposes a number of studies in order to move recommender systems beyond the traditional paradigm and the classical perspective of rating prediction accuracy. We contribute to existing helpful but less explored paradigms and also propose new approaches aiming at more useful recommendations for both users and businesses. Working toward this direction, we discuss the studies we have conducted so far and present our future research plans. In particular, we move our focus from even more accurate rating predictions and aim at offering a holistic experience to the users by avoiding the over-specialization of generated recommendations and providing the users with sets of non-obvious but high quality recommendations that fairly match their interests and they will remarkably like.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"1 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":"126416188","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}
引用次数: 34
When power users attack: assessing impacts in collaborative recommender systems 当高级用户攻击:评估协作推荐系统的影响
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507220
David C. Wilson, C. E. Seminario
{"title":"When power users attack: assessing impacts in collaborative recommender systems","authors":"David C. Wilson, C. E. Seminario","doi":"10.1145/2507157.2507220","DOIUrl":"https://doi.org/10.1145/2507157.2507220","url":null,"abstract":"Power users, in a Collaborative Filtering (CF) Recommender System (RS) context, are those who can exert considerable influence over the recommendation outcomes presented to other users. RS operators encourage the existence of power user communities and leverage them to help fellow users make informed purchase decisions. Thus, RS research in this area has focused on power user identification and utilization to address challenges such as rating sparsity for new items or users. But, as ever, there remains the potential for corruption of power. Alongside accuracy and efficiency measures, RS robustness to manipulation or 'attack' has been studied using injection of false user profiles. Our research is investigating the impact on RS predictions and top-N recommendation lists when simulated power users provide biased ratings for new items. In this study, we introduce the notion of a 'Power User Attack' for RS robustness analysis, as well as a novel use of social networking degree centrality concepts for identifying RS power users. Initial results show that power users identified using in-degree centrality, compared to other techniques, can be more influential as reflected by accuracy and robustness impacts before and after power user attacks.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"27 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":"124246333","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}
引用次数: 30
Not by search alone: how recommendations complement search results 不仅仅是通过搜索:推荐如何补充搜索结果
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507231
Daria Dzyabura, A. Tuzhilin
{"title":"Not by search alone: how recommendations complement search results","authors":"Daria Dzyabura, A. Tuzhilin","doi":"10.1145/2507157.2507231","DOIUrl":"https://doi.org/10.1145/2507157.2507231","url":null,"abstract":"This paper presents a novel approach to combining search and recommendations methods into one integrated system to satisfy user information seeking needs. It is shown theoretically and experimentally using simulations that the proposed combined approach outperforms \"pure\" search and \"pure\" recommendations in those cases when search is hindered by the user's inability to come up with a complete set of search criteria, and recommendation engine produces mediocre results.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"92 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":"131791875","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}
引用次数: 2
Sentimental product recommendation 感性产品推荐
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507199
Ruihai Dong, Michael P. O'Mahony, M. Schaal, Kevin McCarthy, B. Smyth
{"title":"Sentimental product recommendation","authors":"Ruihai Dong, Michael P. O'Mahony, M. Schaal, Kevin McCarthy, B. Smyth","doi":"10.1145/2507157.2507199","DOIUrl":"https://doi.org/10.1145/2507157.2507199","url":null,"abstract":"This paper describes a novel approach to product recommendation that is based on opinionated product descriptions that are automatically mined from user-generated product reviews. We present a recommendation ranking strategy that combines similarity and sentiment to suggest products that are similar but superior to a query product according to the opinion of reviewers. We demonstrate the benefits of this approach across a variety of Amazon product domains.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"98 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":"131943765","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}
引用次数: 54
Learning to rank for recommender systems 学习为推荐系统排序
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508063
Alexandros Karatzoglou, L. Baltrunas, Yue Shi
{"title":"Learning to rank for recommender systems","authors":"Alexandros Karatzoglou, L. Baltrunas, Yue Shi","doi":"10.1145/2507157.2508063","DOIUrl":"https://doi.org/10.1145/2507157.2508063","url":null,"abstract":"Recommender system aim at providing a personalized list of items ranked according to the preferences of the user, as such ranking methods are at the core of many recommendation algorithms. The topic of this tutorial focuses on the cutting-edge algorithmic development in the area of recommender systems. This tutorial will provide an in depth picture of the progress of ranking models in the field, summarizing the strengths and weaknesses of existing methods, and discussing open issues that could be promising for future research in the community. A qualitative and quantitative comparison between different models will be provided while we will also highlight recent developments in the areas of Reinforcement Learning.","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":"132694125","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}
引用次数: 126
Leveraging the citation graph to recommend keywords 利用引文图来推荐关键词
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507197
I. Blank, L. Rokach, Guy Shani
{"title":"Leveraging the citation graph to recommend keywords","authors":"I. Blank, L. Rokach, Guy Shani","doi":"10.1145/2507157.2507197","DOIUrl":"https://doi.org/10.1145/2507157.2507197","url":null,"abstract":"Users of scientific papers databases, such as CiteSeer, Google Scholar, and Microsoft Academic, often search for papers using a set of keywords. Unfortunately, many authors avoid listing sufficient keywords for their papers. As such, these applications may need to automatically associate good descriptive keywords with papers. This is a well-studied problem given the complete text of the paper, but in many cases, due to copyright privileges, research papers databases do not have the complete text, only metadata, such as the title and abstract. On the other hand, research papers databases typically maintain the citation network of each paper. In this paper we study the problem of predicting which keywords are appropriate for a scientific paper, using only the citation network. We compare our method with predicting keywords using the title and abstract, concluding that the citation network provides much better predictions.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"210 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":"133068495","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
Towards scalable and accurate item-oriented recommendations 向可扩展和准确的面向项目的推荐
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507208
Noam Koenigstein, Y. Koren
{"title":"Towards scalable and accurate item-oriented recommendations","authors":"Noam Koenigstein, Y. Koren","doi":"10.1145/2507157.2507208","DOIUrl":"https://doi.org/10.1145/2507157.2507208","url":null,"abstract":"Most recommenders research aims at personalized systems, which suggest items based on user profiles. However, in reality many systems deal with item-oriented recommendations. In such setups, given a single item of interest, the system needs to provide other related items, following patterns like \"people who liked this also liked...\". While item-oriented systems are central in their importance, they have been approached so far using very basic tools. We identify several hurdles faced by standard approaches to the item-oriented task. First, the sparseness of observed activities prevents establishing reliable similarity relations for many item pairs. Second, we address a scalability challenge at the retrieval stage present in many real-world systems: Given an item inventory, which may encompass millions of items, it is desired to identify the most related item pairs in a sub-quadratic time. This work addresses these two challenges, thereby improving both accuracy and scalability of item-oriented recommenders. Additionally, we propose an empirical evaluation scheme for comparing the quality of different solutions with encouraging results.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"1 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":"130487211","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}
引用次数: 47
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学术官方微信
小红书