Improving Relevance in a Recommendation System to Suggest Charities without Explicit User Profiles Using Dual-Autoencoders

Pablo Adames, Sourabh Mokhasi, Y. Pauchard, Mohammed Moshirpour, Camilo Rostoker
{"title":"Improving Relevance in a Recommendation System to Suggest Charities without Explicit User Profiles Using Dual-Autoencoders","authors":"Pablo Adames, Sourabh Mokhasi, Y. Pauchard, Mohammed Moshirpour, Camilo Rostoker","doi":"10.1109/CDMA54072.2022.00019","DOIUrl":null,"url":null,"abstract":"This work explores the effect of the quality of inferred user profiles on the accuracy of charitable recommendations when using an item-based collaborative filter algorithm. A gap was identified in the literature with respect to the application of charitable recom-mendation systems in the absence of rich user profiles. This paper introduces an approach to generate relevant recommendations when neither user profiles nor feedback on donation preferences is available. The discovery of user preferences is achieved via the construction of implicit ratings computed from custom feature engineering, while the sparsity of item and user ratings was addressed with a dimension reduction strategy based on dual-autoencoders from a commercial machine learning platform. Our analysis shows the magnitude and sensitivity of the relationship between the relevance of the recommendations and the average number of donations per user. Raw data for this research was provided by a leading online donation platform and contains 24 million anonymous donations to 165 thousand unique causes from over 1.2 million users. We find that the most effective way to increase the relevance of recommendations by a factor of 2 at any top- k value is to train the collaborative filter with users that have at least 50 donations in the data set. As a result, the training set for the collaborative filter is restricted to 8% of the original users, 70% of the companies, 49% of the causes, and 70% of the original countries where users making donations reside.","PeriodicalId":313042,"journal":{"name":"2022 7th International Conference on Data Science and Machine Learning Applications (CDMA)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 7th International Conference on Data Science and Machine Learning Applications (CDMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDMA54072.2022.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This work explores the effect of the quality of inferred user profiles on the accuracy of charitable recommendations when using an item-based collaborative filter algorithm. A gap was identified in the literature with respect to the application of charitable recom-mendation systems in the absence of rich user profiles. This paper introduces an approach to generate relevant recommendations when neither user profiles nor feedback on donation preferences is available. The discovery of user preferences is achieved via the construction of implicit ratings computed from custom feature engineering, while the sparsity of item and user ratings was addressed with a dimension reduction strategy based on dual-autoencoders from a commercial machine learning platform. Our analysis shows the magnitude and sensitivity of the relationship between the relevance of the recommendations and the average number of donations per user. Raw data for this research was provided by a leading online donation platform and contains 24 million anonymous donations to 165 thousand unique causes from over 1.2 million users. We find that the most effective way to increase the relevance of recommendations by a factor of 2 at any top- k value is to train the collaborative filter with users that have at least 50 donations in the data set. As a result, the training set for the collaborative filter is restricted to 8% of the original users, 70% of the companies, 49% of the causes, and 70% of the original countries where users making donations reside.
使用双自编码器在推荐系统中提高相关性,在没有明确用户资料的情况下推荐慈善机构
这项工作探讨了在使用基于项目的协同过滤算法时,推断用户资料的质量对慈善推荐准确性的影响。在缺乏丰富用户资料的情况下,文献中发现了关于慈善推荐系统应用的差距。本文介绍了一种在用户资料和捐赠偏好反馈都不可用时生成相关推荐的方法。用户偏好的发现是通过构建自定义特征工程计算的隐式评级来实现的,而项目和用户评级的稀疏性是通过基于商业机器学习平台的双自编码器的降维策略来解决的。我们的分析显示了推荐的相关性和每个用户的平均捐赠数量之间关系的大小和敏感性。这项研究的原始数据是由一家领先的在线捐赠平台提供的,其中包含了来自120多万用户的2400万笔匿名捐款,共计16.5万个独特的原因。我们发现,在任何top- k值下,将推荐相关性提高2倍的最有效方法是使用数据集中至少有50个捐赠的用户来训练协同过滤器。因此,协作过滤器的训练集被限制为8%的原始用户、70%的公司、49%的原因和70%的原始用户捐赠所在国家。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信