TY - JOUR
T1 - WL-Align
T2 - Weisfeiler-Lehman Relabeling for Aligning Users across Networks via Regularized Representation Learning
AU - Liu, Li
AU - Chen, Penggang
AU - Li, Xin
AU - Cheung, William K.
AU - Zhang, Youmin
AU - Liu, Qun
AU - Wang, Guoyin
N1 - Funding information:
The work is partially supported by National Natural Science Foundation of China (61936001, 62221005, 61806031), and in part by the Natural Science Foundation of Chongqing (cstc2019jcyj-cxttX0002, cstc2020jcyj-msxmX0943), and in part by the key cooperation project of Chongqing Municipal Education Commission (HZ2021008), and in part by Science and Technology Research Program of Chongqing Municipal Education Commission (KJQN202100629, KJQN202001901), and in part by Doctoral Innovation Talent Program of Chongqing University of Posts and Telecommunications (BYJS202118). This work is partially done when Li Liu works at Hong Kong Baptist University supported by the Hong Kong Scholars program (XJ2020054).
Publisher Copyright:
© 2023 IEEE.
PY - 2024/1
Y1 - 2024/1
N2 - Aligning users across networks using graph representation learning has been found effective where the alignment is accomplished in a low-dimensional embedding space. Yet, highly precise alignment remains challenging, especially for nodes with long-range connectivity to labeled anchors. To alleviate this limitation, we propose WL-Align which employs a regularized representation learning framework to learn distinctive node representations. It extends the Weisfeiler-Lehman Isormorphism Test and learns the alignment in alternating phases of "across-network Weisfeiler-Lehman relabeling" and "proximity-preserving representation learning". The across-network Weisfeiler-Lehman relabeling is achieved through iterating the anchor-based label propagation and a similarity-based hashing to exploit the known anchors' connectivity to different nodes in an efficient and robust manner. The representation learning module preserves the second-order proximity within individual networks and is regularized by the across-network Weisfeiler-Lehman hash labels. Extensive experiments on real-world and synthetic datasets have demonstrated that our proposed WL-Align outperforms the state-of-the-art methods, achieving significant performance improvements in the "exact matching" scenario.
AB - Aligning users across networks using graph representation learning has been found effective where the alignment is accomplished in a low-dimensional embedding space. Yet, highly precise alignment remains challenging, especially for nodes with long-range connectivity to labeled anchors. To alleviate this limitation, we propose WL-Align which employs a regularized representation learning framework to learn distinctive node representations. It extends the Weisfeiler-Lehman Isormorphism Test and learns the alignment in alternating phases of "across-network Weisfeiler-Lehman relabeling" and "proximity-preserving representation learning". The across-network Weisfeiler-Lehman relabeling is achieved through iterating the anchor-based label propagation and a similarity-based hashing to exploit the known anchors' connectivity to different nodes in an efficient and robust manner. The representation learning module preserves the second-order proximity within individual networks and is regularized by the across-network Weisfeiler-Lehman hash labels. Extensive experiments on real-world and synthetic datasets have demonstrated that our proposed WL-Align outperforms the state-of-the-art methods, achieving significant performance improvements in the "exact matching" scenario.
KW - Network alignment
KW - Representation Learning
KW - Social Networks
KW - Weisfeiler-Lehman Test
UR - http://www.scopus.com/inward/record.url?scp=85161037666&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2023.3277843
DO - 10.1109/TKDE.2023.3277843
M3 - Journal article
AN - SCOPUS:85161037666
SN - 1041-4347
VL - 36
SP - 445
EP - 458
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 1
ER -