Term Association Measures for Memory-based Recommender Systems

Eva Suárez-García, Alfonso Landin, Daniel Valcarce, Álvaro Barreiro
{"title":"Term Association Measures for Memory-based Recommender Systems","authors":"Eva Suárez-García, Alfonso Landin, Daniel Valcarce, Álvaro Barreiro","doi":"10.1145/3230599.3230606","DOIUrl":null,"url":null,"abstract":"The adaptation of Information Retrieval techniques for the item recommendation task has become a fertile research area. Previous works have established the correspondence between these two fields that allowed to adapt several retrieval techniques successfully. One line of study aims to model the item recommendation problem as a profile expansion task following the methods for query expansion in pseudo-relevance feedback. To solve the query expansion task in ad-hoc retrieval, several term association measures have been proposed in the past. In this paper, we adapt several of these measures to the top-N recommendation problem, specifically to the collaborative filtering scenario. Moreover, we perform experiments to study their effectiveness regarding accuracy, diversity and novelty. Our results show that some of the proposed measures can improve these aspects over well-known and commonly used recommendation similarity metrics (cosine similarity and Pearson's correlation coefficient).","PeriodicalId":448209,"journal":{"name":"Proceedings of the 5th Spanish Conference on Information Retrieval","volume":"186 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th Spanish Conference on Information Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3230599.3230606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The adaptation of Information Retrieval techniques for the item recommendation task has become a fertile research area. Previous works have established the correspondence between these two fields that allowed to adapt several retrieval techniques successfully. One line of study aims to model the item recommendation problem as a profile expansion task following the methods for query expansion in pseudo-relevance feedback. To solve the query expansion task in ad-hoc retrieval, several term association measures have been proposed in the past. In this paper, we adapt several of these measures to the top-N recommendation problem, specifically to the collaborative filtering scenario. Moreover, we perform experiments to study their effectiveness regarding accuracy, diversity and novelty. Our results show that some of the proposed measures can improve these aspects over well-known and commonly used recommendation similarity metrics (cosine similarity and Pearson's correlation coefficient).
基于记忆的推荐系统的术语关联度量
将信息检索技术应用于项目推荐任务已成为一个颇有研究价值的领域。以前的工作已经建立了这两个领域之间的对应关系,允许成功地适应几种检索技术。一个方向的研究是将项目推荐问题建模为一个概要扩展任务,该任务遵循伪相关反馈中的查询扩展方法。为了解决自组织检索中的查询扩展任务,过去提出了几种术语关联方法。在本文中,我们将其中的几个度量调整到top-N推荐问题,特别是协同过滤场景。此外,我们还从准确性、多样性和新颖性三个方面进行了实验研究。我们的研究结果表明,与众所周知和常用的推荐相似度度量(余弦相似度和Pearson相关系数)相比,我们提出的一些度量可以改善这些方面。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信