{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:58:59Z","timestamp":1753887539675,"version":"3.41.2"},"reference-count":59,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T00:00:00Z","timestamp":1634083200000},"content-version":"vor","delay-in-days":285,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["TIN2012-36951"],"award-info":[{"award-number":["TIN2012-36951"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Role is a fundamental concept in the analysis of the behavior and function of interacting entities in complex networks. Role discovery is the task of uncovering the hidden roles of nodes within a network. Node roles are commonly defined in terms of equivalence classes. Two nodes have the same role if they fall within the same equivalence class. Automorphic equivalence, where two nodes are equivalent when they can swap their labels to form an isomorphic graph, captures this notion of role. The binary concept of equivalence is too restrictive, and nodes in real\u2010world networks rarely belong to the same equivalence class. Instead, a relaxed definition in terms of similarity or distance is commonly used to compute the degree to which two nodes are equivalent. In this paper, we propose a novel distance metric called automorphic distance, which measures how far two nodes are from being automorphically equivalent. We also study its application to node embedding, showing how our metric can be used to generate role\u2010preserving vector representations of nodes. Our experiments confirm that the proposed automorphic distance metric outperforms a state\u2010of\u2010the\u2010art automorphic equivalence\u2010based metric and different state\u2010of\u2010the\u2010art techniques for the generation of node embeddings in different role\u2010related tasks.<\/jats:p>","DOI":"10.1155\/2021\/5571006","type":"journal-article","created":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T23:07:17Z","timestamp":1634166437000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Automorphic Distance Metric and Its Application to Node Embedding for Role Mining"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6537-2599","authenticated-orcid":false,"given":"V\u00edctor","family":"Mart\u00ednez","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5012-8403","authenticated-orcid":false,"given":"Fernando","family":"Berzal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9987-1740","authenticated-orcid":false,"given":"Juan-Carlos","family":"Cubero","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2021,10,13]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2014.2349913"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.2003.3147"},{"key":"e_1_2_9_3_2","doi-asserted-by":"publisher","DOI":"10.1017\/s0020818309090195"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1098\/rsif.2005.0046"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.056117"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-011-0224-z"},{"key":"e_1_2_9_8_2","doi-asserted-by":"crossref","unstructured":"RossiR. A. GallagherB. NevilleJ. andHendersonK. Modeling dynamic behavior in large evolving graphs Proceedings of the 6th ACM International Conference on Web Search and Data Mining February 2013 Rome Italy ACM 667\u2013676 https:\/\/doi.org\/10.1145\/2433396.2433479 2-s2.0-84874255476.","DOI":"10.1145\/2433396.2433479"},{"key":"e_1_2_9_9_2","doi-asserted-by":"crossref","unstructured":"HendersonK. GallagherB. Eliassi-RadT. TongH. BasuS. AkogluL. KoutraD. FaloutsosC. andLiL. RolX: structural role extraction & mining in large graphs Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining August 2012 Beijing China 1231\u20131239.","DOI":"10.1145\/2339530.2339723"},{"key":"e_1_2_9_10_2","doi-asserted-by":"publisher","DOI":"10.1214\/09-aoas311"},{"key":"e_1_2_9_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(90)90023-3"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1086\/226141"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1080\/0022250x.1971.9989788"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90014-x"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.2307\/270991"},{"key":"e_1_2_9_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0378-8733(96)00298-5"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(88)90005-6"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1080\/0022250x.1994.9990134"},{"key":"e_1_2_9_19_2","unstructured":"GoyalP.andFerraraE. Graph embedding techniques applications and performance: a survey 2017 http:\/\/arxiv.org\/abs\/1705.02801."},{"key":"e_1_2_9_20_2","doi-asserted-by":"crossref","unstructured":"LiuJ. HeZ. WeiL. andHuangY. Content to node: self-translation network embedding Proceedings of the 24th ACM SIGKDD International Conference On Knowledge Discovery & Data Mining August 2018 London UK 1794\u20131802.","DOI":"10.1145\/3219819.3219988"},{"key":"e_1_2_9_21_2","doi-asserted-by":"crossref","unstructured":"TangJ. QuM. WangM. ZhangM. YanJ. andMeiQ. Line: large-scale information network embedding Proceedings of the 24th International Conference on World Wide Web May 2015 Florence Italy 1067\u20131077.","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_2_9_22_2","unstructured":"ZhengV. W. CavallariS. CaiH. ChangK. C.-C. andCambriaE. From node embedding to community embedding 2016 http:\/\/arxiv.org\/abs\/1610.09950."},{"key":"e_1_2_9_23_2","doi-asserted-by":"crossref","unstructured":"GroverA.andLeskovecJ. node2vec: scalable feature learning for networks Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining August 2016 San Francisco CA USA ACM 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_2_9_24_2","unstructured":"RibeiroL. F. R. SavereseP. H. P. andFigueiredoD. R. struc2vec: learning node representations from structural identity Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining August 2017 Halifax Canada 385\u2013394."},{"key":"e_1_2_9_25_2","doi-asserted-by":"crossref","unstructured":"JehG.andWidomJ. SimRank: a measure of structural-context similarity Proceedings of the 8th ACM SIGKDD International Conference On Knowledge Discovery And Data Mining July 2002 Edmonton Alberta Canada ACM 538\u2013543.","DOI":"10.1145\/775047.775126"},{"key":"e_1_2_9_26_2","doi-asserted-by":"crossref","unstructured":"HamedaniM. R.andKimS.-W. SimRank and its variants in academic literature data: measures and evaluation Proceedings of the 31st Annual ACM Symposium on Applied Computing April 2016 Pisa Italy ACM 1102\u20131107.","DOI":"10.1145\/2851613.2851811"},{"key":"e_1_2_9_27_2","doi-asserted-by":"crossref","unstructured":"LinZ. LyuM. R. andKingI. PageSim: a novel link-based measure of web page similarity Proceedings of the 15th International Conference on the World Wide Web May 2006 Edinburgh UK ACM 1019\u20131020.","DOI":"10.1145\/1135777.1135994"},{"key":"e_1_2_9_28_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.73.026120"},{"key":"e_1_2_9_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2518176"},{"key":"e_1_2_9_30_2","doi-asserted-by":"crossref","unstructured":"LiL. QianL. LeeV. E. LengM. ChenM. andChenX. Fast and accurate computation of role similarity via vertex centrality Proceedings of the International Conference on Web-Age Information Management June 2015 Qingdao China Springer International Publishing 123\u2013134 https:\/\/doi.org\/10.1007\/978-3-319-21042-1_10 2-s2.0-84937434244.","DOI":"10.1007\/978-3-319-21042-1_10"},{"key":"e_1_2_9_31_2","doi-asserted-by":"crossref","unstructured":"JinR. LeeV. E. andHongH. Axiomatic ranking of network role similarity Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining August 2011 San Diego CA USA ACM 922\u2013930 https:\/\/doi.org\/10.1145\/2020408.2020561 2-s2.0-80052667141.","DOI":"10.1145\/2020408.2020561"},{"key":"e_1_2_9_32_2","doi-asserted-by":"crossref","unstructured":"F\u00fcrerM. Weisfeiler-Lehman refinement requires at least a linear number of iterations Proceedings of the 28th International Colloquium on Automata Languages and Programming July 2001 Berlin Germany 322\u2013333 https:\/\/doi.org\/10.1007\/3-540-48224-5_27.","DOI":"10.1007\/3-540-48224-5_27"},{"key":"e_1_2_9_33_2","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Weisfeiler B.","year":"1968","journal-title":"Nauchno-Technicheskaya Informatsia"},{"key":"e_1_2_9_34_2","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze N.","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_9_35_2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_2_9_36_2","first-page":"61","article-title":"The small\u2013world problem","volume":"1","author":"Travers J.","year":"1967","journal-title":"Phychology Today"},{"key":"e_1_2_9_37_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_2_9_38_2","unstructured":"PageL. BrinS. MotwaniR. andWinogradT. The PageRank citation ranking: bringing order to the web 1999 Stanford University Press Redwood City CA USA Technical report."},{"key":"e_1_2_9_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_2_9_40_2","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_2_9_41_2","article-title":"Modeling the communication network in a sawmill","volume":"47","author":"Michael J. H.","year":"1997","journal-title":"Forest Products Journal"},{"key":"e_1_2_9_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00265-003-0651-y"},{"volume-title":"The Stanford GraphBase-A Platform For Combinatorial Computing","year":"1993","author":"Knuth D. E.","key":"e_1_2_9_43_2"},{"key":"e_1_2_9_44_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_9_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2013.50"},{"key":"e_1_2_9_46_2","unstructured":"GoldbergY.andLevyO. word2vec explained: deriving Mikolov et al.\u2019s negative-sampling word-embedding method 2014 http:\/\/arxiv.org\/abs\/1402.3722."},{"key":"e_1_2_9_47_2","doi-asserted-by":"crossref","unstructured":"PerozziB. Al-RfouR. andSkienaS. DeepWalk: online learning of social representations Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining August 2014 New York NY USA ACM 701\u2013710.","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_2_9_48_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"e_1_2_9_49_2","unstructured":"MikolovT. ChenK. CorradoG. andDeanJ. Efficient estimation of word representations in vector space Proceedings of the International Conference on Learning Representations ICLR 2013 May 2013 Scottsdale AZ USA."},{"volume-title":"Modern Multidimensional Scaling: Theory and Applications","year":"2005","author":"Borg I.","key":"e_1_2_9_50_2"},{"volume-title":"An Introduction to MDS","year":"2003","author":"Wickelmaier F.","key":"e_1_2_9_51_2"},{"key":"e_1_2_9_52_2","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"e_1_2_9_53_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"e_1_2_9_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8462-3_5"},{"key":"e_1_2_9_55_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511996368"},{"key":"e_1_2_9_56_2","doi-asserted-by":"publisher","DOI":"10.2307\/2580193"},{"key":"e_1_2_9_57_2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.so.08.080182.000501"},{"key":"e_1_2_9_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_2_9_59_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/5571006.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/5571006.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/5571006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T21:51:07Z","timestamp":1723240267000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/5571006"}},"subtitle":[],"editor":[{"given":"Atila","family":"Bueno","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/5571006"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5571006","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-02-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-14","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"5571006"}}