Clustering-based recommendation method with enhanced grasshopper optimisation algorithm

IF 7.3 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE CAAI Transactions on Intelligence Technology Pub Date : 2025-02-12 DOI:10.1049/cit2.12408
Zihao Zhao, Yingchun Xia, Wenjun Xu, Hui Yu, Shuai Yang, Cheng Chen, Xiaohui Yuan, Xiaobo Zhou, Qingyong Wang, Lichuan Gu
{"title":"Clustering-based recommendation method with enhanced grasshopper optimisation algorithm","authors":"Zihao Zhao,&nbsp;Yingchun Xia,&nbsp;Wenjun Xu,&nbsp;Hui Yu,&nbsp;Shuai Yang,&nbsp;Cheng Chen,&nbsp;Xiaohui Yuan,&nbsp;Xiaobo Zhou,&nbsp;Qingyong Wang,&nbsp;Lichuan Gu","doi":"10.1049/cit2.12408","DOIUrl":null,"url":null,"abstract":"<p>In the era of big data, personalised recommendation systems are essential for enhancing user engagement and driving business growth. However, traditional recommendation algorithms, such as collaborative filtering, face significant challenges due to data sparsity, algorithm scalability, and the difficulty of adapting to dynamic user preferences. These limitations hinder the ability of systems to provide highly accurate and personalised recommendations. To address these challenges, this paper proposes a clustering-based recommendation method that integrates an enhanced Grasshopper Optimisation Algorithm (GOA), termed LCGOA, to improve the accuracy and efficiency of recommendation systems by optimising cluster centroids in a dynamic environment. By combining the K-means algorithm with the enhanced GOA, which incorporates a Lévy flight mechanism and multi-strategy co-evolution, our method overcomes the centroid sensitivity issue, a key limitation in traditional clustering techniques. Experimental results across multiple datasets show that the proposed LCGOA-based method significantly outperforms conventional recommendation algorithms in terms of recommendation accuracy, offering more relevant content to users and driving greater customer satisfaction and business growth.</p>","PeriodicalId":46211,"journal":{"name":"CAAI Transactions on Intelligence Technology","volume":"10 2","pages":"494-509"},"PeriodicalIF":7.3000,"publicationDate":"2025-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cit2.12408","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CAAI Transactions on Intelligence Technology","FirstCategoryId":"94","ListUrlMain":"https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/cit2.12408","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In the era of big data, personalised recommendation systems are essential for enhancing user engagement and driving business growth. However, traditional recommendation algorithms, such as collaborative filtering, face significant challenges due to data sparsity, algorithm scalability, and the difficulty of adapting to dynamic user preferences. These limitations hinder the ability of systems to provide highly accurate and personalised recommendations. To address these challenges, this paper proposes a clustering-based recommendation method that integrates an enhanced Grasshopper Optimisation Algorithm (GOA), termed LCGOA, to improve the accuracy and efficiency of recommendation systems by optimising cluster centroids in a dynamic environment. By combining the K-means algorithm with the enhanced GOA, which incorporates a Lévy flight mechanism and multi-strategy co-evolution, our method overcomes the centroid sensitivity issue, a key limitation in traditional clustering techniques. Experimental results across multiple datasets show that the proposed LCGOA-based method significantly outperforms conventional recommendation algorithms in terms of recommendation accuracy, offering more relevant content to users and driving greater customer satisfaction and business growth.

Abstract Image

Abstract Image

Abstract Image

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于聚类的推荐方法与增强型蚱蜢优化算法
在大数据时代,个性化推荐系统对于提高用户参与度和推动业务增长至关重要。然而,传统的推荐算法,如协同过滤,由于数据稀疏性、算法可扩展性和难以适应动态用户偏好而面临重大挑战。这些限制阻碍了系统提供高度准确和个性化建议的能力。为了解决这些挑战,本文提出了一种基于聚类的推荐方法,该方法集成了一种增强的Grasshopper优化算法(GOA),称为LCGOA,通过在动态环境中优化聚类质心来提高推荐系统的准确性和效率。该方法将K-means算法与基于lsamvy飞行机制和多策略协同进化的增强型GOA算法相结合,克服了传统聚类技术的质心敏感性问题。跨多个数据集的实验结果表明,提出的基于lcgoa的推荐方法在推荐精度方面显著优于传统推荐算法,为用户提供了更多相关内容,并推动了更高的客户满意度和业务增长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CAAI Transactions on Intelligence Technology
CAAI Transactions on Intelligence Technology COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
11.00
自引率
3.90%
发文量
134
审稿时长
35 weeks
期刊介绍: CAAI Transactions on Intelligence Technology is a leading venue for original research on the theoretical and experimental aspects of artificial intelligence technology. We are a fully open access journal co-published by the Institution of Engineering and Technology (IET) and the Chinese Association for Artificial Intelligence (CAAI) providing research which is openly accessible to read and share worldwide.
期刊最新文献
Lightweight Hybrid Wafer Defect Pattern Network Based on Feedforward Efficient Attention Fixed-Time Zeroing Neural Dynamics for Adaptive Coordination of Multi-Agent Systems Brain-RetinaNet: Detection of Brain Tumour Using an Improved RetinaNet in Magnetic Resonance Imaging Multi-Objective Optimisation Framework for Heterogeneous Federated Learning MVI-Depth: Multi-View Indoor Depth Estimation Based on the Fusion of Semantic Information
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1