RTANet:推荐目标感知网络嵌入

Qimeng Cao, Qing Yin, Yunya Song, Zhihua Wang, Yujun Chen, R. Xu, Xian Yang
{"title":"RTANet:推荐目标感知网络嵌入","authors":"Qimeng Cao, Qing Yin, Yunya Song, Zhihua Wang, Yujun Chen, R. Xu, Xian Yang","doi":"10.1609/icwsm.v17i1.22128","DOIUrl":null,"url":null,"abstract":"Network embedding is a process of encoding nodes into latent vectors by preserving network structure and content information. It is used in various applications, especially in recommender systems. In a social network setting, when recommending new friends to a user, the similarity between the user's embedding and the target friend will be examined. Traditional methods generate user node embedding without considering the recommendation target. No matter which target is to be recommended, the same embedding vector is generated for that particular user. This approach has its limitations. For example, a user can be both a computer scientist and a musician. When recommending music friends with \n potentially the same taste to him, we are interested in getting his representation that is useful in recommending music friends rather than computer scientists. His corresponding embedding should consider the user's musical features rather than those associated with computer science with the awareness that the recommendation targets are music friends. In order to address this issue, we propose a new framework which we name it as Recommendation Target-Aware Network embedding method (RTANet). Herein, the embedding of each user is no longer fixed to a constant vector, but it can vary according to their specific recommendation target. Concretely, RTANet assigns different attention weights to each neighbour node, allowing us to obtain the user's context information aggregated from its neighbours before transforming this context into its embedding. Different from other graph attention approaches, the attention weights in our work measure the similarity between each user's neighbour node and the target node, which in return generates the target-aware embedding. To demonstrate the effectiveness of our method, we compared RTANet with several state-of-the-art network embedding methods on \nfour real-world datasets and showed that RTANet outperforms other comparative methods in the recommendation tasks.","PeriodicalId":175641,"journal":{"name":"International Conference on Web and Social Media","volume":"146 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"RTANet: Recommendation Target-Aware Network Embedding\",\"authors\":\"Qimeng Cao, Qing Yin, Yunya Song, Zhihua Wang, Yujun Chen, R. Xu, Xian Yang\",\"doi\":\"10.1609/icwsm.v17i1.22128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network embedding is a process of encoding nodes into latent vectors by preserving network structure and content information. It is used in various applications, especially in recommender systems. In a social network setting, when recommending new friends to a user, the similarity between the user's embedding and the target friend will be examined. Traditional methods generate user node embedding without considering the recommendation target. No matter which target is to be recommended, the same embedding vector is generated for that particular user. This approach has its limitations. For example, a user can be both a computer scientist and a musician. When recommending music friends with \\n potentially the same taste to him, we are interested in getting his representation that is useful in recommending music friends rather than computer scientists. His corresponding embedding should consider the user's musical features rather than those associated with computer science with the awareness that the recommendation targets are music friends. In order to address this issue, we propose a new framework which we name it as Recommendation Target-Aware Network embedding method (RTANet). Herein, the embedding of each user is no longer fixed to a constant vector, but it can vary according to their specific recommendation target. Concretely, RTANet assigns different attention weights to each neighbour node, allowing us to obtain the user's context information aggregated from its neighbours before transforming this context into its embedding. Different from other graph attention approaches, the attention weights in our work measure the similarity between each user's neighbour node and the target node, which in return generates the target-aware embedding. To demonstrate the effectiveness of our method, we compared RTANet with several state-of-the-art network embedding methods on \\nfour real-world datasets and showed that RTANet outperforms other comparative methods in the recommendation tasks.\",\"PeriodicalId\":175641,\"journal\":{\"name\":\"International Conference on Web and Social Media\",\"volume\":\"146 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Web and Social Media\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1609/icwsm.v17i1.22128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Web and Social Media","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1609/icwsm.v17i1.22128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

网络嵌入是在保留网络结构和内容信息的前提下,将节点编码为潜在向量的过程。它用于各种应用程序,特别是在推荐系统中。在社交网络环境中,当向用户推荐新朋友时,会检查用户嵌入的内容与目标朋友之间的相似性。传统方法生成用户节点嵌入时不考虑推荐目标。无论推荐哪个目标,都会为该特定用户生成相同的嵌入向量。这种方法有其局限性。例如,用户可以既是计算机科学家又是音乐家。当向他推荐具有潜在相同品味的音乐朋友时,我们感兴趣的是获得他在推荐音乐朋友时有用的代表,而不是计算机科学家。他相应的嵌入应该考虑用户的音乐特征,而不是那些与计算机科学相关的特征,并意识到推荐对象是音乐朋友。为了解决这一问题,我们提出了一种新的推荐目标感知网络嵌入方法(RTANet)。在这里,每个用户的嵌入不再固定在一个恒定的向量上,而是可以根据他们特定的推荐目标而变化。具体来说,RTANet为每个邻居节点分配不同的关注权重,允许我们在将该上下文转换为其嵌入之前获得从其邻居聚合的用户上下文信息。与其他图关注方法不同,我们工作中的关注权重衡量每个用户的邻居节点与目标节点之间的相似性,从而生成目标感知嵌入。为了证明我们方法的有效性,我们在四个真实数据集上将RTANet与几种最先进的网络嵌入方法进行了比较,结果表明RTANet在推荐任务中优于其他比较方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RTANet: Recommendation Target-Aware Network Embedding
Network embedding is a process of encoding nodes into latent vectors by preserving network structure and content information. It is used in various applications, especially in recommender systems. In a social network setting, when recommending new friends to a user, the similarity between the user's embedding and the target friend will be examined. Traditional methods generate user node embedding without considering the recommendation target. No matter which target is to be recommended, the same embedding vector is generated for that particular user. This approach has its limitations. For example, a user can be both a computer scientist and a musician. When recommending music friends with potentially the same taste to him, we are interested in getting his representation that is useful in recommending music friends rather than computer scientists. His corresponding embedding should consider the user's musical features rather than those associated with computer science with the awareness that the recommendation targets are music friends. In order to address this issue, we propose a new framework which we name it as Recommendation Target-Aware Network embedding method (RTANet). Herein, the embedding of each user is no longer fixed to a constant vector, but it can vary according to their specific recommendation target. Concretely, RTANet assigns different attention weights to each neighbour node, allowing us to obtain the user's context information aggregated from its neighbours before transforming this context into its embedding. Different from other graph attention approaches, the attention weights in our work measure the similarity between each user's neighbour node and the target node, which in return generates the target-aware embedding. To demonstrate the effectiveness of our method, we compared RTANet with several state-of-the-art network embedding methods on four real-world datasets and showed that RTANet outperforms other comparative methods in the recommendation tasks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
RTANet: Recommendation Target-Aware Network Embedding Who Is behind a Trend? Temporal Analysis of Interactions among Trend Participants on Twitter Host-Centric Social Connectedness of Migrants in Europe on Facebook Recipe Networks and the Principles of Healthy Food on the Web Social Influence-Maximizing Group Recommendation
×
引用
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