{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T02:02:12Z","timestamp":1780020132429,"version":"3.53.1"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.knosys.2026.116156","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:02:02Z","timestamp":1778284922000},"page":"116156","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Information-Maximized Optimal Transport for interpretable and robust unsupervised graph alignment"],"prefix":"10.1016","volume":"346","author":[{"given":"Jiayu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunyu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zeshu","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongli","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2026.116156_b1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2024.11.006","volume":"1107","author":"Tang","year":"2025","journal-title":"Phys. Rep."},{"key":"10.1016\/j.knosys.2026.116156_b2","article-title":"Novel geometric approach for global alignment of ppi networks","volume":"vol. 31","author":"Liu","year":"2017"},{"key":"10.1016\/j.knosys.2026.116156_b3","doi-asserted-by":"crossref","unstructured":"S. Zhang, H. Tong, L. Jin, Y. Xia, Y. Guo, Balancing consistency and disparity in network alignment, in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, 2021, pp. 2212\u20132222.","DOI":"10.1145\/3447548.3467331"},{"key":"10.1016\/j.knosys.2026.116156_b4","series-title":"61st Annual Meeting of the Association for Computational Linguistics, ACL 2023","first-page":"3320","article-title":"A fused gromov-wasserstein framework for unsupervised knowledge graph entity alignment","author":"Tang","year":"2023"},{"issue":"4","key":"10.1016\/j.knosys.2026.116156_b5","doi-asserted-by":"crossref","first-page":"4307","DOI":"10.1109\/TKDE.2021.3127585","article-title":"Towards improving embedding based models of social network alignment via pseudo anchors","volume":"35","author":"Yan","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.knosys.2026.116156_b6","doi-asserted-by":"crossref","unstructured":"D.-H. Seo, J.-H. Lim, W.-Y. Shin, S.-W. Kim, Leveraging trustworthy node attributes for effective network alignment, in: Proceedings of the 33rd ACM International Conference on Information and Knowledge Management, 2024, pp. 2004\u20132013.","DOI":"10.1145\/3627673.3679658"},{"key":"10.1016\/j.knosys.2026.116156_b7","doi-asserted-by":"crossref","first-page":"3620","DOI":"10.1109\/TIFS.2024.3364066","article-title":"Anchor link prediction for cross-network digital forensics from local and global perspectives","volume":"19","author":"Wang","year":"2024","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.knosys.2026.116156_b8","unstructured":"S. Saxena, J. Chandra, A survey on network alignment: approaches, applications and future directions, in: Proc. 33rd Int. Joint Conf. Artif. Intell., 2024, pp. 8216\u20138224."},{"key":"10.1016\/j.knosys.2026.116156_b9","first-page":"2664","article-title":"Gromov-wasserstein averaging of kernel and distance matrices","volume":"vol. 48","author":"Peyr\u00e9","year":"2016"},{"key":"10.1016\/j.knosys.2026.116156_b10","first-page":"214","article-title":"Wasserstein generative adversarial networks","volume":"vol. 70","author":"Arjovsky","year":"2017"},{"issue":"2","key":"10.1016\/j.knosys.2026.116156_b11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3712061","article-title":"Supposititious sarcasm detection and sentiment analysis coping hindi language in social networks harnessing zipf-mandelbrot probabilistic optimisation and perplexity entropy learning","volume":"24","author":"Pokhriyal","year":"2025","journal-title":"ACM Trans. Asian Low-Resource Lang. Inf. Process."},{"key":"10.1016\/j.knosys.2026.116156_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.neucom.2025.130499","article-title":"Sarcasm detection with induced sentimental cues using heuristic search based on unconstrained optimisation learning quantifying callousness on social media","volume":"645","author":"Pokhriyal","year":"2025","journal-title":"Neurocomputing"},{"key":"10.1016\/j.knosys.2026.116156_b13","first-page":"1","article-title":"Implicit and explicit sarcasm detection via target of offensive language and cognition of logistic tsallis entropy distribution in social networks","volume":"vol. 2","author":"Pokhriyal","year":"2024"},{"key":"10.1016\/j.knosys.2026.116156_b14","series-title":"IEEE INFOCOM 2018-IEEE Conference on Computer Communications","first-page":"1313","article-title":"Deeplink: A deep learning approach for user identity linkage","author":"Zhou","year":"2018"},{"issue":"2","key":"10.1016\/j.knosys.2026.116156_b15","first-page":"1881","article-title":"Network alignment with holistic embeddings","volume":"35","author":"Huynh","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"10.1016\/j.knosys.2026.116156_b16","doi-asserted-by":"crossref","first-page":"4693","DOI":"10.1109\/TKDE.2023.3329380","article-title":"Graph alignment neural network model with graph to sequence learning","volume":"36","author":"Ning","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.knosys.2026.116156_b17","series-title":"2024 IEEE 40th International Conference on Data Engineering","first-page":"2709","article-title":"Cina: Curvature-based integrated network alignment with hypergraph","author":"Jiao","year":"2024"},{"key":"10.1016\/j.knosys.2026.116156_b18","doi-asserted-by":"crossref","unstructured":"Q. Yu, Z. Zeng, Y. Yan, L. Ying, R. Srikant, H. Tong, Joint optimal transport and embedding for network alignment, in: Proceedings of the ACM on Web Conference 2025, 2025, pp. 2064\u20132075.","DOI":"10.1145\/3696410.3714937"},{"key":"10.1016\/j.knosys.2026.116156_b19","doi-asserted-by":"crossref","unstructured":"Z. Zeng, S. Zhang, Y. Xia, H. Tong, Parrot: Position-aware regularized optimal transport for network alignment, in: Proceedings of the ACM Web Conference 2023, 2023, pp. 372\u2013382.","DOI":"10.1145\/3543507.3583357"},{"key":"10.1016\/j.knosys.2026.116156_b20","first-page":"16660","article-title":"Hierarchical multi-marginal optimal transport for network alignment","volume":"vol. 38","author":"Zeng","year":"2024"},{"key":"10.1016\/j.knosys.2026.116156_b21","doi-asserted-by":"crossref","unstructured":"M. Heimann, H. Shen, T. Safavi, D. Koutra, Regal: Representation learning-based graph alignment, in: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018, pp. 117\u2013126.","DOI":"10.1145\/3269206.3271788"},{"issue":"2","key":"10.1016\/j.knosys.2026.116156_b22","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1109\/TCSS.2022.3144350","article-title":"Hackgan: Harmonious cross-network mapping using cyclegan with wasserstein\u2013procrustes learning for unsupervised network alignment","volume":"10","author":"Yang","year":"2022","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.knosys.2026.116156_b23","series-title":"International Conference on Machine Learning","first-page":"6275","article-title":"Optimal transport for structured data with application on graphs","author":"Titouan","year":"2019"},{"key":"10.1016\/j.knosys.2026.116156_b24","series-title":"International Conference on Machine Learning","first-page":"6932","article-title":"Gromov-wasserstein learning for graph matching and node embedding","author":"Xu","year":"2019"},{"key":"10.1016\/j.knosys.2026.116156_b25","doi-asserted-by":"crossref","unstructured":"J. Gao, X. Huang, J. Li, Unsupervised graph alignment with wasserstein distance discriminator, in: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, 2021, pp. 426\u2013435.","DOI":"10.1145\/3447548.3467332"},{"key":"10.1016\/j.knosys.2026.116156_b26","series-title":"2023 IEEE 39th International Conference on Data Engineering","first-page":"1638","article-title":"Robust attributed graph alignment via joint structure learning and optimal transport","author":"Tang","year":"2023"},{"key":"10.1016\/j.knosys.2026.116156_b27","first-page":"21913","article-title":"Hypergraph learning for unsupervised graph alignment via optimal transport","volume":"vol. 39","author":"Yan","year":"2025"},{"key":"10.1016\/j.knosys.2026.116156_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2025.112029","article-title":"Robust oblique projection and weighted nmf for hyperspectral unmixing","volume":"170","author":"Hashemi-Nazari","year":"2026","journal-title":"Pattern Recognit."},{"issue":"7","key":"10.1016\/j.knosys.2026.116156_b29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10994-025-06793-2","article-title":"Simultaneous outlier detection and elimination in hyperspectral unmixing via weighted non-negative matrix tri-factorization","volume":"114","author":"Hashemi-Nazari","year":"2025","journal-title":"Mach. Learn."},{"issue":"2","key":"10.1016\/j.knosys.2026.116156_b30","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s11263-024-02196-3","article-title":"A comprehensive study on robustness of image classification models: Benchmarking and rethinking","volume":"133","author":"Liu","year":"2025","journal-title":"Int. J. Comput. Vis."},{"issue":"3","key":"10.1016\/j.knosys.2026.116156_b31","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","article-title":"On estimation of a probability density function and mode","volume":"33","author":"Parzen","year":"1962","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"10.1016\/j.knosys.2026.116156_b32","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1137\/120872802","article-title":"A generalized forward\u2013backward splitting","volume":"6","author":"Raguet","year":"2013","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"10.1016\/j.knosys.2026.116156_b33","first-page":"93","article-title":"Collective classification in network data","volume":"29","author":"Sen","year":"2008","journal-title":"AI Mag."},{"issue":"14","key":"10.1016\/j.knosys.2026.116156_b34","doi-asserted-by":"crossref","first-page":"i190","DOI":"10.1093\/bioinformatics\/btx252","article-title":"Predicting multicellular function through multi-layer tissue networks","volume":"33","author":"Zitnik","year":"2017","journal-title":"Bioinformatics"},{"key":"10.1016\/j.knosys.2026.116156_b35","article-title":"Learning to discover social circles in ego networks","volume":"25","author":"Leskovec","year":"2012","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.knosys.2026.116156_b36","series-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"1345","article-title":"Final: Fast attributed network alignment","author":"Zhang","year":"2016"},{"issue":"9","key":"10.1016\/j.knosys.2026.116156_b37","doi-asserted-by":"crossref","first-page":"1680","DOI":"10.1109\/TKDE.2018.2866440","article-title":"Attributed network alignment: Problem definitions and fast solutions","volume":"31","author":"Zhang","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.knosys.2026.116156_b38","doi-asserted-by":"crossref","unstructured":"Z. Wang, Q. Lv, X. Lan, Y. Zhang, Cross-lingual knowledge graph alignment via graph convolutional networks, in: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, 2018, pp. 349\u2013357.","DOI":"10.18653\/v1\/D18-1032"},{"key":"10.1016\/j.knosys.2026.116156_b39","unstructured":"P. Veli\u010dkovi\u0107, G. Cucurull, A. Casanova, A. Romero, P. Li\u00f2, Y. Bengio, Graph attention networks, in: International Conference on Learning Representations, 2018."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126008828?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705126008828?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T01:06:13Z","timestamp":1780016773000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705126008828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":39,"alternative-id":["S0950705126008828"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116156","relation":{},"ISSN":["0950-7051"],"issn-type":[{"value":"0950-7051","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Information-Maximized Optimal Transport for interpretable and robust unsupervised graph alignment","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2026.116156","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116156"}}