{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:14:00Z","timestamp":1781518440551,"version":"3.54.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T00:00:00Z","timestamp":1689897600000},"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":["62202164"],"award-info":[{"award-number":["62202164"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2022MS018"],"award-info":[{"award-number":["2022MS018"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["III-1763325, III-1909323, III-2106758, SaTC-1930941"],"award-info":[{"award-number":["III-1763325, III-1909323, III-2106758, SaTC-1930941"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2023,8,31]]},"abstract":"<jats:p>\n            Social network alignment, identifying social accounts of the same individual across different social networks, shows fundamental importance in a wide spectrum of applications, such as link prediction and information diffusion. Individuals more often than not join in multiple social networks, and it is in fact much too expensive or even impossible to acquiring supervision for guiding the alignment. To the best of our knowledge, few method in the literature can align multiple social networks without supervision. In this article, we propose to study the problem of unsupervised multiple social network alignment. To address this problem, we propose a novel unsupervised model of joint Matrix factorization with a diagonal Cone under orthogonal Constraint, referred to as MC\n            <jats:sup>2<\/jats:sup>\n            . Its core idea is to embed and align multiple social networks in the common subspace via an unsupervised approach. Specifically, in MC\n            <jats:sup>2<\/jats:sup>\n            model, we first design a matrix optimization to infer the common subspace from different social networks. To address the nonconvex optimization, we then design an efficient alternating algorithm by leveraging its inherent functional property. Through extensive experiments on real-world datasets, we demonstrate that the proposed MC\n            <jats:sup>2<\/jats:sup>\n            model significantly outperforms the state-of-the-art methods.\n          <\/jats:p>","DOI":"10.1145\/3596514","type":"journal-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T12:14:56Z","timestamp":1684239296000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["MC\n            <sup>2<\/sup>\n            : Unsupervised Multiple Social Network Alignment"],"prefix":"10.1145","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4562-2279","authenticated-orcid":false,"given":"Li","family":"Sun","sequence":"first","affiliation":[{"name":"North China Electric Power University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3242-150X","authenticated-orcid":false,"given":"Zhongbao","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3666-3936","authenticated-orcid":false,"given":"Gen","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5383-6671","authenticated-orcid":false,"given":"Pengxin","family":"Ji","sequence":"additional","affiliation":[{"name":"Beijing University of Posts and Telecommunications, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4266-7527","authenticated-orcid":false,"given":"Sen","family":"Su","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3491-5968","authenticated-orcid":false,"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,7,21]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"Ishaan Gulrajani Faruk Ahmed Mart\u00edn Arjovsky Vincent Dumoulin and Aaron C. Courville. 2017. Improved training of Wasserstein GANs. In Advance in NeurIPS 5767\u20135777."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_29"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271740"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313499"},{"key":"e_1_3_2_6_2","volume-title":"Proceeding of the SIGKDD","author":"Ding Chris H. Q.","year":"2006","unstructured":"Chris H. Q. Ding, Li Tao, Peng Wei, and Haesun Park. 2006. Orthogonal nonnegative matrix tri-factorizations for clustering. In Proceeding of the SIGKDD."},{"key":"e_1_3_2_7_2","unstructured":"Ngoc Diep Ho. 2008. Nonnegative matrix factorization: Algorithms and applications Doctoral thesis Universi\u00e9 catholique de Louvain 1\u2013165."},{"key":"e_1_3_2_8_2","first-page":"85","volume-title":"Proceedings of ICDE","author":"Huynh Thanh Trung","year":"2020","unstructured":"Thanh Trung Huynh, Van Vinh Tong, Thanh Tam Nguyen, Hongzhi Yin, Matthias Weidlich, and Nguyen Quoc Viet Hung. 2020. Adaptive network alignment with unsupervised and multi-order convolutional networks. In Proceedings of ICDE. IEEE, 85\u201396."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505531"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Daniel D. Lee and H. Sebastian Seung. 1999. Learning the parts of objects by non-negative matrix factorization. Nature 401 6755 (1999) 788\u2013791.","DOI":"10.1038\/44565"},{"key":"e_1_3_2_11_2","unstructured":"Daniel D. Lee and H. Sebastian Seung. 2000. Algorithms for non-negative matrix factorization. In Advances in the (NIPS\u201920) 535\u2013541."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271675"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301996"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp203"},{"key":"e_1_3_2_15_2","first-page":"1774","volume-title":"Proceeding of the 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 Proceeding of the IJCAI. 1774\u20131780."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588559"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/343"},{"key":"e_1_3_2_18_2","first-page":"1823","volume-title":"Proceeding of the IJCAI","author":"Man Tong","year":"2016","unstructured":"Tong Man, Huawei Shen, Shenghua Liu, Xiaolong Jin, and Xueqi Cheng. 2016. Predict anchor links across social networks via an embedding approach. In Proceeding of the IJCAI. 1823\u20131829."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939849"},{"key":"e_1_3_2_20_2","unstructured":"Yu. E. Nesterov. 1983. A method for solving the convex programming problem with convergence rate  \\(O(1\/k^2)\\) . Proceedings of the USSR Academy of Sciences (Mathematics) Vol. 3 543\u2013547."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"issue":"3","key":"e_1_3_2_22_2","first-page":"1","article-title":"Motives for online friending and following: The dark side of social network site connections","volume":"2","author":"Ouwerkerk Jaap W.","year":"2016","unstructured":"Jaap W. Ouwerkerk and Benjamin K. Johnson. 2016. Motives for online friending and following: The dark side of social network site connections. Social Media+ Society 2, 3 (2016), 1\u201313.","journal-title":"Social Media+ Society"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3068777.3068781"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/537"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00059"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8720"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1089\/cyber.2010.0651"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322242"},{"key":"e_1_3_2_31_2","first-page":"2611","article-title":"User identity linkage across social networks via linked heterogeneous network embedding","author":"Wang Yaqing","year":"2018","unstructured":"Yaqing Wang, Chunyan Feng, Ling Chen, Hongzhi Yin, Caili Guo, and Yunfei Chu. 2018. User identity linkage across social networks via linked heterogeneous network embedding. World Wide Web - Internet and Web Information Systems 22, 6 (2018), 2611\u20132632.","journal-title":"World Wide Web - Internet and Web Information Systems"},{"key":"e_1_3_2_32_2","first-page":"298","volume-title":"Proceeding of the ICML","author":"Wu Shan-Hung","year":"2014","unstructured":"Shan-Hung Wu, Hao-Heng Chien, Kuan-Hua Lin, and Philip S. Yu. 2014. Learning the consistent behavior of common users for target node prediction across social networks. In Proceeding of the ICML. 298\u2013306."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00182"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v3i1.13993"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487648"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18038-0_5"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271705"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.114"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883038"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313484"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783268"},{"key":"e_1_3_2_42_2","first-page":"1","volume-title":"Advance in NeurIPS","author":"Zhang Zaixi","year":"2022","unstructured":"Zaixi Zhang, Qi Liu, Qingyong Hu, and Chee-Kong Lee. 2022. Hierarchical graph transformer with adaptive node sampling. In Advance in NeurIPS, 1\u201313."},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20898"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.06.035"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12014"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486231"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3596514","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3596514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:48:00Z","timestamp":1750178880000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3596514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,21]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8,31]]}},"alternative-id":["10.1145\/3596514"],"URL":"https:\/\/doi.org\/10.1145\/3596514","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,21]]},"assertion":[{"value":"2020-11-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-04-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}