Weightless Neural Network WiSARD Applied to Online Recommender Systems

Kleyton Pontes Cotta, Raul Sena Ferreira, Felipe M. G. França
{"title":"Weightless Neural Network WiSARD Applied to Online Recommender Systems","authors":"Kleyton Pontes Cotta, Raul Sena Ferreira, Felipe M. G. França","doi":"10.1109/bracis.2018.00067","DOIUrl":null,"url":null,"abstract":"Recommender systems generally are made to predict user preferences' for items. However, in high dimensional datasets this task demands high computational costs. Taking into account that data distribution changes through time, it is important that online recommender systems have a fast retraining process in order to keep the model updated, delivering accurate predictions. Therefore, we propose a new approach for recommender systems using a weightless neural network, denominated WiSARD. We show that our proposal increases training and prediction processing speed, without decreasing the quality of predictions. First results show that our proposal is 306% faster than the improved regularized singular value decomposition (IRSVD), a well-known state-of-the-art algorithm. Moreover, our proposal still had an improvement of 3.7% regarding the mean absolute error (MAE). We show how to apply the WiSARD algorithm for online recommender systems, its drawbacks, and insights for further research.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/bracis.2018.00067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Recommender systems generally are made to predict user preferences' for items. However, in high dimensional datasets this task demands high computational costs. Taking into account that data distribution changes through time, it is important that online recommender systems have a fast retraining process in order to keep the model updated, delivering accurate predictions. Therefore, we propose a new approach for recommender systems using a weightless neural network, denominated WiSARD. We show that our proposal increases training and prediction processing speed, without decreasing the quality of predictions. First results show that our proposal is 306% faster than the improved regularized singular value decomposition (IRSVD), a well-known state-of-the-art algorithm. Moreover, our proposal still had an improvement of 3.7% regarding the mean absolute error (MAE). We show how to apply the WiSARD algorithm for online recommender systems, its drawbacks, and insights for further research.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无重力神经网络在在线推荐系统中的应用
推荐系统通常是用来预测用户对商品的偏好的。然而,在高维数据集中,该任务需要很高的计算成本。考虑到数据分布随着时间的推移而变化,在线推荐系统必须有一个快速的再训练过程,以保持模型的更新,提供准确的预测。因此,我们提出了一种使用无权重神经网络的推荐系统的新方法,命名为WiSARD。我们证明了我们的提议在不降低预测质量的情况下提高了训练和预测处理速度。第一个结果表明,我们的提议比改进的正则化奇异值分解(IRSVD)快306%,IRSVD是一种著名的最先进的算法。此外,我们的建议在平均绝对误差(MAE)方面仍有3.7%的改进。我们展示了如何将WiSARD算法应用于在线推荐系统,它的缺点,以及进一步研究的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
相关文献
Luminescent Down-Shifting Textured Anti-Reflection Films for Lossless and Colorful Perovskite/Si Tandem Solar Cells
IF 0 SSRN Electronic JournalPub Date : 2022-01-01 DOI: 10.2139/ssrn.4078681
E. Jung, Chan Ul Kim, Young Wook Noh, Seong Kuk Seo, Young Im Noh, K. K. Hong, K. Choi, M. Song
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Exploring the Data Using Extended Association Rule Network SPt: A Text Mining Process to Extract Relevant Areas from SW Documents to Exploratory Tests Gene Essentiality Prediction Using Topological Features From Metabolic Networks Bio-Inspired and Heuristic Methods Applied to a Benchmark of the Task Scheduling Problem A New Genetic Algorithm-Based Pruning Approach for Optimum-Path Forest
×
引用
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