{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:01:33Z","timestamp":1760709693815,"version":"3.41.2"},"reference-count":59,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T00:00:00Z","timestamp":1535846400000},"content-version":"vor","delay-in-days":244,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762077","61602225"],"award-info":[{"award-number":["61762077","61602225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Link prediction, which aims to forecast potential or missing links in a complex network based on currently observed information, has drawn growing attention from researchers. To date, a host of similarity\u2010based methods have been put forward. Usually, one method harbors the idea that one similarity measure is applicable to various networks, and thus has performance fluctuation on different networks. In this paper, we propose a novel method to solve this issue by regarding link prediction as a multiple\u2010attribute decision\u2010making (MADM) problem. In the proposed method, we consider RA, LP, and CAR indices as the multiattribute for node pairs. The technique for order performance by similarity to ideal solution (TOPSIS) is adopted to aggregate the multiattribute and rank node pairs. The proposed method is not limited to only one similarity measure, but takes separate measures into account, since different networks may have different topological structures. Experimental results on 10 real\u2010world networks manifest that the proposed method is superior in comparison to state\u2010of\u2010the\u2010art methods.<\/jats:p>","DOI":"10.1155\/2018\/3579758","type":"journal-article","created":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T23:33:30Z","timestamp":1535931210000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Finding Missing Links in Complex Networks: A Multiple\u2010Attribute Decision\u2010Making Method"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5866-617X","authenticated-orcid":false,"given":"Longjie","family":"Li","sequence":"first","affiliation":[]},{"given":"Shenshen","family":"Bai","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8512-785X","authenticated-orcid":false,"given":"Mingwei","family":"Leng","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaoyun","family":"Chen","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-014-5237-y"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(03)00239-0"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0708078105"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3012704"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep38208"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0055437"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep10350"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2010.91"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0908366106"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2492559"},{"key":"e_1_2_10_11_2","doi-asserted-by":"crossref","unstructured":"FireM. TenenboimL. LesserO. PuzisR. RokachL. andEloviciY. Link prediction in social networks using computationally efficient topological features 2011 IEEE Third International Conference on Privacy Security Risk and Trust and 2011 IEEE Third International Conference on Social Computing 2012 Boston MA USA 73\u201380 https:\/\/doi.org\/10.1109\/PASSAT\/SocialCom.2011.20 2-s2.0-84856196261.","DOI":"10.1109\/PASSAT\/SocialCom.2011.20"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep30098"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.02.006"},{"key":"e_1_2_10_14_2","doi-asserted-by":"crossref","unstructured":"HuangZ. LiX. andChenH. Link prediction approach to collaborative filtering Proceedings of the 5th ACM\/IEEE-CS joint conference on Digital libraries - JCDL \u203205 2005 Denver CO USA 141\u2013142 ACMhttps:\/\/doi.org\/10.1145\/1065385.1065415.","DOI":"10.1145\/1065385.1065415"},{"key":"e_1_2_10_15_2","unstructured":"PavlovM.andIchiseR. Finding experts by link prediction in co-authorship networks 290 Proceedings of the 2nd International Conference on Finding Experts on the Web with Semantics (FEWS-2007) 2007 Busan Republic Korea 42\u201355."},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0101214"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep22955"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/s0378-8733(03)00009-1"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2012.04.019"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.80.046122"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1038\/srep01613"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.01.038"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2017.08.047"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2015.12.003"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-018-0073-4"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature06830"},{"key":"e_1_2_10_30_2","first-page":"27","volume-title":"Decision Making in the Manufacturing Environment","author":"Rao R. V.","year":"2007"},{"key":"e_1_2_10_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.05.056"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(00)00399-X"},{"key":"e_1_2_10_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.12.016"},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2013.12.031"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48318-9"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46768-4_5"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2015.09.028"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2017.08.010"},{"key":"e_1_2_10_39_2","doi-asserted-by":"crossref","unstructured":"ZhouM. LiuR. ZhaoX. andZhuQ. Link prediction algorithm based on local centrality of common neighbor nodes using multi-attribute ranking 2017 12th International Conference on Computer Science and Education (ICCSE) 2017 Houston TX USA 506\u2013511 https:\/\/doi.org\/10.1109\/ICCSE.2017.8085544 2-s2.0-85040117849.","DOI":"10.1109\/ICCSE.2017.8085544"},{"key":"e_1_2_10_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"e_1_2_10_41_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0107056"},{"key":"e_1_2_10_42_2","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/96\/48007"},{"key":"e_1_2_10_43_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/8\/083001"},{"key":"e_1_2_10_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.06.003"},{"key":"e_1_2_10_45_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_2_10_46_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103"},{"key":"e_1_2_10_47_2","unstructured":"McAuleyJ.andLeskovecJ. Learning to discover social circles in ego networks 1 Proceedings of the 25th International Conference on Neural Information Processing Systems - NIPS\u201912 2012 Lake Tahoe NV USA 539\u2013547 Curran Associates Inc."},{"key":"e_1_2_10_48_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_10_49_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"key":"e_1_2_10_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2010.11.033"},{"key":"e_1_2_10_51_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219525903001067"},{"key":"e_1_2_10_52_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"e_1_2_10_53_2","doi-asserted-by":"crossref","unstructured":"AdamicL. A.andGlanceN. The political blogosphere and the 2004 U.S. election: divided they blog Proceedings of the 3rd International Workshop on Link Discovery - LinkKDD \u203205 2005 Chicago IL USA 36\u201343 https:\/\/doi.org\/10.1145\/1134271.1134277 2-s2.0-84958161527.","DOI":"10.1145\/1134271.1134277"},{"key":"e_1_2_10_54_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026126"},{"key":"e_1_2_10_55_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.87.198701"},{"key":"e_1_2_10_56_2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731944"},{"key":"e_1_2_10_57_2","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"Dem\u0161ar J.","year":"2006","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_10_58_2","doi-asserted-by":"publisher","DOI":"10.1080\/03610928008827904"},{"key":"e_1_2_10_59_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1961.10482090"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/3579758.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2018\/3579758.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/3579758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T22:50:31Z","timestamp":1723157431000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/3579758"}},"subtitle":[],"editor":[{"given":"Guido","family":"Caldarelli","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/3579758"],"URL":"https:\/\/doi.org\/10.1155\/2018\/3579758","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-03-29","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-25","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-09-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"3579758"}}