{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T17:36:57Z","timestamp":1779903417363,"version":"3.53.1"},"reference-count":59,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T00:00:00Z","timestamp":1637280000000},"content-version":"vor","delay-in-days":322,"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":["61901247"],"award-info":[{"award-number":["61901247"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61803047"],"award-info":[{"award-number":["61803047"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019BF032"],"award-info":[{"award-number":["ZR2019BF032"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012456","name":"National Social Science Fund of China","doi-asserted-by":"publisher","award":["19ZDA149"],"award-info":[{"award-number":["19ZDA149"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012456","name":"National Social Science Fund of China","doi-asserted-by":"publisher","award":["19ZDA324"],"award-info":[{"award-number":["19ZDA324"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["14370119"],"award-info":[{"award-number":["14370119"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["14390110"],"award-info":[{"award-number":["14390110"]}],"id":[{"id":"10.13039\/501100012226","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>Link prediction is a fundamental problem of data science, which usually calls for unfolding the mechanisms that govern the micro\u2010dynamics of networks. In this regard, using features obtained from network embedding for predicting links has drawn widespread attention. Although methods based on edge features or node similarity have been proposed to solve the link prediction problem, many technical challenges still exist due to the unique structural properties of networks, especially when the networks are sparse. From the graph mining perspective, we first give empirical evidence of the inconsistency between heuristic and learned edge features. Then, we propose a novel link prediction framework, <jats:italic>AdaSim<\/jats:italic>, by introducing an Adaptive Similarity function using features obtained from network embedding based on random walks. The node feature representations are obtained by optimizing a graph\u2010based objective function. Instead of generating edge features using binary operators, we perform link prediction solely leveraging the node features of the network. We define a flexible similarity function with one tunable parameter, which serves as a penalty of the original similarity measure. The optimal value is learned through supervised learning and thus is adaptive to data distribution. To evaluate the performance of our proposed algorithm, we conduct extensive experiments on eleven disparate networks of the real world. Experimental results show that <jats:italic>AdaSim<\/jats:italic> achieves better performance than state\u2010of\u2010the\u2010art algorithms and is robust to different sparsities of the networks.<\/jats:p>","DOI":"10.1155\/2021\/1277579","type":"journal-article","created":{"date-parts":[[2021,11,20]],"date-time":"2021-11-20T02:35:07Z","timestamp":1637375707000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Adaptive Similarity Function with Structural Features of Network Embedding for Missing Link Prediction"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6685-4071","authenticated-orcid":false,"given":"Chuanting","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7454-4276","authenticated-orcid":false,"given":"Ke-Ke","family":"Shang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9841-6586","authenticated-orcid":false,"given":"Jingping","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2021,11,19]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature05670"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/s003614450342480"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms11863"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1424644112"},{"key":"e_1_2_10_7_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature06830"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"SoundarajanS.andHopcroftJ. Using community information to improve the precision of link prediction methods Proceedings of the 21st International Conference on World Wide Web Ser. WWW \u201912 Companion April 2012 Lyon France ACM 607\u2013608.","DOI":"10.1145\/2187980.2188150"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.11.129"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.5107440"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105740"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcss.2019.2962819"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3424672"},{"key":"e_1_2_10_14_2","article-title":"Line graph neural networks for link prediction","volume":"99","author":"Cai L.","year":"2021","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_2_10_15_2","doi-asserted-by":"crossref","unstructured":"LichtenwalterR. N. LussierJ. T. andChawlaN. V. New perspectives and methods in link prediction Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining ser. KDD \u201910 July 2010 New York NY USA ACM 243\u2013252 https:\/\/doi.org\/10.1145\/1835804.1835837 2-s2.0-77956192510.","DOI":"10.1145\/1835804.1835837"},{"key":"e_1_2_10_16_2","unstructured":"Al HasanM. ChaojiV. SalemS. andZakiM. Link prediction using supervised learning Proceedings of the SDM\u201906: Workshop on Link Analysis Counter-terrorism and Security January 2006 Bethesda MD USA."},{"key":"e_1_2_10_17_2","doi-asserted-by":"crossref","unstructured":"BackstromL.andLeskovecJ. Supervised random walks: predicting and recommending links in social networks Proceedings of the Fourth ACM International Conference on Web Search and Data Mining ser. WSDM \u201911 February 2011 New York NY USA ACM 635\u2013644.","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-012-0068-6"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2553665"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2015.2441735"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.08.010"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/tip.2020.3037518"},{"key":"e_1_2_10_23_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 ser. KDD \u201914 August 2014 New York NY USA ACM 701\u2013710.","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_2_10_24_2","doi-asserted-by":"crossref","unstructured":"ZhiyuliA. LiangX. andZhouX. Learning structural features of nodes in large-scale networks for link prediction Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence Ser. AAAI\u201916 February 2016 Phoenix AZ USA AAAI Press 4286\u20134287.","DOI":"10.1609\/aaai.v30i1.9919"},{"key":"e_1_2_10_25_2","doi-asserted-by":"crossref","unstructured":"ZhangC. ZhangH. YuanD. andZhangM. Deep learning based link prediction with social pattern and external attribute knowledge in bibliographic networks Proceedings of the 2016 IEEE International Conference on Smart Data (SmartData) December 2016 Chengudu China 815\u2013821.","DOI":"10.1109\/iThings-GreenCom-CPSCom-SmartData.2016.170"},{"key":"e_1_2_10_26_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 Ser. KDD \u201916 August 2016 San Francisco CF USA ACM 855\u2013864.","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_2_10_27_2","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"e_1_2_10_28_2","doi-asserted-by":"publisher","DOI":"10.1140\/epjb\/e2009-00335-8"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.01.038"},{"key":"e_1_2_10_30_2","doi-asserted-by":"crossref","unstructured":"SunY. BarberR. GuptaM. AggarwalC. C. andHanJ. Co-author relationship prediction in heterogeneous bibliographic networks Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining Ser. ASONAM\u201911 July 2011 Washington DC USA IEEE Computer Society 121\u2013128.","DOI":"10.1109\/ASONAM.2011.112"},{"key":"e_1_2_10_31_2","doi-asserted-by":"crossref","unstructured":"DongY. TangJ. WuS. TianJ. ChawlaN. V. RaoJ. andCaoH. Link prediction and recommendation across heterogeneous social networks Proceedings of the 12th IEEE International Conference on Data Mining Ser. ICDM \u201912 December 2012 Washington DC USA IEEE Computer Society 181\u2013190 https:\/\/doi.org\/10.1109\/icdm.2012.140 2-s2.0-84874032107.","DOI":"10.1109\/ICDM.2012.140"},{"key":"e_1_2_10_32_2","doi-asserted-by":"crossref","unstructured":"DongY. ZhangJ. TangJ. ChawlaN. V. andWangB. Coupledlp: link prediction in coupled networks Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining Ser. KDD \u201915 August 2015 Sydney NSW Australia ACM 199\u2013208.","DOI":"10.1145\/2783258.2783329"},{"key":"e_1_2_10_33_2","unstructured":"ZhangJ.andYuP. S. Integrated anchor and social link predictions across partially aligned social networks Proceedings of the 24th International Joint Conference on Artificial Intelligence Ser. IJCAI \u201915 July 2015 Buenos Aires Argentina AAAI Press 2125\u20132131."},{"key":"e_1_2_10_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2013.50"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780317"},{"key":"e_1_2_10_37_2","doi-asserted-by":"crossref","unstructured":"WangD. CuiP. andZhuW. Structural deep network embedding Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining Ser. KDD \u201916 August 2016 San Francisco CF USA ACM 1225\u20131234.","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_2_10_38_2","doi-asserted-by":"crossref","unstructured":"WangX. CuiP. WangJ. PeiJ. ZhuW. andYangS. Community preserving network embedding Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence Ser. AAAI\u201917 February 2017 San Francisco CF USA AAAI Press 203\u2013209.","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"e_1_2_10_39_2","doi-asserted-by":"crossref","unstructured":"TuC. LiuH. LiuZ. andSunM. Cane: context-aware network embedding for relation modeling Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics Ser. ACL July 2017 Vancouver Canada ACL 1\u201310 https:\/\/doi.org\/10.18653\/v1\/p17-1158 2-s2.0-85037365640.","DOI":"10.18653\/v1\/P17-1158"},{"key":"e_1_2_10_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"e_1_2_10_41_2","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/172879"},{"key":"e_1_2_10_42_2","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"e_1_2_10_43_2","article-title":"What exactly are the properties of scale-free and other networks?","author":"Judd","journal-title":"EPL (Europhysics Letters) 103.5 (2013): 58004"},{"key":"e_1_2_10_44_2","first-page":"49","article-title":"Fitness networks for real world systems via modified preferential attachment","author":"Shang","journal-title":"Physica A: Statistical Mechanics and its Applications 474 (2017):"},{"key":"e_1_2_10_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.46"},{"key":"e_1_2_10_46_2","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732276"},{"key":"e_1_2_10_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/2776894"},{"key":"e_1_2_10_48_2","volume-title":"Fast Low-Cost Estimation of Network Properties Using Random Walks, ser. WAW\u201913","author":"Cooper C.","year":"2013"},{"key":"e_1_2_10_49_2","unstructured":"MikolovT. ChenK. CorradoG. andDeanJ. Efficient estimation of word representations in vector space 2013 ArXiv e-prints."},{"key":"e_1_2_10_50_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_2_10_51_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 ser. LinkKDD \u201905 April 2005 New York NY USA ACM 36\u201343.","DOI":"10.1145\/1134271.1134277"},{"key":"e_1_2_10_52_2","unstructured":"LeskovecJ.andKrevlA. SNAP Datasets: Stanford large network dataset collection 2014 http:\/\/snap.stanford.edu\/data."},{"key":"e_1_2_10_53_2","doi-asserted-by":"publisher","DOI":"10.1086\/386272"},{"key":"e_1_2_10_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2003.822655"},{"key":"e_1_2_10_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2005.07.002"},{"key":"e_1_2_10_56_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"e_1_2_10_57_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_10_58_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0210-x"},{"key":"e_1_2_10_59_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"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/1277579.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2021\/1277579.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/1277579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T22:17:17Z","timestamp":1723241837000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/1277579"}},"subtitle":[],"editor":[{"given":"Dan","family":"Seli\u015fteanu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"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\/1277579"],"URL":"https:\/\/doi.org\/10.1155\/2021\/1277579","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-08-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1277579"}}