$\mu-\text{cf}2\text{vec}$: Representation Learning for Personalized Algorithm Selection in Recommender Systems

Tomas Sousa Pereira, T. Cunha, C. Soares
{"title":"$\\mu-\\text{cf}2\\text{vec}$: Representation Learning for Personalized Algorithm Selection in Recommender Systems","authors":"Tomas Sousa Pereira, T. Cunha, C. Soares","doi":"10.1109/ICDMW51313.2020.00034","DOIUrl":null,"url":null,"abstract":"Collaborative Filtering (CF) has become the standard approach to solve recommendation systems problems. Collaborative Filtering algorithms try to make predictions about interests of a user by collecting the personal interests from multiple users. There are multiple CF algorithms, each one of them with its own biases. It is the Machine Learning practitioner that has to choose the best algorithm for each task beforehand. In Recommender Systems, different algorithms have different performance for different users within the same dataset. Meta Learning has been used to choose the best algorithm for a given problem. Meta Learning is usually applied to select algorithms for a whole dataset. Adapting it to select the to the algorithm for a single user in a RS involves several challenges. The most important is the design of the metafeatures which, in typical meta learning, characterize datasets while here, they must characterize a single user. This work presents a new meta-learning based framework named $\\mu-\\mathbf{cf}2\\mathbf{vec}$ to select the best algorithm for each user. We propose using Representation Learning techniques to extract the metafeatures. Representation Learning tries to extract representations that can be reused in other learning tasks. In this work we also implement the framework using different RL techniques to evaluate which one can be more useful to solve this task. In the meta level, the meta learning model will use the metafeatures to extract knowledge that will be used to predict the best algorithm for each user. We evaluated an implementation of this framework using MovieLens 20M dataset. Our implementation achieved consistent gains in the meta level, however, in the base level we only achieved marginal gains.","PeriodicalId":426846,"journal":{"name":"2020 International Conference on Data Mining Workshops (ICDMW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Data Mining Workshops (ICDMW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW51313.2020.00034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Collaborative Filtering (CF) has become the standard approach to solve recommendation systems problems. Collaborative Filtering algorithms try to make predictions about interests of a user by collecting the personal interests from multiple users. There are multiple CF algorithms, each one of them with its own biases. It is the Machine Learning practitioner that has to choose the best algorithm for each task beforehand. In Recommender Systems, different algorithms have different performance for different users within the same dataset. Meta Learning has been used to choose the best algorithm for a given problem. Meta Learning is usually applied to select algorithms for a whole dataset. Adapting it to select the to the algorithm for a single user in a RS involves several challenges. The most important is the design of the metafeatures which, in typical meta learning, characterize datasets while here, they must characterize a single user. This work presents a new meta-learning based framework named $\mu-\mathbf{cf}2\mathbf{vec}$ to select the best algorithm for each user. We propose using Representation Learning techniques to extract the metafeatures. Representation Learning tries to extract representations that can be reused in other learning tasks. In this work we also implement the framework using different RL techniques to evaluate which one can be more useful to solve this task. In the meta level, the meta learning model will use the metafeatures to extract knowledge that will be used to predict the best algorithm for each user. We evaluated an implementation of this framework using MovieLens 20M dataset. Our implementation achieved consistent gains in the meta level, however, in the base level we only achieved marginal gains.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
$\mu-\text{cf}2\text{vec}$:推荐系统中个性化算法选择的表示学习
协同过滤(CF)已经成为解决推荐系统问题的标准方法。协同过滤算法试图通过收集多个用户的个人兴趣来预测用户的兴趣。有多种CF算法,每一种都有自己的偏见。机器学习从业者必须事先为每个任务选择最佳算法。在推荐系统中,不同的算法对同一数据集中的不同用户具有不同的性能。元学习已被用于为给定问题选择最佳算法。元学习通常用于为整个数据集选择算法。使其适应于RS中单个用户的算法选择涉及几个挑战。最重要的是元特征的设计,在典型的元学习中,元特征表征数据集,而在这里,它们必须表征单个用户。这项工作提出了一个新的基于元学习的框架$\mu-\mathbf{cf}2\mathbf{vec}$,为每个用户选择最佳算法。我们建议使用表征学习技术来提取元特征。表示学习试图提取可以在其他学习任务中重用的表示。在这项工作中,我们还使用不同的强化学习技术来实现框架,以评估哪一种技术对解决此任务更有用。在元层面,元学习模型将使用元特征来提取知识,这些知识将用于预测每个用户的最佳算法。我们使用MovieLens 20M数据集评估了该框架的实现。我们的实现在元级别上获得了一致的收益,然而,在基础级别上我们只获得了边际收益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Synthetic Data by Principal Component Analysis Deep Contextualized Word Embedding for Text-based Online User Profiling to Detect Social Bots on Twitter Integration of Fuzzy and Deep Learning in Three-Way Decisions Mining Heterogeneous Data for Formulation Design Restructuring of Hoeffding Trees for Trapezoidal Data Streams
×
引用
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