基于评论的推荐系统聚类方法分析

Sabeena Yasmin Hera, Mohammad Amjad
{"title":"基于评论的推荐系统聚类方法分析","authors":"Sabeena Yasmin Hera, Mohammad Amjad","doi":"10.11591/ijict.v13i1.pp1-8","DOIUrl":null,"url":null,"abstract":"Because of the explosion in data, it is now incredibly difficult for a single person to filter through all of the information and extract what they need. As a result, information filtering algorithms are necessary to uncover meaningful information from the massive amount of data already available online. Users can benefit from recommendation systems (RSs) since they simplify the process of identifying relevant information. User ratings are incredibly significant for creating recommendations. Previously, academics relied on historical user ratings to predict future ratings, but today, consumers are paying more attention to user reviews because they contain so much relevant information about the user's decision. The proposed approach uses written testimonials to overcome the issue of doubt in the ratings' pasts. Using two data sets, we performed experimental evaluations of the proposed framework. For prediction, clustering algorithms are used with natural language processing in this strategy. It also evaluates the findings of various methods, such as the K-mean, spectral, and hierarchical clustering algorithms, and offers conclusions on which strategy is optimal for the supplied use cases. In addition, we demonstrate that the proposed technique outperforms alternatives that do not involve clustering.","PeriodicalId":245958,"journal":{"name":"International Journal of Informatics and Communication Technology (IJ-ICT)","volume":"26 11","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Review-based analysis of clustering approaches in a recommendation system\",\"authors\":\"Sabeena Yasmin Hera, Mohammad Amjad\",\"doi\":\"10.11591/ijict.v13i1.pp1-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Because of the explosion in data, it is now incredibly difficult for a single person to filter through all of the information and extract what they need. As a result, information filtering algorithms are necessary to uncover meaningful information from the massive amount of data already available online. Users can benefit from recommendation systems (RSs) since they simplify the process of identifying relevant information. User ratings are incredibly significant for creating recommendations. Previously, academics relied on historical user ratings to predict future ratings, but today, consumers are paying more attention to user reviews because they contain so much relevant information about the user's decision. The proposed approach uses written testimonials to overcome the issue of doubt in the ratings' pasts. Using two data sets, we performed experimental evaluations of the proposed framework. For prediction, clustering algorithms are used with natural language processing in this strategy. It also evaluates the findings of various methods, such as the K-mean, spectral, and hierarchical clustering algorithms, and offers conclusions on which strategy is optimal for the supplied use cases. In addition, we demonstrate that the proposed technique outperforms alternatives that do not involve clustering.\",\"PeriodicalId\":245958,\"journal\":{\"name\":\"International Journal of Informatics and Communication Technology (IJ-ICT)\",\"volume\":\"26 11\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Informatics and Communication Technology (IJ-ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11591/ijict.v13i1.pp1-8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Informatics and Communication Technology (IJ-ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11591/ijict.v13i1.pp1-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于数据的爆炸式增长,现在一个人很难从所有信息中筛选出自己需要的信息。因此,有必要使用信息过滤算法,从网上已有的海量数据中挖掘出有意义的信息。用户可以从推荐系统(RS)中获益,因为它们简化了识别相关信息的过程。用户评级对于创建推荐具有难以置信的重要意义。以前,学术界依靠历史用户评分来预测未来评分,但如今,消费者更加关注用户评论,因为它们包含了大量与用户决策相关的信息。所提出的方法利用书面推荐来克服对过去评分的怀疑问题。我们使用两个数据集对所提出的框架进行了实验评估。在预测方面,该策略使用了聚类算法和自然语言处理技术。它还评估了各种方法(如 K 均值、光谱和分层聚类算法)的结果,并就哪种策略最适合所提供的使用案例给出了结论。此外,我们还证明了所提出的技术优于不涉及聚类的其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Review-based analysis of clustering approaches in a recommendation system
Because of the explosion in data, it is now incredibly difficult for a single person to filter through all of the information and extract what they need. As a result, information filtering algorithms are necessary to uncover meaningful information from the massive amount of data already available online. Users can benefit from recommendation systems (RSs) since they simplify the process of identifying relevant information. User ratings are incredibly significant for creating recommendations. Previously, academics relied on historical user ratings to predict future ratings, but today, consumers are paying more attention to user reviews because they contain so much relevant information about the user's decision. The proposed approach uses written testimonials to overcome the issue of doubt in the ratings' pasts. Using two data sets, we performed experimental evaluations of the proposed framework. For prediction, clustering algorithms are used with natural language processing in this strategy. It also evaluates the findings of various methods, such as the K-mean, spectral, and hierarchical clustering algorithms, and offers conclusions on which strategy is optimal for the supplied use cases. In addition, we demonstrate that the proposed technique outperforms alternatives that do not involve clustering.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信