Design of Hybrid Recommendation Algorithm in Online Shopping System

Yingchao Wang, Yuanhao Zhu, Zongtian Zhang, Huihuang Liu, Peng Guo
{"title":"Design of Hybrid Recommendation Algorithm in Online Shopping System","authors":"Yingchao Wang, Yuanhao Zhu, Zongtian Zhang, Huihuang Liu, Peng Guo","doi":"10.32604/jnm.2021.016655","DOIUrl":null,"url":null,"abstract":"In order to improve user satisfaction and loyalty on e-commerce websites, recommendation algorithms are used to recommend products that may be of interest to users. Therefore, the accuracy of the recommendation algorithm is a primary issue. So far, there are three mainstream recommendation algorithms, content-based recommendation algorithms, collaborative filtering algorithms and hybrid recommendation algorithms. Content-based recommendation algorithms and collaborative filtering algorithms have their own shortcomings. The contentbased recommendation algorithm has the problem of the diversity of recommended items, while the collaborative filtering algorithm has the problem of data sparsity and scalability. On the basis of these two algorithms, the hybrid recommendation algorithm learns from each other’s strengths and combines the advantages of the two algorithms to provide people with better services. This article will focus on the use of a content-based recommendation algorithm to mine the user’s existing interests, and then combine the collaborative filtering algorithm to establish a potential interest model, mix the existing and potential interests, and calculate with the candidate search content set. The similarity gets the recommendation list.","PeriodicalId":69198,"journal":{"name":"新媒体杂志(英文)","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"新媒体杂志(英文)","FirstCategoryId":"1092","ListUrlMain":"https://doi.org/10.32604/jnm.2021.016655","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In order to improve user satisfaction and loyalty on e-commerce websites, recommendation algorithms are used to recommend products that may be of interest to users. Therefore, the accuracy of the recommendation algorithm is a primary issue. So far, there are three mainstream recommendation algorithms, content-based recommendation algorithms, collaborative filtering algorithms and hybrid recommendation algorithms. Content-based recommendation algorithms and collaborative filtering algorithms have their own shortcomings. The contentbased recommendation algorithm has the problem of the diversity of recommended items, while the collaborative filtering algorithm has the problem of data sparsity and scalability. On the basis of these two algorithms, the hybrid recommendation algorithm learns from each other’s strengths and combines the advantages of the two algorithms to provide people with better services. This article will focus on the use of a content-based recommendation algorithm to mine the user’s existing interests, and then combine the collaborative filtering algorithm to establish a potential interest model, mix the existing and potential interests, and calculate with the candidate search content set. The similarity gets the recommendation list.
网上购物系统中混合推荐算法的设计
为了提高电子商务网站用户的满意度和忠诚度,使用推荐算法来推荐用户可能感兴趣的产品。因此,推荐算法的准确性是一个首要问题。到目前为止,主流推荐算法有三种:基于内容的推荐算法、协同过滤算法和混合推荐算法。基于内容的推荐算法和协同过滤算法都有各自的不足。基于内容的推荐算法存在推荐项目多样性的问题,而协同过滤算法存在数据稀疏性和可扩展性的问题。混合推荐算法在这两种算法的基础上,取长补短,结合两种算法的优点,为人们提供更好的服务。本文将重点利用基于内容的推荐算法挖掘用户的现有兴趣,然后结合协同过滤算法建立潜在兴趣模型,将现有兴趣和潜在兴趣混合,并用候选搜索内容集进行计算。相似度得到推荐列表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信