具有丰富侧信息和隐式反馈的推荐的矩阵协因式分解

HetRec '11 Pub Date : 2011-10-27 DOI:10.1145/2039320.2039330
Yi Fang, Luo Si
{"title":"具有丰富侧信息和隐式反馈的推荐的矩阵协因式分解","authors":"Yi Fang, Luo Si","doi":"10.1145/2039320.2039330","DOIUrl":null,"url":null,"abstract":"Most recommender systems focus on the areas of leisure activities. As the Web evolves into omnipresent utility, recommender systems penetrate more serious applications such as those in online scientific communities. In this paper, we investigate the task of recommendation in online scientific communities which exhibit two characteristics: 1) there exists very rich information about users and items; 2) The users in the scientific communities tend not to give explicit ratings to the resources, even though they have clear preference in their minds. To address the above two characteristics, we propose matrix factorization techniques to incorporate rich user and item information into recommendation with implicit feedback. Specifically, the user information matrix is decomposed into a shared subspace with the implicit feedback matrix, and so does the item information matrix. In other words, the subspaces between multiple related matrices are jointly learned by sharing information between the matrices. The experiments on the testbed from an online scientific community (i.e., Nanohub) show that the proposed method can effectively improve the recommendation performance.","PeriodicalId":144030,"journal":{"name":"HetRec '11","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"91","resultStr":"{\"title\":\"Matrix co-factorization for recommendation with rich side information and implicit feedback\",\"authors\":\"Yi Fang, Luo Si\",\"doi\":\"10.1145/2039320.2039330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most recommender systems focus on the areas of leisure activities. As the Web evolves into omnipresent utility, recommender systems penetrate more serious applications such as those in online scientific communities. In this paper, we investigate the task of recommendation in online scientific communities which exhibit two characteristics: 1) there exists very rich information about users and items; 2) The users in the scientific communities tend not to give explicit ratings to the resources, even though they have clear preference in their minds. To address the above two characteristics, we propose matrix factorization techniques to incorporate rich user and item information into recommendation with implicit feedback. Specifically, the user information matrix is decomposed into a shared subspace with the implicit feedback matrix, and so does the item information matrix. In other words, the subspaces between multiple related matrices are jointly learned by sharing information between the matrices. The experiments on the testbed from an online scientific community (i.e., Nanohub) show that the proposed method can effectively improve the recommendation performance.\",\"PeriodicalId\":144030,\"journal\":{\"name\":\"HetRec '11\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"91\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"HetRec '11\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2039320.2039330\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"HetRec '11","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2039320.2039330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 91

摘要

大多数推荐系统侧重于休闲活动领域。随着网络发展成为无所不在的实用程序,推荐系统渗透到更严肃的应用程序中,例如在线科学社区。本文研究了在线科学社区的推荐任务,它具有两个特点:1)存在非常丰富的用户和项目信息;2)科学界的用户虽然对资源有明确的偏好,但往往不会给出明确的评分。针对上述两个特点,我们提出了矩阵分解技术,将丰富的用户和商品信息融合到隐式反馈的推荐中。具体来说,用户信息矩阵被分解为与隐式反馈矩阵共享的子空间,项目信息矩阵也被分解为共享的子空间。换句话说,多个相关矩阵之间的子空间是通过共享矩阵之间的信息来共同学习的。在一个在线科学社区(Nanohub)的测试平台上进行的实验表明,该方法可以有效地提高推荐性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Matrix co-factorization for recommendation with rich side information and implicit feedback
Most recommender systems focus on the areas of leisure activities. As the Web evolves into omnipresent utility, recommender systems penetrate more serious applications such as those in online scientific communities. In this paper, we investigate the task of recommendation in online scientific communities which exhibit two characteristics: 1) there exists very rich information about users and items; 2) The users in the scientific communities tend not to give explicit ratings to the resources, even though they have clear preference in their minds. To address the above two characteristics, we propose matrix factorization techniques to incorporate rich user and item information into recommendation with implicit feedback. Specifically, the user information matrix is decomposed into a shared subspace with the implicit feedback matrix, and so does the item information matrix. In other words, the subspaces between multiple related matrices are jointly learned by sharing information between the matrices. The experiments on the testbed from an online scientific community (i.e., Nanohub) show that the proposed method can effectively improve the recommendation performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信