A Study of Digital Museum Collection Recommendation Algorithm Based on Improved Fuzzy Clustering Algorithm

IF 0.8 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE International Journal of Computational Intelligence and Applications Pub Date : 2023-11-10 DOI:10.1142/s1469026823500293
Yi Chen, Jingsong Sun, Ziyue Xu, Genglong Zhang, Naibin Qi, Yuchen Song
{"title":"A Study of Digital Museum Collection Recommendation Algorithm Based on Improved Fuzzy Clustering Algorithm","authors":"Yi Chen, Jingsong Sun, Ziyue Xu, Genglong Zhang, Naibin Qi, Yuchen Song","doi":"10.1142/s1469026823500293","DOIUrl":null,"url":null,"abstract":"With the rapid advancement of internet technology, various industries have accumulated vast amounts of data, including on user behavior and personal preferences. Traditional museums can leverage this user data to uncover individual preferences and offer personalized services to their visitors. However, the exponential growth of information has also led to the problem of information overload, making it challenging for users to find relevant information within the vast data landscape. Consequently, the utilization rate of available information decreases. By harnessing the power of cloud computing, big data analytics, and recommendation systems, museums can enhance visitors’ touring experiences by helping them discover collections aligned with their interests and connecting with like-minded individuals. To address this objective, the research focuses on optimizing the initial clustering centers of the fuzzy clustering algorithm and parallelizing the optimized algorithm using MapReduce, resulting in the development of a novel MapReduce-based k-prototype fuzzy c-means (MRKPFCM) algorithm. Subsequently, the MRKPFCM algorithm is combined with the classical collaborative filtering algorithm to create a hybrid and parallelized collaborative filtering recommendation algorithm, incorporating elements such as MRKPFCM, audience, and collection. This hybrid algorithm is further supplemented by a content-based recommendation approach to generate comprehensive and refined recommendation results. Experimental findings demonstrate that the predictive scoring errors, as measured by RMSE and MAE, exhibited a downward trend when the number of nearest neighbors for target users fell within the range of 10–20. For instance, the studied algorithm’s MAE value decreased from 0.7512 to 0.7179, surpassing the corresponding figures for the two comparison algorithms. Moreover, with an increase in the number of nearest neighbors within the same range, all three algorithms experienced improved accuracy in prediction results. In particular, the accuracy rate rose from 17.84% to 18.82%, outperforming the two comparison algorithms. In summary, the enhanced hybrid recommendation algorithm achieved through this study displays superior recommendation accuracy and holds significant practical value.","PeriodicalId":45994,"journal":{"name":"International Journal of Computational Intelligence and Applications","volume":" 69","pages":"0"},"PeriodicalIF":0.8000,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Intelligence and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s1469026823500293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid advancement of internet technology, various industries have accumulated vast amounts of data, including on user behavior and personal preferences. Traditional museums can leverage this user data to uncover individual preferences and offer personalized services to their visitors. However, the exponential growth of information has also led to the problem of information overload, making it challenging for users to find relevant information within the vast data landscape. Consequently, the utilization rate of available information decreases. By harnessing the power of cloud computing, big data analytics, and recommendation systems, museums can enhance visitors’ touring experiences by helping them discover collections aligned with their interests and connecting with like-minded individuals. To address this objective, the research focuses on optimizing the initial clustering centers of the fuzzy clustering algorithm and parallelizing the optimized algorithm using MapReduce, resulting in the development of a novel MapReduce-based k-prototype fuzzy c-means (MRKPFCM) algorithm. Subsequently, the MRKPFCM algorithm is combined with the classical collaborative filtering algorithm to create a hybrid and parallelized collaborative filtering recommendation algorithm, incorporating elements such as MRKPFCM, audience, and collection. This hybrid algorithm is further supplemented by a content-based recommendation approach to generate comprehensive and refined recommendation results. Experimental findings demonstrate that the predictive scoring errors, as measured by RMSE and MAE, exhibited a downward trend when the number of nearest neighbors for target users fell within the range of 10–20. For instance, the studied algorithm’s MAE value decreased from 0.7512 to 0.7179, surpassing the corresponding figures for the two comparison algorithms. Moreover, with an increase in the number of nearest neighbors within the same range, all three algorithms experienced improved accuracy in prediction results. In particular, the accuracy rate rose from 17.84% to 18.82%, outperforming the two comparison algorithms. In summary, the enhanced hybrid recommendation algorithm achieved through this study displays superior recommendation accuracy and holds significant practical value.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于改进模糊聚类算法的数字博物馆藏品推荐算法研究
随着互联网技术的飞速发展,各行各业积累了大量的数据,包括用户行为和个人偏好。传统博物馆可以利用这些用户数据来发现个人偏好,并为游客提供个性化服务。然而,信息的指数级增长也导致了信息过载的问题,使得用户很难在庞大的数据环境中找到相关的信息。因此,可用信息的利用率降低。通过利用云计算、大数据分析和推荐系统的力量,博物馆可以帮助游客发现符合他们兴趣的藏品,并与志趣相投的人建立联系,从而增强游客的参观体验。为了实现这一目标,研究重点是优化模糊聚类算法的初始聚类中心,并使用MapReduce对优化后的算法进行并行化,从而开发了一种新的基于MapReduce的k-prototype模糊c-means (MRKPFCM)算法。随后,将MRKPFCM算法与经典协同过滤算法相结合,结合MRKPFCM、受众、集合等要素,构建混合并行协同过滤推荐算法。该混合算法进一步补充了基于内容的推荐方法,以生成全面而精细的推荐结果。实验结果表明,当目标用户的近邻数在10 ~ 20个范围内时,RMSE和MAE测量的预测评分误差呈下降趋势。例如,所研究算法的MAE值从0.7512下降到0.7179,超过了两种比较算法的相应数据。此外,随着同一范围内最近邻数量的增加,三种算法的预测结果精度都有所提高。特别是准确率从17.84%提高到18.82%,优于两种比较算法。综上所述,通过本研究实现的增强型混合推荐算法具有较好的推荐精度,具有重要的实用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.90
自引率
0.00%
发文量
25
期刊介绍: The International Journal of Computational Intelligence and Applications, IJCIA, is a refereed journal dedicated to the theory and applications of computational intelligence (artificial neural networks, fuzzy systems, evolutionary computation and hybrid systems). The main goal of this journal is to provide the scientific community and industry with a vehicle whereby ideas using two or more conventional and computational intelligence based techniques could be discussed. The IJCIA welcomes original works in areas such as neural networks, fuzzy logic, evolutionary computation, pattern recognition, hybrid intelligent systems, symbolic machine learning, statistical models, image/audio/video compression and retrieval.
期刊最新文献
Software Effort Estimation Based on Ensemble Extreme Gradient Boosting Algorithm and Modified Jaya Optimization Algorithm Soybean Leaf Diseases Recognition Based on Generative Adversarial Network and Transfer Learning A Study of Digital Museum Collection Recommendation Algorithm Based on Improved Fuzzy Clustering Algorithm Efficiency in Orchid Species Classification: A Transfer Learning-Based Approach Research on Fault Detection for Microservices Based on Log Information and Social Network Mechanism Using BiLSTM-DCNN Model
×
引用
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