Proceedings of the 9th ACM Conference on Recommender Systems最新文献

筛选
英文 中文
Joint Workshop on Interfaces and Human Decision Making for Recommender Systems (#IntRS) 推荐系统界面和人工决策联合研讨会(#IntRS)
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2798714
J. O'Donovan, N. Tintarev, A. Felfernig, Peter Brusilovsky, G. Semeraro, P. Lops
{"title":"Joint Workshop on Interfaces and Human Decision Making for Recommender Systems (#IntRS)","authors":"J. O'Donovan, N. Tintarev, A. Felfernig, Peter Brusilovsky, G. Semeraro, P. Lops","doi":"10.1145/2792838.2798714","DOIUrl":"https://doi.org/10.1145/2792838.2798714","url":null,"abstract":"As an interactive intelligent system, recommender systems are developed to give recommendations that match users' preferences. Since the emergence of recommender systems, a large majority of research focuses on objective accuracy criteria and less attention has been paid to how users interact with the system and the efficacy of interface designs from users' perspectives. The field has reached a point where it is ready to look beyond algorithms, into users' interactions, decision making processes, and overall experience. Following from the success of the joint IntRS 2014 workshop and previous workshops on Interfaces and Decisions in Recommender Systems, this workshop will focus on the aspect of integrating different theories of human decision making into the construction of recommender systems. It will focus particularly on the impact of interfaces on decision support and overall satisfaction, and on ways to compare and evaluate novel techniques and applications in this area.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125756095","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}
引用次数: 10
OSMRec Tool for Automatic Recommendation of Categories on Spatial Entities in OpenStreetMap OpenStreetMap空间实体类别自动推荐的OSMRec工具
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2796555
Nikos Karagiannakis, G. Giannopoulos, Dimitrios Skoutas, Spiros Athanasiou
{"title":"OSMRec Tool for Automatic Recommendation of Categories on Spatial Entities in OpenStreetMap","authors":"Nikos Karagiannakis, G. Giannopoulos, Dimitrios Skoutas, Spiros Athanasiou","doi":"10.1145/2792838.2796555","DOIUrl":"https://doi.org/10.1145/2792838.2796555","url":null,"abstract":"In this demonstration, we present OSMRec, a command line utility and JOSM plugin for automatic recommendation of tags (categories) on newly created spatial entities in OpenStreetMap (OSM). JOSM allows downloading parts of OSM, editing the map (e.g. inserting, deleting, annotating with tags spatial entities) and re-uploading the updated part back on OSM. OSMRec plugin exploits already annotated entities within OSM to train category classification models and utilizes these models in order to recommend OSM categories for newly inserted spatial entities in OSM.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130680017","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}
引用次数: 16
Risk-Hedged Venture Capital Investment Recommendation 风险对冲风险投资建议
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2800181
Xiaoxue Zhao, Weinan Zhang, Jun Wang
{"title":"Risk-Hedged Venture Capital Investment Recommendation","authors":"Xiaoxue Zhao, Weinan Zhang, Jun Wang","doi":"10.1145/2792838.2800181","DOIUrl":"https://doi.org/10.1145/2792838.2800181","url":null,"abstract":"With the increasing accessibility of transactional data in venture finance, venture capital firms (VCs) face great challenges in developing quantitative tools to identify new investment opportunities. Recommendation techniques have the possibility of helping VCs making data-driven investment decisions by providing an automatic screening process of a large number of startups across different domains on the basis of their past investment data. A previous study has shown the potential advantage of using collaborative filtering to catch and predict the VCs' investment behaviours. However, two fundamental challenges in venture finance make conventional recommendation techniques difficult to apply. First, risk factors should be cautiously considered when making investments: for a potential startup, a VC needs to specifically estimate how well this new investment can fit into its holding investment portfolio in such a way that investment risk can be hedged. Second, The investment behaviours are much sparser than conventional recommendation applications and a VC's investments are usually limited to a few industry categories, making it impossible to use a topic-diversification method to hedge the risk. In this paper, we solve the startup recommendation problem from a risk management perspective. We propose 5 risk-aware startup selection and ranking algorithms to catch the VCs' investment behaviours and predict their new investments. Apart from the contribution on the new risk-aware recommendation model, our experiments on the collected CrunchBase dataset show significant performance improvements over strong baselines.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130769124","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}
引用次数: 13
Exploring Statistical Language Models for Recommender Systems 探索推荐系统的统计语言模型
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2796547
Daniel Valcarce
{"title":"Exploring Statistical Language Models for Recommender Systems","authors":"Daniel Valcarce","doi":"10.1145/2792838.2796547","DOIUrl":"https://doi.org/10.1145/2792838.2796547","url":null,"abstract":"Even though there exist multiple approaches to build recommendation algorithms, algebraic techniques based on vector and matrix representations are predominant in the field. Notwithstanding the fact that these algebraic Collaborative Filtering methods have been demonstrated to be very effective in the rating prediction task, they do not generally provide good results in the top-N recommendation task. In this research, we return to the roots of recommender systems and we explore the relationship between Information Filtering and Information Retrieval. We think that probabilistic methods taken from the latter field such as statistical Language Models can be a more effective and formal way for generating personalised ranks of recommendations. We compare our improvements against several algebraic and probabilistic state-of-the-art algorithms and pave the way to future and promising research directions.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131108473","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}
引用次数: 15
"I like to explore sometimes": Adapting to Dynamic User Novelty Preferences “我有时喜欢探索”:适应动态用户新奇偏好
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2800172
Komal Kapoor, Vikas Kumar, L. Terveen, J. Konstan, P. Schrater
{"title":"\"I like to explore sometimes\": Adapting to Dynamic User Novelty Preferences","authors":"Komal Kapoor, Vikas Kumar, L. Terveen, J. Konstan, P. Schrater","doi":"10.1145/2792838.2800172","DOIUrl":"https://doi.org/10.1145/2792838.2800172","url":null,"abstract":"Studies have shown that the recommendation of unseen, novel or serendipitous items is crucial for a satisfying and engaging user experience. As a result, recent developments in recommendation research have increasingly focused towards introducing novelty in user recommendation lists. While, existing solutions aim to find the right balance between the similarity and novelty of the recommended items, they largely ignore the user needs for novelty. In this paper, we show that there are large individual and temporal differences in the users' novelty preferences. We develop a regression model to predict these dynamic novelty preferences of users using features derived from their past interactions. Finally, we describe an adaptive recommender,~emph{adaNov-R}, that adapts to the user needs for novel items and show that the model achieves better recommendation performance on a metric that considers both novel and familiar items.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116211333","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}
引用次数: 100
Overview of ACM RecSys CrowdRec 2015 Workshop: Crowdsourcing and Human Computation for Recommender Systems ACM RecSys CrowdRec 2015研讨会综述:推荐系统的众包和人工计算
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2798719
M. Larson, D. Tikk, R. Turrin
{"title":"Overview of ACM RecSys CrowdRec 2015 Workshop: Crowdsourcing and Human Computation for Recommender Systems","authors":"M. Larson, D. Tikk, R. Turrin","doi":"10.1145/2792838.2798719","DOIUrl":"https://doi.org/10.1145/2792838.2798719","url":null,"abstract":"CrowdRec 2015 provides the recommender system community with a forum at which to discuss crowdsourcing and human computation. Systems that explicitly collect information from human annotators to improve recommendations are becoming more widespread. At this year's workshop, we highlight incentivization and the issue of avoiding bias. We take a special look at how recommender systems can influence collective behavior, and the contribution that the crowd can make to recommender system evaluation.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114749924","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}
引用次数: 1
Applying Differential Privacy to Matrix Factorization 微分隐私在矩阵分解中的应用
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2800173
Arnaud Berlioz, Arik Friedman, M. Kâafar, R. Boreli, S. Berkovsky
{"title":"Applying Differential Privacy to Matrix Factorization","authors":"Arnaud Berlioz, Arik Friedman, M. Kâafar, R. Boreli, S. Berkovsky","doi":"10.1145/2792838.2800173","DOIUrl":"https://doi.org/10.1145/2792838.2800173","url":null,"abstract":"Recommender systems are increasingly becoming an integral part of on-line services. As the recommendations rely on personal user information, there is an inherent loss of privacy resulting from the use of such systems. While several works studied privacy-enhanced neighborhood-based recommendations, little attention has been paid to privacy preserving latent factor models, like those represented by matrix factorization techniques. In this paper, we address the problem of privacy preserving matrix factorization by utilizing differential privacy, a rigorous and provable privacy preserving method. We propose and study several approaches for applying differential privacy to matrix factorization, and evaluate the privacy-accuracy trade-offs offered by each approach. We show that input perturbation yields the best recommendation accuracy, while guaranteeing a solid level of privacy protection.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123640193","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}
引用次数: 118
It Takes Two to Tango: An Exploration of Domain Pairs for Cross-Domain Collaborative Filtering 两个人跳探戈:跨领域协同过滤的领域对探索
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2800188
Shaghayegh Sherry Sahebi, Peter Brusilovsky
{"title":"It Takes Two to Tango: An Exploration of Domain Pairs for Cross-Domain Collaborative Filtering","authors":"Shaghayegh Sherry Sahebi, Peter Brusilovsky","doi":"10.1145/2792838.2800188","DOIUrl":"https://doi.org/10.1145/2792838.2800188","url":null,"abstract":"As the heterogeneity of data sources are increasing on the web, and due to the sparsity of data in each of these data sources, cross-domain recommendation is becoming an emerging research topic in the recent years. Cross-domain collaborative filtering aims to transfer the user rating pattern from source (auxiliary) domains to a target domain for the purpose of alleviating the sparsity problem and providing better target recommendations. However, the studies so far have either focused on a limited number of domains that are assumed to be related to each other (such as books and movies), or a division of the same dataset (such as movies) into different domains based on an item characteristic (such as genre). In this paper, we study a broad set of domains and their characteristics to understand the factors that affect the success or failure of cross-domain collaborative filtering, the amount of improvement in cross-domain approaches, and the selection of best source domains for a specific target domain. We propose to use Canonical Correlation Analysis (CCA) as a significant major factor in finding the most promising source domains for a target domain, and suggest a cross-domain collaborative filtering based on CCA (CD-CCA) that proves to be successful in using the shared information between domains in the target recommendations.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127822741","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
A Personalised Reader for Crowd Curated Content 人群策划内容的个性化读者
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2796552
G. Kazai, Daoud Clarke, Iskander Yusof, M. Venanzi
{"title":"A Personalised Reader for Crowd Curated Content","authors":"G. Kazai, Daoud Clarke, Iskander Yusof, M. Venanzi","doi":"10.1145/2792838.2796552","DOIUrl":"https://doi.org/10.1145/2792838.2796552","url":null,"abstract":"Personalised news recommender systems traditionally rely on content ingested from a select set of publishers and ask users to indicate their interests from a predefined list of topics. They then provide users a feed of news items for each of their topics. In this demo, we present a mobile app that automatically learns users' interests from their browsing or twitter history and provides them with a personalised feed of diverse, crowd curated content. The app also continuously learns from the users' interactions as they swipe to like or skip items recommended to them. In addition, users can discover trending stories and content liked by other users they follow. The crowd is thus formed of the users, who as a whole act as the curators of the content to be recommended.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116993256","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}
引用次数: 4
Top-N Recommendation for Shared Accounts 共享帐户Top-N推荐
Proceedings of the 9th ACM Conference on Recommender Systems Pub Date : 2015-09-16 DOI: 10.1145/2792838.2800170
Koen Verstrepen, Bart Goethals
{"title":"Top-N Recommendation for Shared Accounts","authors":"Koen Verstrepen, Bart Goethals","doi":"10.1145/2792838.2800170","DOIUrl":"https://doi.org/10.1145/2792838.2800170","url":null,"abstract":"Standard collaborative filtering recommender systems assume that every account in the training data represents a single user. However, multiple users often share a single account. A typical example is a single shopping account for the whole family. Traditional recommender systems fail in this situation. If contextual information is available, context aware recommender systems are the state-of-the-art solution. Yet, often no contextual information is available. Therefore, we introduce the challenge of recommending to shared accounts in the absence of contextual information. We propose a solution to this challenge for all cases in which the reference recommender system is an item-based top-N collaborative filtering recommender system, generating recommendations based on binary, positive-only feedback. We experimentally show the advantages of our proposed solution for tackling the problems that arise from the existence of shared accounts on multiple datasets.","PeriodicalId":325637,"journal":{"name":"Proceedings of the 9th ACM Conference on Recommender Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117042779","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}
引用次数: 32
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学术官方微信