Integrating Spectral-CF and FP-Growth for Recommendation

H. Zhang, Yu Liu, Keyin Cao
{"title":"Integrating Spectral-CF and FP-Growth for Recommendation","authors":"H. Zhang, Yu Liu, Keyin Cao","doi":"10.1145/3377817.3377845","DOIUrl":null,"url":null,"abstract":"In the era of information overload, both information consumers and information producers have encountered great challenges: for information consumers, it is very difficult to find information of interest from a large amount of information. The recommendation system is an important tool to resolve this contradiction. Despite the popularity of Collaborative Filtering (CF), CF-based methods are haunted by the cold-start and data sparseness problems. This paper took commodity recommendation as to the research object and proposed a recommendation algorithm that combines Spectral-CF and FP-Growth. Firstly, Firstly, the association rule algorithm FP-Growth is mine the association rules of the target user and the target item directly, and recommend the collection of items with higher similarity for the user. Secondly, using a spectral collaborative filtering algorithm Perform convolution operations in the spectral domain. Finally, providing the final result by combining the Spectral-CF and FP-Growth recommendation. The experimental results on the MovieLens dataset show that the proposed method can better solve the problem of data sparseness and cold-start problems, improvement the accuracy of recommendation.","PeriodicalId":343999,"journal":{"name":"Proceedings of the 2019 2nd International Conference on E-Business, Information Management and Computer Science","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 2nd International Conference on E-Business, Information Management and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3377817.3377845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In the era of information overload, both information consumers and information producers have encountered great challenges: for information consumers, it is very difficult to find information of interest from a large amount of information. The recommendation system is an important tool to resolve this contradiction. Despite the popularity of Collaborative Filtering (CF), CF-based methods are haunted by the cold-start and data sparseness problems. This paper took commodity recommendation as to the research object and proposed a recommendation algorithm that combines Spectral-CF and FP-Growth. Firstly, Firstly, the association rule algorithm FP-Growth is mine the association rules of the target user and the target item directly, and recommend the collection of items with higher similarity for the user. Secondly, using a spectral collaborative filtering algorithm Perform convolution operations in the spectral domain. Finally, providing the final result by combining the Spectral-CF and FP-Growth recommendation. The experimental results on the MovieLens dataset show that the proposed method can better solve the problem of data sparseness and cold-start problems, improvement the accuracy of recommendation.
结合光谱- cf和FP-Growth进行推荐
在信息超载的时代,信息消费者和信息生产者都遇到了巨大的挑战:对于信息消费者来说,从海量的信息中找到自己感兴趣的信息是非常困难的。推荐系统是解决这一矛盾的重要工具。尽管协同过滤(CF)很受欢迎,但基于协同过滤的方法仍然受到冷启动和数据稀疏性问题的困扰。本文以商品推荐为研究对象,提出了一种结合spectrum - cf和FP-Growth的推荐算法。首先,关联规则算法FP-Growth直接挖掘目标用户与目标物品之间的关联规则,并为用户推荐相似度较高的物品集合。其次,利用谱协同滤波算法在谱域进行卷积运算。最后,结合spectrum - cf和FP-Growth推荐给出最终结果。在MovieLens数据集上的实验结果表明,该方法能较好地解决数据稀疏性和冷启动问题,提高推荐的准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信