A knowledge-enhanced interest segment division attention network for click-through rate prediction

Zhanghui Liu, Shijie Chen, Yuzhong Chen, Jieyang Su, Jiayuan Zhong, Chen Dong
{"title":"A knowledge-enhanced interest segment division attention network for click-through rate prediction","authors":"Zhanghui Liu, Shijie Chen, Yuzhong Chen, Jieyang Su, Jiayuan Zhong, Chen Dong","doi":"10.1007/s00521-024-10330-y","DOIUrl":null,"url":null,"abstract":"<p>Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00521-024-10330-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Click-through rate (CTR) prediction aims to estimate the probability of a user clicking on a particular item, making it one of the core tasks in various recommendation platforms. In such systems, user behavior data are crucial for capturing user interests, which has garnered significant attention from both academia and industry, leading to the development of various user behavior modeling methods. However, existing models still face unresolved issues, as they fail to capture the complex diversity of user interests at the semantic level, refine user interests effectively, and uncover users’ potential interests. To address these challenges, we propose a novel model called knowledge-enhanced Interest segment division attention network (KISDAN), which can effectively and comprehensively model user interests. Specifically, to leverage the semantic information within user behavior sequences, we employ the structure of a knowledge graph to divide user behavior sequence into multiple interest segments. To provide a comprehensive representation of user interests, we further categorize user interests into strong and weak interests. By leveraging both the knowledge graph and the item co-occurrence graph, we explore users’ potential interests from two perspectives. This methodology allows KISDAN to better understand the diversity of user interests. Finally, we extensively evaluate KISDAN on three benchmark datasets, and the experimental results consistently demonstrate that the KISDAN model outperforms state-of-the-art models across various evaluation metrics, which validates the effectiveness and superiority of KISDAN.

Abstract Image

用于预测点击率的知识增强型兴趣段划分注意力网络
点击率(CTR)预测旨在估算用户点击特定项目的概率,是各种推荐平台的核心任务之一。在此类系统中,用户行为数据对于捕捉用户兴趣至关重要,这引起了学术界和工业界的极大关注,并导致了各种用户行为建模方法的发展。然而,现有模型仍面临着一些尚未解决的问题,如无法在语义层面捕捉用户兴趣的复杂多样性、无法有效提炼用户兴趣以及挖掘用户的潜在兴趣。为了应对这些挑战,我们提出了一种名为 "知识增强兴趣段划分注意力网络(KISDAN)"的新型模型,它可以有效、全面地建立用户兴趣模型。具体来说,为了充分利用用户行为序列中的语义信息,我们采用知识图谱的结构将用户行为序列划分为多个兴趣段。为了全面呈现用户兴趣,我们进一步将用户兴趣分为强兴趣和弱兴趣。通过利用知识图谱和项目共现图谱,我们从两个角度探索用户的潜在兴趣。这种方法使 KISDAN 能够更好地理解用户兴趣的多样性。最后,我们在三个基准数据集上对 KISDAN 进行了广泛评估,实验结果一致表明,KISDAN 模型在各种评估指标上都优于最先进的模型,从而验证了 KISDAN 的有效性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信