Accurate Network Alignment via Consistency in Node Evolution

IF 7.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Qiyao Peng;Yinghui Wang;Pengfei Jiao;Huaming Wu;Wenjun Wang
{"title":"Accurate Network Alignment via Consistency in Node Evolution","authors":"Qiyao Peng;Yinghui Wang;Pengfei Jiao;Huaming Wu;Wenjun Wang","doi":"10.1109/TBDATA.2024.3407543","DOIUrl":null,"url":null,"abstract":"Network alignment, which integrates multiple network resources by identifying anchor nodes that exist in different networks, is beneficial for conducting comprehensive network analysis. Although there have been many studies on network alignment, most of them are limited to static scenarios and only can achieve acceptable top-<inline-formula><tex-math>$\\alpha$</tex-math></inline-formula> (<inline-formula><tex-math>$\\alpha &gt; 10$</tex-math></inline-formula>) results. In the absence of considering dynamic changes in networks, accurate network alignment (i.e., top-1 result) faces two problems: 1) Missing information: focusing solely on aligning networks at a specific time leads to low top-1 performance due to the lack of information from other time periods; 2) Confusing information: ignoring temporal information and focusing on aligning networks across the entire time span leads to low top-1 performance due to inability to distinguish the neighborhood nodes of anchor nodes. In this paper, we propose a dynamic network alignment method, which aims to achieve better top-1 alignment results with consider changing network structures over time. Towards this end, we learn the representations of nodes in the changing network structure with time, and preserve the consistency of anchor node pairs during the time-evolution process. First, we employ a Structure-Time-aware module to capture network dynamics while preserving network structure and learning node representations that incorporate temporal information. Second, we ensure the global and local consistency of anchor node pairs over time by utilizing linear and similarity functions, respectively. Finally, we determine whether two nodes are anchor node pairs by maintaining consistency between global, local, and node representations. Experimental results obtained from real-world datasets demonstrate that the proposed model achieves performance comparable to several state-of-the-art methods.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"11 2","pages":"499-511"},"PeriodicalIF":7.5000,"publicationDate":"2024-03-30","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/10542470/","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

Network alignment, which integrates multiple network resources by identifying anchor nodes that exist in different networks, is beneficial for conducting comprehensive network analysis. Although there have been many studies on network alignment, most of them are limited to static scenarios and only can achieve acceptable top-$\alpha$ ($\alpha > 10$) results. In the absence of considering dynamic changes in networks, accurate network alignment (i.e., top-1 result) faces two problems: 1) Missing information: focusing solely on aligning networks at a specific time leads to low top-1 performance due to the lack of information from other time periods; 2) Confusing information: ignoring temporal information and focusing on aligning networks across the entire time span leads to low top-1 performance due to inability to distinguish the neighborhood nodes of anchor nodes. In this paper, we propose a dynamic network alignment method, which aims to achieve better top-1 alignment results with consider changing network structures over time. Towards this end, we learn the representations of nodes in the changing network structure with time, and preserve the consistency of anchor node pairs during the time-evolution process. First, we employ a Structure-Time-aware module to capture network dynamics while preserving network structure and learning node representations that incorporate temporal information. Second, we ensure the global and local consistency of anchor node pairs over time by utilizing linear and similarity functions, respectively. Finally, we determine whether two nodes are anchor node pairs by maintaining consistency between global, local, and node representations. Experimental results obtained from real-world datasets demonstrate that the proposed model achieves performance comparable to several state-of-the-art methods.
基于节点演化一致性的精确网络对齐
网络对齐通过识别存在于不同网络中的锚节点来整合多个网络资源,有利于进行网络综合分析。虽然已有很多关于网络对齐的研究,但大多局限于静态场景,只能实现可接受的top-$\alpha$ ($\alpha >;10美元)的结果。在不考虑网络动态变化的情况下,准确的网络对齐(即top-1结果)面临两个问题:1)信息缺失:只关注特定时间的网络对齐,由于缺乏其他时间段的信息,导致top-1性能较低;2)信息混淆:忽略时间信息,专注于在整个时间跨度内对齐网络,由于无法区分锚节点的邻域节点,导致top-1性能较低。在本文中,我们提出了一种动态网络对齐方法,该方法旨在在考虑网络结构随时间变化的情况下获得更好的top-1对齐结果。为此,我们学习节点在随时间变化的网络结构中的表示,并在时间演化过程中保持锚节点对的一致性。首先,我们采用结构-时间感知模块来捕获网络动态,同时保留网络结构并学习包含时间信息的节点表示。其次,我们分别利用线性函数和相似函数确保锚节点对随时间的全局和局部一致性。最后,我们通过保持全局、局部和节点表示之间的一致性来确定两个节点是否为锚节点对。从真实数据集获得的实验结果表明,所提出的模型达到了与几种最先进的方法相当的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信