Deep Cross-Network Alignment with Anchor Node Pair Diverse Local Structure

Network alignment (NA) offers a comprehensive way to build associations between different networks by identifying shared nodes. While the majority of current NA methods rely on the topological consistency assumption, which posits that shared nodes across different networks typically have similar loc...

Full description

Bibliographic Details
Main Authors: Yinghui Wang, Wenjun Wang, Minglai Shao, Yueheng Sun
Format: Article
Language:English
Published: MDPI AG 2023-04-01
Series:Algorithms
Subjects:
Online Access:https://www.mdpi.com/1999-4893/16/5/234
_version_ 1797601414650789888
author Yinghui Wang
Wenjun Wang
Minglai Shao
Yueheng Sun
author_facet Yinghui Wang
Wenjun Wang
Minglai Shao
Yueheng Sun
author_sort Yinghui Wang
collection DOAJ
description Network alignment (NA) offers a comprehensive way to build associations between different networks by identifying shared nodes. While the majority of current NA methods rely on the topological consistency assumption, which posits that shared nodes across different networks typically have similar local structures or neighbors, we argue that anchor nodes, which play a pivotal role in NA, face a more challenging scenario that is often overlooked. In this paper, we conduct extensive statistical analysis across networks to investigate the connection status of labeled anchor node pairs and categorize them into four situations. Based on our analysis, we propose an end-to-end network alignment framework that uses node representations as a distribution rather than a point vector to better handle the structural diversity of networks. To mitigate the influence of specific nodes, we introduce a mask mechanism during the representation learning process. In addition, we utilize meta-learning to generalize the learned information on labeled anchor node pairs to other node pairs. Finally, we perform comprehensive experiments on both real-world and synthetic datasets to confirm the efficacy of our proposed method. The experimental results demonstrate that the proposed model outperforms the state-of-the-art methods significantly.
first_indexed 2024-03-11T04:00:34Z
format Article
id doaj.art-5dff473a54e04f5d9433e5c14fda1f6f
institution Directory Open Access Journal
issn 1999-4893
language English
last_indexed 2024-03-11T04:00:34Z
publishDate 2023-04-01
publisher MDPI AG
record_format Article
series Algorithms
spelling doaj.art-5dff473a54e04f5d9433e5c14fda1f6f2023-11-18T00:08:37ZengMDPI AGAlgorithms1999-48932023-04-0116523410.3390/a16050234Deep Cross-Network Alignment with Anchor Node Pair Diverse Local StructureYinghui Wang0Wenjun Wang1Minglai Shao2Yueheng Sun3College of Intelligence and Computing, Tianjin University, Tianjin 300350, ChinaCollege of Intelligence and Computing, Tianjin University, Tianjin 300350, ChinaSchool of New Media and Communication, Tianjin University, Tianjin 300350, ChinaCollege of Intelligence and Computing, Tianjin University, Tianjin 300350, ChinaNetwork alignment (NA) offers a comprehensive way to build associations between different networks by identifying shared nodes. While the majority of current NA methods rely on the topological consistency assumption, which posits that shared nodes across different networks typically have similar local structures or neighbors, we argue that anchor nodes, which play a pivotal role in NA, face a more challenging scenario that is often overlooked. In this paper, we conduct extensive statistical analysis across networks to investigate the connection status of labeled anchor node pairs and categorize them into four situations. Based on our analysis, we propose an end-to-end network alignment framework that uses node representations as a distribution rather than a point vector to better handle the structural diversity of networks. To mitigate the influence of specific nodes, we introduce a mask mechanism during the representation learning process. In addition, we utilize meta-learning to generalize the learned information on labeled anchor node pairs to other node pairs. Finally, we perform comprehensive experiments on both real-world and synthetic datasets to confirm the efficacy of our proposed method. The experimental results demonstrate that the proposed model outperforms the state-of-the-art methods significantly.https://www.mdpi.com/1999-4893/16/5/234network alignmentlocal structure diverseuncertainty node representationsdeep learning
spellingShingle Yinghui Wang
Wenjun Wang
Minglai Shao
Yueheng Sun
Deep Cross-Network Alignment with Anchor Node Pair Diverse Local Structure
Algorithms
network alignment
local structure diverse
uncertainty node representations
deep learning
title Deep Cross-Network Alignment with Anchor Node Pair Diverse Local Structure
title_full Deep Cross-Network Alignment with Anchor Node Pair Diverse Local Structure
title_fullStr Deep Cross-Network Alignment with Anchor Node Pair Diverse Local Structure
title_full_unstemmed Deep Cross-Network Alignment with Anchor Node Pair Diverse Local Structure
title_short Deep Cross-Network Alignment with Anchor Node Pair Diverse Local Structure
title_sort deep cross network alignment with anchor node pair diverse local structure
topic network alignment
local structure diverse
uncertainty node representations
deep learning
url https://www.mdpi.com/1999-4893/16/5/234
work_keys_str_mv AT yinghuiwang deepcrossnetworkalignmentwithanchornodepairdiverselocalstructure
AT wenjunwang deepcrossnetworkalignmentwithanchornodepairdiverselocalstructure
AT minglaishao deepcrossnetworkalignmentwithanchornodepairdiverselocalstructure
AT yuehengsun deepcrossnetworkalignmentwithanchornodepairdiverselocalstructure