Optimize Recommendation System with Topic Modeling and Clustering

Qianqiao Liang, Xiaolin Zheng, Menghan Wang, Haodong Chen, Pin Lu
{"title":"Optimize Recommendation System with Topic Modeling and Clustering","authors":"Qianqiao Liang, Xiaolin Zheng, Menghan Wang, Haodong Chen, Pin Lu","doi":"10.1109/ICEBE.2017.13","DOIUrl":null,"url":null,"abstract":"With the rapid development of e-commerce, recommender systems have been widely studied. Many recommendation algorithms utilize ratings and reviews information. However, as the number of users and items grows, these algorithms face the problems of sparsity and scalability. Those problems make it hard to extract useful information from a highly sparse rating matrix and to apply a trained model to larger datasets. In this paper, we aim at solving the sparsity and scalability problems using rating and review information. Three possible solutions for sparsity and scalability problems are concluded and a novel recommendation model called TCR which combines those three ideas are proposed. Experiments on real-world datasets show that our proposed method has better performance on top-N recommendation and has better scalability compared to the state-of-the-art models.","PeriodicalId":347774,"journal":{"name":"2017 IEEE 14th International Conference on e-Business Engineering (ICEBE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 14th International Conference on e-Business Engineering (ICEBE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEBE.2017.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

With the rapid development of e-commerce, recommender systems have been widely studied. Many recommendation algorithms utilize ratings and reviews information. However, as the number of users and items grows, these algorithms face the problems of sparsity and scalability. Those problems make it hard to extract useful information from a highly sparse rating matrix and to apply a trained model to larger datasets. In this paper, we aim at solving the sparsity and scalability problems using rating and review information. Three possible solutions for sparsity and scalability problems are concluded and a novel recommendation model called TCR which combines those three ideas are proposed. Experiments on real-world datasets show that our proposed method has better performance on top-N recommendation and has better scalability compared to the state-of-the-art models.
基于主题建模和聚类的推荐系统优化
随着电子商务的快速发展,推荐系统得到了广泛的研究。许多推荐算法利用评级和评论信息。然而,随着用户和项目数量的增长,这些算法面临着稀疏性和可扩展性的问题。这些问题使得很难从高度稀疏的评级矩阵中提取有用的信息,也很难将训练好的模型应用于更大的数据集。在本文中,我们的目标是利用评级和评论信息来解决稀疏性和可扩展性问题。总结了稀疏性和可扩展性问题的三种可能的解决方案,并提出了一种新的推荐模型TCR,该模型结合了这三种思想。在真实数据集上的实验表明,与最先进的模型相比,我们提出的方法具有更好的top-N推荐性能和更好的可扩展性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信