{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:04:56Z","timestamp":1778267096793,"version":"3.51.4"},"reference-count":53,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T00:00:00Z","timestamp":1552003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,10,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Many real-world complex systems can be better modelled as multiplex networks, where the same individuals develop connections in multiple layers. Examples include social networks between individuals on multiple social networking platforms, and transportation networks between cities based on air, rail and road networks. Accurately predicting spurious links in multiplex networks is a challenging issue. In this article, we show that one can effectively use interlayer information to build an algorithm for spurious link prediction. We propose a similarity index that combines intralayer similarity with interlayer relevance for the link prediction purpose. The proposed similarity index is used to rank the node pairs, and identify those that are likely to be spurious. Our experimental results show that the proposed metric is much more accurate than intralayer similarity measures in correctly predicting the spurious links. The proposed method is an unsupervised method and has low computation complexity, and thus can be effectively applied for spurious link prediction in large-scale networks.<\/jats:p>","DOI":"10.1093\/comnet\/cnz007","type":"journal-article","created":{"date-parts":[[2019,2,8]],"date-time":"2019-02-08T07:10:05Z","timestamp":1549609805000},"page":"641-658","source":"Crossref","is-referenced-by-count":25,"title":["Discovering spurious links in multiplex networks based on interlayer relevance"],"prefix":"10.1093","volume":"7","author":[{"given":"Zeynab","family":"Samei","sequence":"first","affiliation":[{"name":"Department of Computer Science, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Jalili","sequence":"additional","affiliation":[{"name":"School of Engineering, RMIT University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2019,3,8]]},"reference":[{"key":"2019101609185819500_B1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","article-title":"Complex networks: structure and dynamics","volume":"424","author":"Boccaletti,","year":"2006","journal-title":"Phys. Rep."},{"key":"2019101609185819500_B2","first-page":"665","article-title":"Information cascades in complex networks","volume":"5","author":"Jalili,","year":"2017","journal-title":"J. Complex Netw."},{"key":"2019101609185819500_B3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1038\/nature750","article-title":"Comparative assessment of large-scale data sets of protein\u2013protein interactions","volume":"417","author":"Von Mering,","year":"2002","journal-title":"Nature"},{"key":"2019101609185819500_B4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0378-8733(02)00038-2","article-title":"Network inference, error, and informant (in) accuracy: a Bayesian approach","volume":"25","author":"Butts,","year":"2003","journal-title":"Soc. Networks"},{"key":"2019101609185819500_B5","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","article-title":"Hierarchical structure and the prediction of missing links in networks","volume":"453","author":"Clauset,","year":"2008","journal-title":"Nature"},{"key":"2019101609185819500_B6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1038\/453047a","article-title":"Networks: teasing out the missing links","volume":"453","author":"Redner,","year":"2008","journal-title":"Nature"},{"key":"2019101609185819500_B7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/1117454.1117458","article-title":"Prediction and ranking algorithms for event-based network data","volume":"7","author":"O\u2019Madadhain,","year":"2005","journal-title":"ACM SIGKDD explorations newsletter"},{"key":"2019101609185819500_B8","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Liben-Nowell,","year":"2007","journal-title":"J. Assoc. Inf. Sci. Technol."},{"key":"2019101609185819500_B9","first-page":"296","volume":"98","author":"Lin,","journal-title":"An Information-Theoretic Definition of Similarity"},{"key":"2019101609185819500_B10","doi-asserted-by":"crossref","first-page":"138701","DOI":"10.1103\/PhysRevLett.91.138701","article-title":"Preferential attachment in the protein network evolution","volume":"91","author":"Eisenberg,","year":"2003","journal-title":"Phys. Rev. Lett."},{"key":"2019101609185819500_B11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","article-title":"Friends and neighbors on the web","volume":"25","author":"Adamic,","year":"2003","journal-title":"Soc. Networks"},{"key":"2019101609185819500_B12","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting missing links via local information","volume":"71","author":"Zhou,","year":"2009","journal-title":"Eur. Phys. J. B"},{"key":"2019101609185819500_B13","doi-asserted-by":"crossref","first-page":"48007","DOI":"10.1209\/0295-5075\/96\/48007","article-title":"Link prediction in complex networks: A local na\u00efve Bayes model","volume":"96","author":"Liu,","year":"2011","journal-title":"Europhys. Lett."},{"key":"2019101609185819500_B14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz,","year":"1953","journal-title":"Psychometrika"},{"key":"2019101609185819500_B15","doi-asserted-by":"crossref","first-page":"046122","DOI":"10.1103\/PhysRevE.80.046122","article-title":"Similarity index based on local paths for link prediction of complex networks","volume":"80","author":"L\u00fc,","year":"2009","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B16","first-page":"228","volume-title":"A Method of Link Prediction Based on Betweenness","author":"Zhang,"},{"key":"2019101609185819500_B17","doi-asserted-by":"crossref","first-page":"056112","DOI":"10.1103\/PhysRevE.85.056112","article-title":"Finding missing edges in networks based on their community structure","volume":"85","author":"Yan,","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B18","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.knosys.2016.01.034","article-title":"Prediction of missing links based on community relevance and ruler inference","volume":"98","author":"Ding,","year":"2016","journal-title":"Knowl. Based Syst."},{"key":"2019101609185819500_B19","first-page":"377","article-title":"Use noisy link analysis to improve Web search","journal-title":"ACM"},{"key":"2019101609185819500_B20","doi-asserted-by":"crossref","first-page":"046126","DOI":"10.1103\/PhysRevE.70.046126","article-title":"Scale-free trees: the skeletons of complex networks","volume":"70","author":"Kim,","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B21","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1038\/srep01344","article-title":"Emergence of network features from multiplexity","volume":"3","author":"Cardillo,","year":"2013","journal-title":"Scientific reports"},{"key":"2019101609185819500_B22","doi-asserted-by":"crossref","first-page":"058701","DOI":"10.1103\/PhysRevLett.111.058701","article-title":"Growing multiplex networks","volume":"111","author":"Nicosia,","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"2019101609185819500_B23","doi-asserted-by":"crossref","first-page":"13636","DOI":"10.1073\/pnas.1004008107","article-title":"Multirelational organization of large-scale social networks in an online world","volume":"107","author":"Szell,","year":"2010","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2019101609185819500_B24","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1093\/comnet\/cnu016","article-title":"Multilayer networks","volume":"2","author":"Kivel\u00e4,","year":"2014","journal-title":"J. Complex Netw."},{"key":"2019101609185819500_B25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","article-title":"The structure and dynamics of multilayer networks","volume":"544","author":"Boccaletti,","year":"2014","journal-title":"Phys. Rep."},{"key":"2019101609185819500_B26","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1140\/epjb\/e2015-50742-1","article-title":"Towards real-world complexity: an introduction to multiplex networks","volume":"88","author":"Lee,","year":"2015","journal-title":"Eur. Phys. J. B"},{"key":"2019101609185819500_B27","doi-asserted-by":"crossref","first-page":"160863","DOI":"10.1098\/rsos.160863","article-title":"Link prediction in multiplex online social networks","volume":"4","author":"Jalili,","year":"2017","journal-title":"R. Soc. Open Sci."},{"key":"2019101609185819500_B28","doi-asserted-by":"crossref","first-page":"13707","DOI":"10.1038\/srep13707","article-title":"An information-theoretic model for link prediction in complex networks","volume":"5","author":"Zhu,","year":"2015","journal-title":"Sci. Rep."},{"key":"2019101609185819500_B29","doi-asserted-by":"crossref","first-page":"17","DOI":"10.3934\/nhm.2015.10.17","article-title":"Link prediction in multiplex networks","volume":"10","author":"Pujari,","year":"2015","journal-title":"Netw. Heterog. Media."},{"key":"2019101609185819500_B30","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1140\/epjds\/s13688-016-0087-z","article-title":"A multilayer approach to multiplexity and link prediction in online geo-social networks","volume":"5","author":"Hristova,","year":"2016","journal-title":"EPJ Data Sci."},{"key":"2019101609185819500_B31","first-page":"453","article-title":"An efficient method for link prediction in complex multiplex networks","journal-title":"11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS)"},{"key":"2019101609185819500_B32","doi-asserted-by":"crossref","first-page":"1750101","DOI":"10.1142\/S0129183117501017","article-title":"Link prediction via layer relevance of multiplex networks","volume":"28","author":"Yao,","year":"2017","journal-title":"Int. J. Mod. Phys. C"},{"key":"2019101609185819500_B33","first-page":"55","volume-title":"A Holistic Approach for Link Prediction in Multiplex Networks","author":"Hajibagheri,"},{"key":"2019101609185819500_B34","doi-asserted-by":"crossref","first-page":"22073","DOI":"10.1073\/pnas.0908366106","article-title":"Missing and spurious interactions and the reconstruction of complex networks","volume":"106","author":"Guimer\u00e0,","year":"2009","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2019101609185819500_B35","doi-asserted-by":"crossref","first-page":"036101","DOI":"10.1103\/PhysRevE.85.036101","article-title":"Removing spurious interactions in complex networks","volume":"85","author":"Zeng,","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B36","doi-asserted-by":"crossref","first-page":"2350","DOI":"10.1016\/j.physleta.2014.06.011","article-title":"Identifying missing and spurious connections via the bi-directional diffusion on bipartite networks","volume":"378","author":"Zhang,","year":"2014","journal-title":"Phys. Lett. A"},{"key":"2019101609185819500_B37","doi-asserted-by":"crossref","first-page":"062806","DOI":"10.1103\/PhysRevE.87.062806","article-title":"Statistical mechanics of multiplex networks: entropy and overlap","volume":"87","author":"Bianconi,","year":"2013","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B38","doi-asserted-by":"crossref","first-page":"032804","DOI":"10.1103\/PhysRevE.89.032804","article-title":"Structural measures for multiplex networks","volume":"89","author":"Battiston,","year":"2014","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B39","doi-asserted-by":"crossref","first-page":"032805","DOI":"10.1103\/PhysRevE.92.032805","article-title":"Measuring and modeling correlations in multiplex networks","volume":"92","author":"Nicosia,","year":"2015","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B40","doi-asserted-by":"crossref","first-page":"9120","DOI":"10.1038\/srep09120","article-title":"Multiplexity versus correlation: the role of local constraints in real multiplexes","volume":"5","author":"Gemmetto,","year":"2015","journal-title":"Sci. Rep."},{"key":"2019101609185819500_B41","doi-asserted-by":"crossref","first-page":"033027","DOI":"10.1088\/1367-2630\/14\/3\/033027","article-title":"Correlated multiplexity and connectivity of multiplex random networks","volume":"14","author":"Lee,","year":"2012","journal-title":"New J. Phys."},{"key":"2019101609185819500_B42","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TKDE.2007.46","article-title":"Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation","volume":"19","author":"Fouss,","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2019101609185819500_B43","doi-asserted-by":"crossref","first-page":"58007","DOI":"10.1209\/0295-5075\/89\/58007","article-title":"Link prediction based on local random walk","volume":"89","author":"Liu,","year":"2010","journal-title":"Europhys. Lett."},{"key":"2019101609185819500_B44","doi-asserted-by":"crossref","first-page":"026120","DOI":"10.1103\/PhysRevE.73.026120","article-title":"Vertex similarity in networks","volume":"73","author":"Leicht,","year":"2006","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B45","doi-asserted-by":"crossref","first-page":"017101","DOI":"10.1103\/PhysRevE.80.017101","article-title":"Information filtering based on transferring similarity","volume":"80","author":"Sun,","year":"2009","journal-title":"Phys. Rev. E"},{"key":"2019101609185819500_B46","volume-title":"Representing Classroom Social Structure","year":"1981"},{"key":"2019101609185819500_B47","doi-asserted-by":"crossref","first-page":"253","DOI":"10.2307\/2785979","article-title":"The diffusion of an innovation among physicians","volume":"20","author":"Coleman,","year":"1957","journal-title":"Sociometry"},{"key":"2019101609185819500_B48","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199242726.001.0001","volume-title":"The Collegial Phenomenon: The Social Mechanisms of Cooperation Among Peers in a Corporate Law Partnership","author":"Lazega,","year":"2001"},{"key":"2019101609185819500_B49","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1111\/j.1467-9531.2006.00176.x","article-title":"New specifications for exponential random graph models","volume":"36","author":"Snijders,","year":"2006","journal-title":"Soc. Methodol."},{"key":"2019101609185819500_B50","article-title":"Combinatorial analysis of multiple networks","author":"Magnani,","year":"2013","journal-title":"arXiv preprint arXiv:1303.4986 [cs.SI]"},{"key":"2019101609185819500_B51","doi-asserted-by":"crossref","first-page":"4723","DOI":"10.1073\/pnas.0506806103","article-title":"Wiring optimization can relate neuronal structure and function","volume":"103","author":"Chen,","year":"2006","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2019101609185819500_B52","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/comnet\/cnu038","article-title":"MuxViz: a tool for multilayer analysis and visualization of networks","volume":"3","author":"De Domenico,","year":"2015","journal-title":"J. Complex Netw."},{"key":"2019101609185819500_B53","volume-title":"Memoire sur les Elections au Scrutin, 1781","author":"de Borda,","year":"1953"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/7\/5\/641\/30157037\/cnz007.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comnet\/article-pdf\/7\/5\/641\/30157037\/cnz007.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T16:37:59Z","timestamp":1571243879000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/7\/5\/641\/5372352"}},"subtitle":[],"editor":[{"given":"Matjaz","family":"Perc","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2019,3,8]]},"references-count":53,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2019,3,8]]},"published-print":{"date-parts":[[2019,10,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnz007","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2019,10]]},"published":{"date-parts":[[2019,3,8]]}}}