A Restricted Boltzmann Machine-based Recommender System For Alleviating Sparsity Issues

Nouhaila Idrissi, Oumaima Hourrane, A. Zellou, E. Benlahmar
{"title":"A Restricted Boltzmann Machine-based Recommender System For Alleviating Sparsity Issues","authors":"Nouhaila Idrissi, Oumaima Hourrane, A. Zellou, E. Benlahmar","doi":"10.1109/ICSSD47982.2019.9003149","DOIUrl":null,"url":null,"abstract":"With the explosive growth of the Internet and the Web, assisting users and facilitate their access to resources that might be of their interest and that are adapted to their personal needs is a tedious task. Efficient management of large amounts of information becomes an increasingly significant challenge. Hence, recommender systems have proved, in recent years, to be a valuable asset to dealing with the problem of information overload by assisting the users and providing them with more effective access to information. To this end, these systems must be able to predict users’ interests based on their prior feedback. However, sparsity issues arise when necessary transactional information is not available for inferring users and items similarities, which deteriorate the quality and accuracy of the recommender system. To fill these gaps, we propose in this paper a Restricted Boltzmann Machine-based model to learn hidden factors and reconstruct sparse input rating data. Experimental results show that our proposed approach can effectively deal with data sparsity in MovieLens dataset, containing a massive amount of scarce information.","PeriodicalId":342806,"journal":{"name":"2019 1st International Conference on Smart Systems and Data Science (ICSSD)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 1st International Conference on Smart Systems and Data Science (ICSSD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSD47982.2019.9003149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the explosive growth of the Internet and the Web, assisting users and facilitate their access to resources that might be of their interest and that are adapted to their personal needs is a tedious task. Efficient management of large amounts of information becomes an increasingly significant challenge. Hence, recommender systems have proved, in recent years, to be a valuable asset to dealing with the problem of information overload by assisting the users and providing them with more effective access to information. To this end, these systems must be able to predict users’ interests based on their prior feedback. However, sparsity issues arise when necessary transactional information is not available for inferring users and items similarities, which deteriorate the quality and accuracy of the recommender system. To fill these gaps, we propose in this paper a Restricted Boltzmann Machine-based model to learn hidden factors and reconstruct sparse input rating data. Experimental results show that our proposed approach can effectively deal with data sparsity in MovieLens dataset, containing a massive amount of scarce information.
一种基于受限玻尔兹曼机的推荐系统缓解稀疏性问题
随着Internet和Web的爆炸性增长,帮助用户并促进他们访问可能感兴趣并适合其个人需求的资源是一项乏味的任务。对大量信息的有效管理已成为一项日益重要的挑战。因此,近年来,推荐系统通过帮助用户更有效地获取信息,已被证明是处理信息过载问题的宝贵资产。为此,这些系统必须能够根据用户先前的反馈来预测他们的兴趣。然而,当没有必要的交易信息来推断用户和项目的相似性时,稀疏性问题就会出现,这会降低推荐系统的质量和准确性。为了填补这些空白,本文提出了一种基于受限玻尔兹曼机的模型来学习隐藏因素并重建稀疏输入评级数据。实验结果表明,该方法可以有效地处理包含大量稀缺信息的MovieLens数据集的数据稀疏性问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信