改进了基于用户的主题模型和时间标签协同过滤算法

Na Liu, Ying Lu, Xiao-Jun Tang, Ming-Xia Li, Chunli Wang
{"title":"改进了基于用户的主题模型和时间标签协同过滤算法","authors":"Na Liu, Ying Lu, Xiao-Jun Tang, Ming-Xia Li, Chunli Wang","doi":"10.1504/ijcse.2020.10029349","DOIUrl":null,"url":null,"abstract":"Collaborative filtering algorithms make use of interaction rates between users and items for generating recommendations. Similarity among users is calculated based on rating mostly, without considering explicit properties of users involved. Considering the number of tags of a user can direct response the user preference to some extent, we propose a collaborative filtering algorithm using topic model called user-item-tag latent Dirichlet allocation (UITLDA) in this paper. UITLDA model consists of two parts. The first part is active user with its item. The second part is active user with its tag. We form topic model from these two parts respectively. The two topics constrain each other and integrate into a new topic distribution. This model not only increases the user's similarity, but also reduces the density of the matrix. In prediction computation, we also introduce time delay function to increase the precision. The experiments showed that the proposed algorithm achieved better performance compared with baseline on MovieLens datasets.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Improved user-based collaborative filtering algorithm with topic model and time tag\",\"authors\":\"Na Liu, Ying Lu, Xiao-Jun Tang, Ming-Xia Li, Chunli Wang\",\"doi\":\"10.1504/ijcse.2020.10029349\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Collaborative filtering algorithms make use of interaction rates between users and items for generating recommendations. Similarity among users is calculated based on rating mostly, without considering explicit properties of users involved. Considering the number of tags of a user can direct response the user preference to some extent, we propose a collaborative filtering algorithm using topic model called user-item-tag latent Dirichlet allocation (UITLDA) in this paper. UITLDA model consists of two parts. The first part is active user with its item. The second part is active user with its tag. We form topic model from these two parts respectively. The two topics constrain each other and integrate into a new topic distribution. This model not only increases the user's similarity, but also reduces the density of the matrix. In prediction computation, we also introduce time delay function to increase the precision. The experiments showed that the proposed algorithm achieved better performance compared with baseline on MovieLens datasets.\",\"PeriodicalId\":340410,\"journal\":{\"name\":\"Int. J. Comput. Sci. Eng.\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Comput. Sci. Eng.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijcse.2020.10029349\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Comput. Sci. Eng.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijcse.2020.10029349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

协同过滤算法利用用户和项目之间的交互率来生成推荐。用户之间的相似度大多是基于评分来计算的,没有考虑用户的显式属性。考虑到用户的标签数量可以在一定程度上直接响应用户的偏好,本文提出了一种基于主题模型的协同过滤算法——用户-物品-标签潜狄利克雷分配(UITLDA)。utlda模型由两部分组成。第一部分是活动用户及其项目。第二部分是活动用户及其标记。我们分别从这两部分组成主题模型。这两个主题相互约束,形成一个新的主题分布。该模型既提高了用户的相似度,又降低了矩阵的密度。在预测计算中,我们还引入了时滞函数来提高预测精度。实验表明,该算法在MovieLens数据集上取得了比基线更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improved user-based collaborative filtering algorithm with topic model and time tag
Collaborative filtering algorithms make use of interaction rates between users and items for generating recommendations. Similarity among users is calculated based on rating mostly, without considering explicit properties of users involved. Considering the number of tags of a user can direct response the user preference to some extent, we propose a collaborative filtering algorithm using topic model called user-item-tag latent Dirichlet allocation (UITLDA) in this paper. UITLDA model consists of two parts. The first part is active user with its item. The second part is active user with its tag. We form topic model from these two parts respectively. The two topics constrain each other and integrate into a new topic distribution. This model not only increases the user's similarity, but also reduces the density of the matrix. In prediction computation, we also introduce time delay function to increase the precision. The experiments showed that the proposed algorithm achieved better performance compared with baseline on MovieLens datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ECC-based lightweight mutual authentication protocol for fog enabled IoT system using three-way authentication procedure Gene selection and classification combining information gain ratio with fruit fly optimisation algorithm for single-cell RNA-seq data Attitude control of an unmanned patrol helicopter based on an optimised spiking neural membrane system for use in coal mines CEMP-IR: a novel location aware cache invalidation and replacement policy Prediction of consumer preference for the bottom of the pyramid using EEG-based deep model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1