Dual Graph Convolutional Networks for Social Network Alignment

IF 7.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xiaoyu Guo;Yan Liu;Daofu Gong;Fenlin Liu
{"title":"Dual Graph Convolutional Networks for Social Network Alignment","authors":"Xiaoyu Guo;Yan Liu;Daofu Gong;Fenlin Liu","doi":"10.1109/TBDATA.2024.3423699","DOIUrl":null,"url":null,"abstract":"Social network alignment aims to discover the potential correspondence between users across different social platforms. Recent advances in graph representation learning have brought a new upsurge to network alignment. Most existing representation-based methods extract local structural information of social networks from users’ neighborhoods, but the global structural information has not been fully exploited. Therefore, this manuscript proposes a dual graph convolutional networks-based method (DualNA) for social network alignment, which combines user representation learning and user alignment in a unified framework. Specifically, we design dual graph convolutional networks as feature extractors to capture the local and global structural information of social networks, and apply a two-part constraint mechanism, including reconstruction loss and contrastive loss, to jointly optimize the graph representation learning process. As a result, the learned user representations can not only preserve the local and global features of original networks, but also be distinguishable and suitable for the downstream task of social network alignment. Extensive experiments on three real-world datasets show that our proposed method outperforms all baselines. The ablation studies further illustrate the rationality and effectiveness of our method.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"11 2","pages":"684-695"},"PeriodicalIF":7.5000,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Big Data","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10587112/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Social network alignment aims to discover the potential correspondence between users across different social platforms. Recent advances in graph representation learning have brought a new upsurge to network alignment. Most existing representation-based methods extract local structural information of social networks from users’ neighborhoods, but the global structural information has not been fully exploited. Therefore, this manuscript proposes a dual graph convolutional networks-based method (DualNA) for social network alignment, which combines user representation learning and user alignment in a unified framework. Specifically, we design dual graph convolutional networks as feature extractors to capture the local and global structural information of social networks, and apply a two-part constraint mechanism, including reconstruction loss and contrastive loss, to jointly optimize the graph representation learning process. As a result, the learned user representations can not only preserve the local and global features of original networks, but also be distinguishable and suitable for the downstream task of social network alignment. Extensive experiments on three real-world datasets show that our proposed method outperforms all baselines. The ablation studies further illustrate the rationality and effectiveness of our method.
社会网络对齐的对偶图卷积网络
社交网络对齐旨在发现不同社交平台用户之间的潜在对应关系。图表示学习的最新进展为网络对齐带来了新的高潮。现有的基于表示的方法大多是从用户的邻域中提取社会网络的局部结构信息,但没有充分利用全局结构信息。因此,本文提出了一种基于对偶图卷积网络的社交网络对齐方法(DualNA),该方法将用户表示学习和用户对齐结合在一个统一的框架中。具体而言,我们设计了对偶图卷积网络作为特征提取器来捕获社会网络的局部和全局结构信息,并应用重构损失和对比损失两部分约束机制来共同优化图表示学习过程。结果表明,学习到的用户表征不仅保留了原始网络的局部和全局特征,而且具有可区分性,适合于社交网络对齐的下游任务。在三个真实数据集上的大量实验表明,我们提出的方法优于所有基线。烧蚀实验进一步证明了该方法的合理性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
11.80
自引率
2.80%
发文量
114
期刊介绍: The IEEE Transactions on Big Data publishes peer-reviewed articles focusing on big data. These articles present innovative research ideas and application results across disciplines, including novel theories, algorithms, and applications. Research areas cover a wide range, such as big data analytics, visualization, curation, management, semantics, infrastructure, standards, performance analysis, intelligence extraction, scientific discovery, security, privacy, and legal issues specific to big data. The journal also prioritizes applications of big data in fields generating massive datasets.
×
引用
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学术官方微信