A Self-Attentive Interest Retrieval Recommender

Min Wu, Chen Li, Lihua Tian
{"title":"A Self-Attentive Interest Retrieval Recommender","authors":"Min Wu, Chen Li, Lihua Tian","doi":"10.1109/CCET55412.2022.9906367","DOIUrl":null,"url":null,"abstract":"Thanks to the attention mechanism, self-attention networks (SANs) have been widely used in sequential recommendation. However, most existing SANs approaches still follow an old fashion generating one single embedding as final representation, which constraints model’s capacity. To enrich this kind of representation, sequential recommender uses metadata such as item category to capture user’s multi-interests. But this method will not reach its expectation due to item’s long-tail property. This property will result a large constant of category cannot be effectively activated by the lack of interaction records. Another drawback is that may also lead to over-parameterization caused by the massive categories. Particularly, we propose a Self-Attentive Interest Retrieval network (SAIR) to explore a context-aware representation from user’s behaviors while not fall into over-parameterization. SAIR works in a typical SANs manner, encode the behavior sequence using self-attention, and we propose an interest retrieval module to project the sequences to an interest relevance distribution adaptively. And we leverage an interest-to-interest interaction to generate several context-aware interests embeddings. Then we fuse multi-interest embeddings as final output. Extensive experiments are carried out on three real-world datasets, the results demonstrate that SAIR outperforms other SANs methods and other state-of-the-art algorithms in multiple evaluation metrics.","PeriodicalId":329327,"journal":{"name":"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCET55412.2022.9906367","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Thanks to the attention mechanism, self-attention networks (SANs) have been widely used in sequential recommendation. However, most existing SANs approaches still follow an old fashion generating one single embedding as final representation, which constraints model’s capacity. To enrich this kind of representation, sequential recommender uses metadata such as item category to capture user’s multi-interests. But this method will not reach its expectation due to item’s long-tail property. This property will result a large constant of category cannot be effectively activated by the lack of interaction records. Another drawback is that may also lead to over-parameterization caused by the massive categories. Particularly, we propose a Self-Attentive Interest Retrieval network (SAIR) to explore a context-aware representation from user’s behaviors while not fall into over-parameterization. SAIR works in a typical SANs manner, encode the behavior sequence using self-attention, and we propose an interest retrieval module to project the sequences to an interest relevance distribution adaptively. And we leverage an interest-to-interest interaction to generate several context-aware interests embeddings. Then we fuse multi-interest embeddings as final output. Extensive experiments are carried out on three real-world datasets, the results demonstrate that SAIR outperforms other SANs methods and other state-of-the-art algorithms in multiple evaluation metrics.
一个自关注兴趣检索推荐器
由于注意机制的存在,自注意网络在序贯推荐中得到了广泛的应用。然而,大多数现有的san方法仍然遵循生成单个嵌入作为最终表示的旧方式,这限制了模型的容量。为了丰富这种表示,顺序推荐使用诸如项目类别之类的元数据来捕获用户的多重兴趣。但是由于项目的长尾属性,该方法不会达到预期。此属性将导致由于缺乏交互记录而无法有效激活大类常量。另一个缺点是,这也可能导致由大量类别引起的过度参数化。特别地,我们提出了一个自关注兴趣检索网络(SAIR)来探索用户行为的上下文感知表示,而不会陷入过度参数化。SAIR以典型的SANs方式工作,利用自关注对行为序列进行编码,并提出了一个兴趣检索模块,将序列自适应地投影到兴趣相关分布中。我们利用兴趣到兴趣的交互来生成几个上下文感知的兴趣嵌入。然后我们融合多兴趣嵌入作为最终输出。在三个真实数据集上进行了大量实验,结果表明SAIR在多个评估指标上优于其他SANs方法和其他最先进的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信