利用多头图注意力自动编码器建立高阶社会影响力模型

IF 3 2区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Systems Pub Date : 2024-10-05 DOI:10.1016/j.is.2024.102474
Elnaz Meydani , Christoph Duesing , Matthias Trier
{"title":"利用多头图注意力自动编码器建立高阶社会影响力模型","authors":"Elnaz Meydani ,&nbsp;Christoph Duesing ,&nbsp;Matthias Trier","doi":"10.1016/j.is.2024.102474","DOIUrl":null,"url":null,"abstract":"<div><div>Recommender systems are powerful tools developed to mitigate information overload in e-commerce platforms. Social recommender systems leverage social relations among users to predict their preferences. Recently, graph neural networks have been utilized for social recommendations, modeling user-user social relations and user–item interactions as graph-structured data. Despite their improvement over traditional systems, most existing social recommender systems exploit only first-order social relations and overlook the importance of social influence diffusion from higher-order neighbors in social networks. Additionally, these techniques often treat all neighboring nodes equally, without highlighting the most influential ones. To address these challenges, we introduce GATE-SR, a novel model that leverages a multi-head graph attention autoencoder to capture indirect social influence from higher-order neighbors while emphasizing the most relevant users. Moreover, we incorporate implicit social connections derived from coherent communities within the network. While GATE-SR performs comparably to baseline models in rich data environments, its strength lies in excelling at cold-start scenarios—where other models often fall short. This focus on cold-start performance aligns with our goal of building a robust recommender system for real-world challenges. Through extensive experiments on three real-world datasets, we demonstrate that GATE-SR outperforms several state-of-the-art baselines in cold-start scenarios. These results highlight the crucial role of accentuating the most influential neighbors, both explicit and implicit, when modeling higher-order social connections for more accurate recommendations.</div></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"128 ","pages":"Article 102474"},"PeriodicalIF":3.0000,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modeling higher-order social influence using multi-head graph attention autoencoder\",\"authors\":\"Elnaz Meydani ,&nbsp;Christoph Duesing ,&nbsp;Matthias Trier\",\"doi\":\"10.1016/j.is.2024.102474\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Recommender systems are powerful tools developed to mitigate information overload in e-commerce platforms. Social recommender systems leverage social relations among users to predict their preferences. Recently, graph neural networks have been utilized for social recommendations, modeling user-user social relations and user–item interactions as graph-structured data. Despite their improvement over traditional systems, most existing social recommender systems exploit only first-order social relations and overlook the importance of social influence diffusion from higher-order neighbors in social networks. Additionally, these techniques often treat all neighboring nodes equally, without highlighting the most influential ones. To address these challenges, we introduce GATE-SR, a novel model that leverages a multi-head graph attention autoencoder to capture indirect social influence from higher-order neighbors while emphasizing the most relevant users. Moreover, we incorporate implicit social connections derived from coherent communities within the network. While GATE-SR performs comparably to baseline models in rich data environments, its strength lies in excelling at cold-start scenarios—where other models often fall short. This focus on cold-start performance aligns with our goal of building a robust recommender system for real-world challenges. Through extensive experiments on three real-world datasets, we demonstrate that GATE-SR outperforms several state-of-the-art baselines in cold-start scenarios. These results highlight the crucial role of accentuating the most influential neighbors, both explicit and implicit, when modeling higher-order social connections for more accurate recommendations.</div></div>\",\"PeriodicalId\":50363,\"journal\":{\"name\":\"Information Systems\",\"volume\":\"128 \",\"pages\":\"Article 102474\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2024-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0306437924001327\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306437924001327","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

推荐系统是为减轻电子商务平台信息过载而开发的强大工具。社交推荐系统利用用户之间的社交关系来预测他们的偏好。最近,图神经网络被用于社交推荐,将用户与用户之间的社交关系和用户与物品之间的互动建模为图结构数据。尽管与传统系统相比有了改进,但大多数现有的社交推荐系统只利用了一阶社交关系,而忽视了社交网络中来自高阶邻居的社交影响扩散的重要性。此外,这些技术往往对所有邻接节点一视同仁,而没有突出最有影响力的节点。为了应对这些挑战,我们引入了 GATE-SR,这是一种新型模型,它利用多头图注意力自动编码器捕捉来自高阶邻居的间接社会影响,同时强调最相关的用户。此外,我们还纳入了来自网络内连贯社区的隐式社交联系。虽然 GATE-SR 在丰富数据环境中的表现与基线模型不相上下,但它的优势在于在冷启动场景中表现出色--而其他模型往往在这种场景中表现不佳。对冷启动性能的关注与我们的目标一致,即为现实世界的挑战建立一个强大的推荐系统。通过在三个真实世界数据集上的广泛实验,我们证明了 GATE-SR 在冷启动场景中的表现优于几个最先进的基线模型。这些结果凸显了在为更准确的推荐建立高阶社交关系模型时,突出最有影响力的邻居(包括显性和隐性邻居)的关键作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Modeling higher-order social influence using multi-head graph attention autoencoder
Recommender systems are powerful tools developed to mitigate information overload in e-commerce platforms. Social recommender systems leverage social relations among users to predict their preferences. Recently, graph neural networks have been utilized for social recommendations, modeling user-user social relations and user–item interactions as graph-structured data. Despite their improvement over traditional systems, most existing social recommender systems exploit only first-order social relations and overlook the importance of social influence diffusion from higher-order neighbors in social networks. Additionally, these techniques often treat all neighboring nodes equally, without highlighting the most influential ones. To address these challenges, we introduce GATE-SR, a novel model that leverages a multi-head graph attention autoencoder to capture indirect social influence from higher-order neighbors while emphasizing the most relevant users. Moreover, we incorporate implicit social connections derived from coherent communities within the network. While GATE-SR performs comparably to baseline models in rich data environments, its strength lies in excelling at cold-start scenarios—where other models often fall short. This focus on cold-start performance aligns with our goal of building a robust recommender system for real-world challenges. Through extensive experiments on three real-world datasets, we demonstrate that GATE-SR outperforms several state-of-the-art baselines in cold-start scenarios. These results highlight the crucial role of accentuating the most influential neighbors, both explicit and implicit, when modeling higher-order social connections for more accurate recommendations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Systems
Information Systems 工程技术-计算机:信息系统
CiteScore
9.40
自引率
2.70%
发文量
112
审稿时长
53 days
期刊介绍: Information systems are the software and hardware systems that support data-intensive applications. The journal Information Systems publishes articles concerning the design and implementation of languages, data models, process models, algorithms, software and hardware for information systems. Subject areas include data management issues as presented in the principal international database conferences (e.g., ACM SIGMOD/PODS, VLDB, ICDE and ICDT/EDBT) as well as data-related issues from the fields of data mining/machine learning, information retrieval coordinated with structured data, internet and cloud data management, business process management, web semantics, visual and audio information systems, scientific computing, and data science. Implementation papers having to do with massively parallel data management, fault tolerance in practice, and special purpose hardware for data-intensive systems are also welcome. Manuscripts from application domains, such as urban informatics, social and natural science, and Internet of Things, are also welcome. All papers should highlight innovative solutions to data management problems such as new data models, performance enhancements, and show how those innovations contribute to the goals of the application.
期刊最新文献
Two-level massive string dictionaries A generative and discriminative model for diversity-promoting recommendation Soundness unknotted: An efficient soundness checking algorithm for arbitrary cyclic process models by loosening loops The composition diagram of a complex process: Enhancing understanding of hierarchical business processes Editorial Board
×
引用
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