An Advanced Recommendation System by Combining Popularity-Based and User-Based Collaborative Filtering Using Machine Learning.

Abdullah Al Jobaer, Bimurta Bismoy Sanchi, Aaquib Javed, Md Shariful Islam, Abu Shafin Mohammad Mahdee Jameel
{"title":"An Advanced Recommendation System by Combining Popularity-Based and User-Based Collaborative Filtering Using Machine Learning.","authors":"Abdullah Al Jobaer, Bimurta Bismoy Sanchi, Aaquib Javed, Md Shariful Islam, Abu Shafin Mohammad Mahdee Jameel","doi":"10.1109/icsct53883.2021.9642580","DOIUrl":null,"url":null,"abstract":"Finding the similarity is one of the critical rules of a recommender system. Popularity-based filtering offers to generalize recommendations to every user based on its popularity. Recommendation system or recommender engine is one of the most discussed topics in machine learning for business. There are three types of the commonly used recommender system. They are Popularity-based, Content-based, and Collaborative filtering-based. In content-based, it recommends a similar item based on a particular item, where collaborative filtering recommends an item to a person based on other equivalent persons’ interests. This research work has developed an algorithm that combines Popularity-based and User-based collaborative filtering using machine learning. In this paperwork, we applied textual clustering to keep the similar item precisely. Simultaneously, we tried to optimize our recommendation search time complexity. To evaluate the approaches, we used the Deskdrop dataset [6], and in the final stage, we used some distance matrix-like Pearson correlation to find similar users. The main lacking in general user-based collaborative filtering is its laziness. We have reduced the time complexity by applying textual clustering and file hashing to implement the data through machine learning.","PeriodicalId":320103,"journal":{"name":"2021 International Conference on Science & Contemporary Technologies (ICSCT)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Science & Contemporary Technologies (ICSCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icsct53883.2021.9642580","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Finding the similarity is one of the critical rules of a recommender system. Popularity-based filtering offers to generalize recommendations to every user based on its popularity. Recommendation system or recommender engine is one of the most discussed topics in machine learning for business. There are three types of the commonly used recommender system. They are Popularity-based, Content-based, and Collaborative filtering-based. In content-based, it recommends a similar item based on a particular item, where collaborative filtering recommends an item to a person based on other equivalent persons’ interests. This research work has developed an algorithm that combines Popularity-based and User-based collaborative filtering using machine learning. In this paperwork, we applied textual clustering to keep the similar item precisely. Simultaneously, we tried to optimize our recommendation search time complexity. To evaluate the approaches, we used the Deskdrop dataset [6], and in the final stage, we used some distance matrix-like Pearson correlation to find similar users. The main lacking in general user-based collaborative filtering is its laziness. We have reduced the time complexity by applying textual clustering and file hashing to implement the data through machine learning.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结合基于人气和基于用户的机器学习协同过滤的高级推荐系统。
寻找相似度是推荐系统的关键规则之一。基于流行度的过滤提供基于其流行度的推荐给每个用户。推荐系统或推荐引擎是商业机器学习中讨论最多的话题之一。常用的推荐系统有三种类型。它们是基于人气的、基于内容的和基于协作过滤的。在基于内容的情况下,它根据一个特定的项目推荐一个类似的项目,而协同过滤则根据其他对等人员的兴趣向某人推荐一个项目。这项研究工作开发了一种算法,使用机器学习结合了基于人气和基于用户的协同过滤。在这项文书工作中,我们应用文本聚类来精确地保持相似的项目。同时,我们尝试优化推荐搜索的时间复杂度。为了评估这些方法,我们使用了Deskdrop数据集[6],在最后阶段,我们使用了一些类似距离矩阵的Pearson相关性来寻找相似的用户。一般基于用户的协同过滤的主要缺点是懒惰。我们通过机器学习,采用文本聚类和文件哈希来实现数据,降低了时间复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Finite Element Prediction of Deformation of Closed-cell Cellular Materials for Sustainable Materials Characterisation An Advanced Recommendation System by Combining Popularity-Based and User-Based Collaborative Filtering Using Machine Learning. [ICSCT 2021 Copyright notice] Improving Quality of Service in Computer Networks Applying the Eight Classes of Service Proposal of Pattern-Reconfigurable Self-Oscillating Active Array Antenna Integrating Slot-Line Gunn Oscillator and Hybrid Coupler
×
引用
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