{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:29:17Z","timestamp":1775734157375,"version":"3.50.1"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61960206002, 62272306, 62032020, 62136006, 62020106005, 42050105, 62061146002"],"award-info":[{"award-number":["61960206002, 62272306, 62032020, 62136006, 62020106005, 42050105, 62061146002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shanghai Pilot Program for Basic Research \u2013 Shanghai Jiao Tong University"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>Network alignment, pairing corresponding nodes across the source and target networks, plays an important role in many data mining tasks. Extensive studies focus on learning node embeddings across different networks in a unified space. However, these methods have not taken the large structural discrepancy between aligned nodes into account and, thus, are largely confined by the deterministic representations of nodes. In this work, we propose a novel network alignment framework highlighted by distributional learning and globally optimal alignment. By modeling the uncertainty of each node by Gaussian distribution, our framework builds similarity matrices on the Wasserstein distance between distributions and applies Sinkhorn operation, which learns the globally optimal mapping in an end-to-end fashion. We show that each integrated part of the framework contributes to the overall performance. Under a variety of experimental settings, our alignment framework shows superior accuracy and efficiency to the state-of-the-art.<\/jats:p>","DOI":"10.1145\/3638056","type":"journal-article","created":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T12:01:21Z","timestamp":1703073681000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Distributional Learning for Network Alignment with Global Constraints"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4617-9814","authenticated-orcid":false,"given":"Hui","family":"Xu","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0165-4930","authenticated-orcid":false,"given":"Liyao","family":"Xiang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5200-1409","authenticated-orcid":false,"given":"Xiaoying","family":"Gan","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7796-9168","authenticated-orcid":false,"given":"Luoyi","family":"Fu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0357-8356","authenticated-orcid":false,"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3331-2302","authenticated-orcid":false,"given":"Chenghu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,2,12]]},"reference":[{"key":"e_1_3_2_2_2","article-title":"Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking","author":"Bojchevski Aleksandar","year":"2018","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking. 6th International Conference on Learning Representations, ICLR (2018).","journal-title":"6th International Conference on Learning Representations, ICLR"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313499"},{"key":"e_1_3_2_4_2","article-title":"Fast and accurate deep network learning by exponential linear units (ELUS)","author":"Clevert Djork-Arn\u00e9","year":"2016","unstructured":"Djork-Arn\u00e9 Clevert, Thomas Unterthiner, and Sepp Hochreiter. 2016. Fast and accurate deep network learning by exponential linear units (ELUS). 4th International Conference on Learning Representations, ICLR (2016).","journal-title":"4th International Conference on Learning Representations, ICLR"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.130"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220002"},{"key":"e_1_3_2_7_2","first-page":"2251","volume-title":"IJCAI","author":"Du Xingbo","year":"2019","unstructured":"Xingbo Du, Junchi Yan, and Hongyuan Zha. 2019. Joint link prediction and network alignment via cross-graph embedding. In IJCAI. 2251\u20132257."},{"key":"e_1_3_2_8_2","volume-title":"8th International Conference on Learning Representations, ICLR","author":"Fey Matthias","year":"2020","unstructured":"Matthias Fey, Jan Eric Lenssen, Christopher Morris, Jonathan Masci, and Nils M. Kriege. 2020. Deep graph matching consensus. In 8th International Conference on Learning Representations, ICLR."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2962731"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271788"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/3294996.3295078"},{"key":"e_1_3_2_12_2","volume-title":"3rd International Conference on Learning Representations, ICLR","author":"Kingma Diederik P.","year":"2015","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In 3rd International Conference on Learning Representations, ICLR."},{"key":"e_1_3_2_13_2","volume-title":"2nd International Conference on Learning Representations, ICLR","author":"Kingma Diederik P.","year":"2014","unstructured":"Diederik P. Kingma and Max Welling. 2014. Auto-encoding variational Bayes. In 2nd International Conference on Learning Representations, ICLR."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301996"},{"key":"e_1_3_2_15_2","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence, IJCAI","author":"Liu Li","year":"2016","unstructured":"Li Liu, William K. Cheung, Xin Li, and Lejian Liao. 2016. Aligning users across social networks using network embedding. In Proceedings of the 25th International Joint Conference on Artificial Intelligence, IJCAI."},{"key":"e_1_3_2_16_2","volume-title":"ICML","author":"Nair Vinod","year":"2010","unstructured":"Vinod Nair and Geoffrey E. Hinton. 2010. Rectified linear units improve restricted Boltzmann machines. In ICML."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.6778"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00315"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/733"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1304"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450053"},{"key":"e_1_3_2_24_2","article-title":"Towards improving embedding based models of social network alignment via pseudo anchors","author":"Yan Zihan","year":"2021","unstructured":"Zihan Yan, Li Liu, Xin Li, William Cheung, Youmin Zhang, Qun Liu, and Guoyin Wang. 2021. Towards improving embedding based models of social network alignment via pseudo anchors. IEEE Transactions on Knowledge and Data Engineering (2021).","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00284"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155499"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.114"},{"key":"e_1_3_2_28_2","volume-title":"24th International Joint Conference on Artificial Intelligence, IJCAI","author":"Zhang Jiawei","year":"2016","unstructured":"Jiawei Zhang and S. Yu Philip. 2016. Integrated anchor and social link predictions across social networks. In 24th International Joint Conference on Artificial Intelligence, IJCAI."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403141"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.22613"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486231"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220052"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330851"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638056","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:35:53Z","timestamp":1750178153000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,12]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3638056"],"URL":"https:\/\/doi.org\/10.1145\/3638056","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,12]]},"assertion":[{"value":"2022-10-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-15","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}