{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T20:30:07Z","timestamp":1744921807546},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T00:00:00Z","timestamp":1658534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T00:00:00Z","timestamp":1658534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["61672284"],"award-info":[{"award-number":["61672284"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Link prediction is a fundamental research issue in complex network, which can reveal the potential relationships between users. Most of link prediction algorithms are heuristic and based on topology structure. Weisfeiler\u2013Lehman Neural Machine (WLNM), regarded as a new-generation method, has shown promising performance and thus got attention in link prediction. WLNM extracts an enclosing subgraph of each target link and encodes the subgraph as an adjacency matrix. But it does not consider the relationship between other links of the enclosing subgraph and target links. Therefore, WLNM does not make full use of the topology information around the link, and the extracted enclosing subgraph can only partially represent the topological features around the target link. In this work, a novel approach is proposed, named weighted enclosing subgraph-based link prediction (WESLP). It incorporates the link weights in the enclosing subgraph to reflect their relationship with the target link, and the Katz index between nodes is used to measure the relationship between two links. The prediction models are trained by different classifiers based on these weighted enclosing subgraphs. Experiments show that our proposed method consistently performs well on different real-world datasets.<\/jats:p>","DOI":"10.1186\/s13638-022-02143-1","type":"journal-article","created":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T10:03:17Z","timestamp":1658570597000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weighted enclosing subgraph-based link prediction for complex network"],"prefix":"10.1186","volume":"2022","author":[{"given":"Weiwei","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghai","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangjie","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdullah","family":"Al-Dhelaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Al-Dhelaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"issue":"7","key":"2143_CR1","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"David Liben-Nowell","year":"2007","unstructured":"David Liben-Nowell, Jon Kleinberg, The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019\u20131031 (2007)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"issue":"3","key":"2143_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"Lada A Adamic","year":"2003","unstructured":"Lada A. Adamic, Eytan Adar, Friends and neighbors on the web. Soc. Netw. 25(3), 211\u2013230 (2003)","journal-title":"Soc. Netw."},{"key":"2143_CR3","doi-asserted-by":"crossref","unstructured":"A. Menon, C. Elkan. Link prediction via matrix factorization. In ECML\/ PKDD, (2011)","DOI":"10.1007\/978-3-642-23783-6_28"},{"key":"2143_CR4","unstructured":"Yankai Lin, Zhiyuan Liu, Maosong Sun, Yang Liu, and Xuan Zhu. Learning entity and relation embeddings for knowledge graph completion. In Proceedings of AAAI, (2015)"},{"key":"2143_CR5","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L. L\u00fc, T. Zhou, Link prediction in complex networks: A survey. Phys. A Stat. Mech. Appl. 390, 1150\u20131170 (2011)","journal-title":"Phys. A Stat. Mech. Appl."},{"issue":"4","key":"2143_CR6","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"Tao Zhou","year":"2009","unstructured":"Tao Zhou, Linyuan L\u00fc, Yi-Cheng. Zhang, Predicting missing links via local information. Eur. Phys. J. B 71(4), 623\u2013630 (2009)","journal-title":"Eur. Phys. J. B"},{"key":"2143_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"ME Newman","year":"2001","unstructured":"M.E. Newman, Clustering and preferential attachment in growing networks. Phys. Rev. E 64, 025102 (2001)","journal-title":"Phys. Rev. E"},{"issue":"5439","key":"2143_CR8","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"Albert-L\u00e1szl\u00f3 Barab\u00e1si","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3. Barab\u00e1si, R\u00e9ka. Albert, Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"2143_CR9","doi-asserted-by":"crossref","unstructured":"Muhan Zhang, Yixin Chen. Weisfeiler-lehman neural machine for link prediction. In Proceedings of the 23rd ACM SIGKDD International Conference on knowledge discovery and data mining, pages 575\u2013583. ACM, (2017)","DOI":"10.1145\/3097983.3097996"},{"key":"2143_CR10","unstructured":"Mathias Niepert, Mohamed Ahmed, Konstantin Kutzkov. Learning convolutional neural networks for graphs. In Proceedings of the 33rd annual inter- national conference on machine learning. ACM, (2016)"},{"key":"2143_CR11","unstructured":"Shervashidze, Nino, Schweitzer, Pascal, Van Leeuwen, Erik Jan, Mehlhorn, Kurt, and Borg- wardt, Karsten M. Weisfeiler-lehman graph kernels. The Journal of Machine Learning Research, 12:2539\u20132561, (2011)"},{"key":"2143_CR12","unstructured":"M. Hasan, V. Chaoji, S. Salem, and M. Zaki. Link prediction using supervised learning. In Proceedings of the Workshop on Link Discovery: Issues, approaches and applications, (2005)"},{"issue":"1","key":"2143_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"Leo Katz","year":"1953","unstructured":"Leo Katz, A new status index derived from sociometric analysis. Psychometrika 18(1), 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"2143_CR14","doi-asserted-by":"crossref","unstructured":"W. Yuan, K. He, D. Guan, L. Zhou, C. Li. Graph kernel based link prediction for signed social networks. Inf. Fusion461\u201310, (2019)","DOI":"10.1016\/j.inffus.2018.04.004"},{"key":"2143_CR15","doi-asserted-by":"crossref","unstructured":"M. Ou, P. Cui, J. Pei, Z. Zhang, and W. Zhu. Asymmetric transitivity preserving graph em- bedding. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp. 672\u2013681, (2016)","DOI":"10.1145\/2939672.2939751"},{"issue":"3","key":"2143_CR16","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/s11069-011-9885-6","volume":"60","author":"S Wilkinson","year":"2012","unstructured":"S. Wilkinson, S. Dunn, S. Ma, The vulnerability of the European air traffic network to spatial hazards. Nat. Hazards 60(3), 1027\u201336 (2012)","journal-title":"Nat. Hazards"},{"issue":"6684","key":"2143_CR17","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"Duncan J Watts","year":"1998","unstructured":"Duncan J. Watts, Steven H. Strogatz, Collective dynamics of small-world networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"1","key":"2143_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TNET.2003.822655","volume":"12","author":"Neil Spring","year":"2004","unstructured":"Neil Spring, Ratul Mahajan, David Wetherall, Thomas Anderson, Measuring ISP topo- logies with rocketfuel. IEEE\/ACM Trans. Netw. 12(1), 2\u201316 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"2143_CR19","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1177\/107769901108800110","volume":"88","author":"S Meraz","year":"2011","unstructured":"S. Meraz, Using time series analysis to measure intermedia agenda-setting influence in traditional media and political blog networks. Journal. Mass Commun. Q. 88(1), 176\u2013194 (2011)","journal-title":"Journal. Mass Commun. Q."},{"issue":"3","key":"2143_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"Mark EJ Newman","year":"2006","unstructured":"Mark EJ. Newman, Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)","journal-title":"Phys. Rev. E"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02143-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-022-02143-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-022-02143-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T10:16:19Z","timestamp":1658571379000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-022-02143-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,23]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2143"],"URL":"https:\/\/doi.org\/10.1186\/s13638-022-02143-1","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,23]]},"assertion":[{"value":"7 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"65"}}