Web usage mining based recommender systems using implicit heterogeneous data: - A Particle Swarm Optimization based clustering approach

Shafiq Alam, G. Dobbie, Yun Sing Koh, Patricia J. Riddle
{"title":"Web usage mining based recommender systems using implicit heterogeneous data: - A Particle Swarm Optimization based clustering approach","authors":"Shafiq Alam, G. Dobbie, Yun Sing Koh, Patricia J. Riddle","doi":"10.3233/WIA-140302","DOIUrl":null,"url":null,"abstract":"Recommender systems have become one of the necessary tools to help a web user find a potentially interesting resource based on their preferences. In implicit recommender systems, the recommendations are made based on the implicit information of the web users i.e. data collected from web logs or cookies without knowing users preferences. Developing such a recommender system is complex due to the huge amount of anonymous noisy data. In this paper we present a Particle Swarm Optimization (PSO) based clustering approach called Hierarchical Particle Swarm Optimization based clustering (HPSO-clustering) for building a recommender system based on implicit web usage data. The approach mimics multi-agent properties of the particles of a swarm and divide the problem space into smaller sub-spaces i.e. clusters. Each cluster represents a particular group of user with similar interests. Later, the K-nearest neighbours of the most relevant cluster are generated as recommendations for a web user and ranked based on their distance. We performed different experiments for preprocessing, to assess the quality of clusters, and for the accuracy of recommendations. An overall accuracy of 65% to 95% was achieved for different scenarios, while in some cases the accuracy touched 100 precent when the selection was made from the top-5 recommendations.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Web Intell. Agent Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/WIA-140302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Recommender systems have become one of the necessary tools to help a web user find a potentially interesting resource based on their preferences. In implicit recommender systems, the recommendations are made based on the implicit information of the web users i.e. data collected from web logs or cookies without knowing users preferences. Developing such a recommender system is complex due to the huge amount of anonymous noisy data. In this paper we present a Particle Swarm Optimization (PSO) based clustering approach called Hierarchical Particle Swarm Optimization based clustering (HPSO-clustering) for building a recommender system based on implicit web usage data. The approach mimics multi-agent properties of the particles of a swarm and divide the problem space into smaller sub-spaces i.e. clusters. Each cluster represents a particular group of user with similar interests. Later, the K-nearest neighbours of the most relevant cluster are generated as recommendations for a web user and ranked based on their distance. We performed different experiments for preprocessing, to assess the quality of clusters, and for the accuracy of recommendations. An overall accuracy of 65% to 95% was achieved for different scenarios, while in some cases the accuracy touched 100 precent when the selection was made from the top-5 recommendations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
使用隐式异构数据的基于Web使用挖掘的推荐系统:-基于粒子群优化的聚类方法
推荐系统已经成为帮助网络用户根据自己的喜好找到潜在有趣资源的必要工具之一。在隐式推荐系统中,推荐是基于web用户的隐式信息,即从web日志或cookie中收集的数据,而不知道用户的偏好。由于大量的匿名噪声数据,开发这样的推荐系统是非常复杂的。本文提出了一种基于粒子群优化(PSO)的聚类方法,即基于层次粒子群优化的聚类(HPSO-clustering),用于构建基于隐式web使用数据的推荐系统。该方法模拟了群体粒子的多智能体特性,并将问题空间划分为更小的子空间,即簇。每个集群代表一个具有相似兴趣的特定用户组。然后,生成最相关集群的k个最近邻居作为对web用户的推荐,并根据它们的距离进行排名。我们进行了不同的预处理实验,以评估聚类的质量和推荐的准确性。对于不同的场景,总体准确率达到65%到95%,而在某些情况下,当从前5个建议中进行选择时,准确率达到100%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Detecting cyberbullying in social networks using multi-agent system Scalable approximating SVD algorithm for recommender systems Web usage mining based recommender systems using implicit heterogeneous data: - A Particle Swarm Optimization based clustering approach Agent-based problem solving methods in Big Data environment Multi-agent orienteering problem with time-dependent capacity constraints
×
引用
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