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

筛选
英文 中文
Spatial topic modeling in online social media for location recommendation 面向网络社交媒体位置推荐的空间主题建模
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507174
Bo Hu, M. Ester
{"title":"Spatial topic modeling in online social media for location recommendation","authors":"Bo Hu, M. Ester","doi":"10.1145/2507157.2507174","DOIUrl":"https://doi.org/10.1145/2507157.2507174","url":null,"abstract":"Mobile networks enable users to post on social media services (e.g., Twitter) from anywhere. The activities of mobile users involve three major entities: user, post, and location. The interaction of these entities is the key to answer questions such as who will post a message where and on what topic? In this paper, we address the problem of profiling mobile users by modeling their activities, i.e., we explore topic modeling considering the spatial and textual aspects of user posts, and predict future user locations. We propose the first ST (Spatial Topic) model to capture the correlation between users' movements and between user interests and the function of locations. We employ the sparse coding technique which greatly speeds up the learning process. We perform experiments on two real life data sets from Twitter and Yelp. Through comprehensive experiments, we demonstrate that our proposed model consistently improves the average precision@1,5,10,15,20 for location recommendation by at least 50% (Twitter) and 300% (Yelp) against existing state-of-the-art recommendation algorithms and geographical topic models.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"512 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":"133600186","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}
引用次数: 194
Topic diversity in tag recommendation 标签推荐中的主题多样性
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507184
F. Belém, Rodrygo L. T. Santos, J. Almeida, Marcos André Gonçalves
{"title":"Topic diversity in tag recommendation","authors":"F. Belém, Rodrygo L. T. Santos, J. Almeida, Marcos André Gonçalves","doi":"10.1145/2507157.2507184","DOIUrl":"https://doi.org/10.1145/2507157.2507184","url":null,"abstract":"Tag recommendation approaches have historically focused on maximizing the relevance of the recommended tags for a given object, such as a movie or a song. Nevertheless, different users may be interested in the same object for different reasons---for instance, the Star Wars movies may appeal to both adventure as well as to fantasy movie fans. In this situation, a sensible strategy is to provide a user with diverse recommendations of how to tag the object. In this paper, we address the problem of recommending relevant and diverse tags as a ranking problem. In particular, we propose a novel tag recommendation approach that explicitly takes into account the possible topics (e.g., categories) underlying an object in order to promote tags with high coverage and low redundancy with respect to these topics. We thoroughly evaluate our proposed approach using data collected from two popular Web 2.0 applications, namely, LastFM and MovieLens. Our experimental results attest the effectiveness of our approach at promoting more relevant and diverse tags in contrast to state-of-the-art relevance-based methods as well as a recently proposed method that takes both relevance and diversity into account.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"294 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":"132135618","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
Agent-based computational investing recommender system 基于agent的计算投资推荐系统
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508072
M. Taghavi, Kaveh Bakhtiyari, E. Scavino
{"title":"Agent-based computational investing recommender system","authors":"M. Taghavi, Kaveh Bakhtiyari, E. Scavino","doi":"10.1145/2507157.2508072","DOIUrl":"https://doi.org/10.1145/2507157.2508072","url":null,"abstract":"The fast development of computing and communication has reformed the financial markets' dynamics. Nowadays many people are investing and trading stocks through online channels and having access to real-time market information efficiently. There are more opportunities to lose or make money with all the stocks information available throughout the World; however, one should spend a lot of effort and time to follow those stocks and the available instant information. This paper presents a preliminary regarding a multi-agent recommender system for computational investing. This system utilizes a hybrid filtering technique to adaptively recommend the most profitable stocks at the right time according to investor's personal favour. The hybrid technique includes collaborative and content-based filtering. The content-based model uses investor preferences, influencing macro-economic factors, stocks profiles and the predicted trend to tailor to its advices. The collaborative filter assesses the investor pairs' investing behaviours and actions that are proficient in economic market to recommend the similar ones to the target investor.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"80 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":"117091247","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}
引用次数: 27
Learning to rank recommendations with the k-order statistic loss 学习用k阶统计量损失对推荐进行排序
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507210
J. Weston, H. Yee, Ron J. Weiss
{"title":"Learning to rank recommendations with the k-order statistic loss","authors":"J. Weston, H. Yee, Ron J. Weiss","doi":"10.1145/2507157.2507210","DOIUrl":"https://doi.org/10.1145/2507157.2507210","url":null,"abstract":"Making recommendations by learning to rank is becoming an increasingly studied area. Approaches that use stochastic gradient descent scale well to large collaborative filtering datasets, and it has been shown how to approximately optimize the mean rank, or more recently the top of the ranked list. In this work we present a family of loss functions, the k-order statistic loss, that includes these previous approaches as special cases, and also derives new ones that we show to be useful. In particular, we present (i) a new variant that more accurately optimizes precision at k, and (ii) a novel procedure of optimizing the mean maximum rank, which we hypothesize is useful to more accurately cover all of the user's tastes. The general approach works by sampling N positive items, ordering them by the score assigned by the model, and then weighting the example as a function of this ordered set. Our approach is studied in two real-world systems, Google Music and YouTube video recommendations, where we obtain improvements for computable metrics, and in the YouTube case, increased user click through and watch duration when deployed live on www.youtube.com.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"237 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":"124605983","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}
引用次数: 65
Session details: Technical session: user experience 会话详情:技术会话:用户体验
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/3249963
D. Jannach
{"title":"Session details: Technical session: user experience","authors":"D. Jannach","doi":"10.1145/3249963","DOIUrl":"https://doi.org/10.1145/3249963","url":null,"abstract":"","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":"129761856","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}
引用次数: 0
Workshop on reproducibility and replication in recommender systems evaluation: RepSys 推荐系统评价中的再现性和复制讲习班:RepSys
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508006
Alejandro Bellogín, P. Castells, A. Said, D. Tikk
{"title":"Workshop on reproducibility and replication in recommender systems evaluation: RepSys","authors":"Alejandro Bellogín, P. Castells, A. Said, D. Tikk","doi":"10.1145/2507157.2508006","DOIUrl":"https://doi.org/10.1145/2507157.2508006","url":null,"abstract":"Experiment replication and reproduction are key requirements for empirical research methodology, and an important open issue in the field of Recommender Systems. When an experiment is repeated by a different researcher and exactly the same result is obtained, we can say the experiment has been replicated. When the results are not exactly the same but the conclusions are compatible with the prior ones, we have a reproduction of the experiment. Reproducibility and replication involve recommendation algorithm implementations, experimental protocols, and evaluation metrics. While the problem of reproducibility and replication has been recognized in the Recommender Systems community, the need for a clear solution remains largely unmet, which motivates the present workshop.","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":"127404076","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
Context-aware review helpfulness rating prediction 上下文感知审查,有用性评级预测
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507183
Jiliang Tang, Huiji Gao, Xia Hu, Huan Liu
{"title":"Context-aware review helpfulness rating prediction","authors":"Jiliang Tang, Huiji Gao, Xia Hu, Huan Liu","doi":"10.1145/2507157.2507183","DOIUrl":"https://doi.org/10.1145/2507157.2507183","url":null,"abstract":"Online reviews play a vital role in the decision-making process for online users. Helpful reviews are usually buried in a large number of unhelpful reviews, and with the consistently increasing number of reviews, it becomes more and more difficult for online users to find helpful reviews. Therefore most online review websites allow online users to rate the helpfulness of a review and a global helpfulness score is computed for the review based on its available ratings. However, in reality, user-specified helpfulness ratings for reviews are very sparse - a few reviews attract large numbers of helpfulness ratings while most reviews obtain few or even no helpfulness ratings. The available helpfulness ratings are too sparse for online users to assess the helpfulness of reviews. Also the helpfulness of a review is not necessarily equally useful for all users and users with different background may treat the helpfulness of a review very differently. The user idiosyncracy of review helpfulness motivates us to study the problem of review helpfulness rating prediction in this paper. We first identify various types of context information, model them mathematically, and propose a context-aware review helpfulness rating prediction framework CAP. Experimental results demonstrate the effectiveness of the proposed framework and the importance of context awareness in solving the review helpfulness rating prediction problem.","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":"129271599","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}
引用次数: 81
Understanding and improving relational matrix factorization in recommender systems 理解和改进推荐系统中的关系矩阵分解
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507178
Li Pu, B. Faltings
{"title":"Understanding and improving relational matrix factorization in recommender systems","authors":"Li Pu, B. Faltings","doi":"10.1145/2507157.2507178","DOIUrl":"https://doi.org/10.1145/2507157.2507178","url":null,"abstract":"Matrix factorization techniques such as the singular value decomposition (SVD) have had great success in recommender systems. We present a new perspective of SVD for constructing a latent space from the training data, which is justified by the theory of hypergraph model. We show that the vectors representing the items in the latent space can be grouped into (approximately) orthogonal clusters which correspond to the vertex clusters in the co-rating hypergraph, and the lengths of the vectors are indicators of the representativeness of the items. These properties are used for making top-$N$ recommendations in a two-phase algorithm. In this work, we provide a new explanation for the significantly better performance of the asymmetric SVD approaches and a novel algorithm for better diversity in top-N recommendations.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"140 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114109977","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}
引用次数: 17
First workshop on large-scale recommender systems: research and best practice(LSRS 2013) 第一次关于大规模推荐系统的研讨会:研究和最佳实践(LSRS 2013)
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2508007
Tao Ye, Danny Bickson, Quan Yuan
{"title":"First workshop on large-scale recommender systems: research and best practice(LSRS 2013)","authors":"Tao Ye, Danny Bickson, Quan Yuan","doi":"10.1145/2507157.2508007","DOIUrl":"https://doi.org/10.1145/2507157.2508007","url":null,"abstract":"With the increase of data collected and computation power available, modern recommender systems are ever facing new challenges. While complex models are developed in academia, industry practice seems to focus on relatively simple techniques that can deal with the magnitude of data and the need to distribute the computation. The first workshop on large-scale recommender systems (LSRS) is a meeting place for industry and academia to discuss the current and future challenges of applied large-scale recommender systems.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"7 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":"121505125","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
Hidden factors and hidden topics: understanding rating dimensions with review text 隐藏的因素和隐藏的主题:用评论文本理解评级维度
Proceedings of the 7th ACM conference on Recommender systems Pub Date : 2013-10-12 DOI: 10.1145/2507157.2507163
Julian McAuley, J. Leskovec
{"title":"Hidden factors and hidden topics: understanding rating dimensions with review text","authors":"Julian McAuley, J. Leskovec","doi":"10.1145/2507157.2507163","DOIUrl":"https://doi.org/10.1145/2507157.2507163","url":null,"abstract":"In order to recommend products to users we must ultimately predict how a user will respond to a new product. To do so we must uncover the implicit tastes of each user as well as the properties of each product. For example, in order to predict whether a user will enjoy Harry Potter, it helps to identify that the book is about wizards, as well as the user's level of interest in wizardry. User feedback is required to discover these latent product and user dimensions. Such feedback often comes in the form of a numeric rating accompanied by review text. However, traditional methods often discard review text, which makes user and product latent dimensions difficult to interpret, since they ignore the very text that justifies a user's rating. In this paper, we aim to combine latent rating dimensions (such as those of latent-factor recommender systems) with latent review topics (such as those learned by topic models like LDA). Our approach has several advantages. Firstly, we obtain highly interpretable textual labels for latent rating dimensions, which helps us to `justify' ratings with text. Secondly, our approach more accurately predicts product ratings by harnessing the information present in review text; this is especially true for new products and users, who may have too few ratings to model their latent factors, yet may still provide substantial information from the text of even a single review. Thirdly, our discovered topics can be used to facilitate other tasks such as automated genre discovery, and to identify useful and representative reviews.","PeriodicalId":225573,"journal":{"name":"Proceedings of the 7th ACM conference on Recommender systems","volume":"34 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":"122631844","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}
引用次数: 1644
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学术官方微信
小红书