{"title":"基于进化的推荐方法","authors":"Ismail Bouacha, Safia Bekhouche","doi":"10.1109/ICTAACS53298.2021.9715214","DOIUrl":null,"url":null,"abstract":"A recommender system aims to satisfy its users by offering them relevant items (films, books, products, etc). This is done by comparing the items deemed satisfactory by the user with all of the items (content-based filtering), or by searching for similar users (collaborative filtering). We propose a genetic based approach to recommend relevant items without needing an explicit request from the user. Our approach looks for the most similar users using a genetic algorithm. Then, a recommendation space is constructed by grouping the items preferred by each similar user, and removing those preferred by the active user. After that, the system predicts a rating for each unrated item. The recommendation space will be reduced by keeping only relevant items using a threshold. An experimental study has been made in comparison with KNN algorithm. Experimental results seem interesting and show an improvement in precision, recall and F-Measure. Also Mean Absolute Error (MAE) has been reduced.","PeriodicalId":284572,"journal":{"name":"2021 International Conference on Theoretical and Applicative Aspects of Computer Science (ICTAACS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Evolutionary Based Recommendation Approach\",\"authors\":\"Ismail Bouacha, Safia Bekhouche\",\"doi\":\"10.1109/ICTAACS53298.2021.9715214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A recommender system aims to satisfy its users by offering them relevant items (films, books, products, etc). This is done by comparing the items deemed satisfactory by the user with all of the items (content-based filtering), or by searching for similar users (collaborative filtering). We propose a genetic based approach to recommend relevant items without needing an explicit request from the user. Our approach looks for the most similar users using a genetic algorithm. Then, a recommendation space is constructed by grouping the items preferred by each similar user, and removing those preferred by the active user. After that, the system predicts a rating for each unrated item. The recommendation space will be reduced by keeping only relevant items using a threshold. An experimental study has been made in comparison with KNN algorithm. Experimental results seem interesting and show an improvement in precision, recall and F-Measure. Also Mean Absolute Error (MAE) has been reduced.\",\"PeriodicalId\":284572,\"journal\":{\"name\":\"2021 International Conference on Theoretical and Applicative Aspects of Computer Science (ICTAACS)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Theoretical and Applicative Aspects of Computer Science (ICTAACS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAACS53298.2021.9715214\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Theoretical and Applicative Aspects of Computer Science (ICTAACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAACS53298.2021.9715214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

推荐系统的目的是通过向用户提供相关的项目(电影、书籍、产品等)来满足用户。这是通过将用户认为满意的项目与所有项目进行比较(基于内容的过滤),或通过搜索相似的用户(协作过滤)来完成的。我们提出了一种基于遗传的方法来推荐相关的项目,而不需要用户明确的请求。我们的方法使用遗传算法寻找最相似的用户。然后,通过将每个相似用户喜欢的项目分组,并删除活跃用户喜欢的项目,构建推荐空间。之后,系统会预测每个未评级物品的评级。通过使用阈值只保留相关条目,可以减少推荐空间。并与KNN算法进行了对比实验研究。实验结果似乎很有趣,显示出精确度、召回率和F-Measure的提高。平均绝对误差(MAE)也降低了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Evolutionary Based Recommendation Approach
A recommender system aims to satisfy its users by offering them relevant items (films, books, products, etc). This is done by comparing the items deemed satisfactory by the user with all of the items (content-based filtering), or by searching for similar users (collaborative filtering). We propose a genetic based approach to recommend relevant items without needing an explicit request from the user. Our approach looks for the most similar users using a genetic algorithm. Then, a recommendation space is constructed by grouping the items preferred by each similar user, and removing those preferred by the active user. After that, the system predicts a rating for each unrated item. The recommendation space will be reduced by keeping only relevant items using a threshold. An experimental study has been made in comparison with KNN algorithm. Experimental results seem interesting and show an improvement in precision, recall and F-Measure. Also Mean Absolute Error (MAE) has been reduced.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards a Trust-based Model for Access Control for Graph-Oriented Databases A Transformation Approach Combining BPMN and Petri Net to Verify Business Processes Construction in terms of Resource Consumption using Cloud Services Fuzzy Logic Based self-switching multi-strategic pedagogical agent Task-based Learning Analytics Indicators Selection Using Naive Bayes Classifier And Regression Decision Trees Searchable encryption for multi-cloudIoT simulation
×
引用
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