{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:16:52Z","timestamp":1760710612941,"version":"3.41.2"},"reference-count":47,"publisher":"Oxford University Press (OUP)","license":[{"start":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T00:00:00Z","timestamp":1627603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100012325","name":"National Social Science Fund of China","doi-asserted-by":"publisher","award":["17XXW004"],"award-info":[{"award-number":["17XXW004"]}],"id":[{"id":"10.13039\/501100012325","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Traditional link prediction methods of social network are vulnerable to the influence of network structure and have poor generalization, and only on a small number of networks and evaluation indicators. To improve the stability and accuracy of link prediction, this paper assembles 15 similarity indexes, introduces the idea of stacking into the link prediction of complex networks, and presents a link prediction method (Logistic-regression LightGBM Stacking Link Prediction, LLSLP). Firstly, social network link prediction is regarded as a binary classification problem. Secondly, the hyper parameters of the basic model are determined by using cross-validation and grid searching; thirdly, Logistic-regression and LightGBM are integrated by stacked generalization; Finally, take 10 different networks as practical examples. The feasibility and effectiveness of the proposed method are verified by comparing 7 evaluation indicators. The experimental results show that: the proposed method is not only more than 98.71% higher than the traditional CN (Common Neighbor) and other models are 10.52% higher on average. In addition, compared with the traditional 15 link prediction algorithms, $F1- score$ value and $MCC$ (Matthews Correlation Coefficient) value is increased by 3.2%\u00a0~\u00a09.7% and 5.9% ~\u200914% respectively. The proposed method has good accuracy and generalization. It can also be applied to recommendation system.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab102","type":"journal-article","created":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T19:10:19Z","timestamp":1624475419000},"source":"Crossref","is-referenced-by-count":1,"title":["A Social Network Link Prediction Method Based on Stacked Generalization"],"prefix":"10.1093","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8619-0356","authenticated-orcid":false,"given":"Xiaoyang","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Chongqing University of Technology, Chongqing, 400054, China"}]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Chongqing University of Technology, Chongqing, 400054, China"}]}],"member":"286","published-online":{"date-parts":[[2021,7,30]]},"reference":[{"key":"2021073018550929500_ref1","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.ins.2018.07.064","article-title":"Identifying advisor-advisee relationships from co-author networks via a novel deep mode","volume":"6","author":"Zhao","year":"2018","journal-title":"Inform. Sci."},{"key":"2021073018550929500_ref2","first-page":"1","article-title":"Supervised link prediction in multiplex networks","volume":"203","author":"Na","year":"2020","journal-title":"Knowledge-Based Systems"},{"key":"2021073018550929500_ref3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/3308560.3316587","volume-title":"Proceedings of The 2019 World Wide Web Conference","author":"Brochier","year":"2019"},{"key":"2021073018550929500_ref4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ins.2019.01.023","article-title":"Paul Jaccard. An efficient recommendation generation using relevant jaccard similarity","volume":"483","author":"Sujoy","year":"2019","journal-title":"Inform. Sci."},{"key":"2021073018550929500_ref5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.procs.2017.05.021","article-title":"Graph ranking guarantees for numerical approximations to Katz centrality","volume":"108","author":"Nathan","year":"2017","journal-title":"Procedia Computer Science"},{"key":"2021073018550929500_ref6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.physa.2018.02.189","article-title":"Statistical similarity measures for link prediction in heterogeneous complex networks","volume":"501","author":"Shakibian","year":"2018","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"2021073018550929500_ref7","first-page":"32","article-title":"Applications of link prediction in social networks: A review","volume":"166","author":"Nur","year":"2020","journal-title":"Journal of Network and Computer Applications"},{"key":"2021073018550929500_ref8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.neucom.2019.08.068","article-title":"Graph regularization weighted nonnegative matrix factorization for link prediction in weighted complex network","volume":"369","author":"Chen","year":"2019","journal-title":"Neurocomputing"},{"key":"2021073018550929500_ref9","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1016\/j.physa.2019.04.015","article-title":"A pattern based supervised link prediction in directed complex network","volume":"525","author":"Ertan","year":"2019","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"2021073018550929500_ref10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/S1389-1286(00)00044-X","article-title":"Link prediction and path analysis using Markov chains","volume":"33","author":"Sarukkai","year":"2000","journal-title":"Computer Networks"},{"key":"2021073018550929500_ref11","first-page":"60","volume-title":"Proceedings of First International Conference on computing in an Imperfect World","author":"Zhu","year":"2002"},{"key":"2021073018550929500_ref12","first-page":"457","article-title":"Link prediction via linear optimization","volume":"528","author":"Ratha","year":"2019","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"2021073018550929500_ref13","first-page":"1","article-title":"Robust link prediction in criminal networks: A case study of the Sicilian mafia","volume":"161","author":"Francesco","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"2021073018550929500_ref14","doi-asserted-by":"crossref","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","article-title":"Clustering and preferential attachment in growing networks","volume":"64","author":"Newman","year":"2001","journal-title":"Physical Review E"},{"key":"2021073018550929500_ref15","doi-asserted-by":"crossref","first-page":"106978","DOI":"10.1016\/j.comnet.2019.106978","article-title":"Ensemble-model-based link prediction of complex networks","volume":"166","author":"Li","year":"2020","journal-title":"Computer Networks"},{"key":"2021073018550929500_ref16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.jocs.2017.08.007","article-title":"Link prediction in stochastic social networks: Learning automata approach","volume":"24","author":"Behnaz","year":"2018","journal-title":"J. Comput. Sci."},{"key":"2021073018550929500_ref17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"Journal of the Royal Statistical Society Series B-methodological"},{"key":"2021073018550929500_ref18","first-page":"3149","volume-title":"Proceedings of 31st Conference on Neural Information Processing Systems","author":"Ke","year":"2017"},{"key":"2021073018550929500_ref19","first-page":"83","article-title":"Hydrological post-processing using stacked generalization of quantile regression algorithms: Large-scale application over conus","volume":"577","author":"Hristos","year":"2019","journal-title":"J. Hydrol."},{"key":"2021073018550929500_ref20","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","article-title":"Link prediction in complex networks: A survey","volume":"390","author":"L\u00fc","year":"2011","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"2021073018550929500_ref21","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":"Physical Review E"},{"key":"2021073018550929500_ref22","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 Transactions on Knowledge and Data Engineering"},{"key":"2021073018550929500_ref23","first-page":"1505","article-title":"The matrix-forest theorem and measuring relations in small social groups","volume":"58","author":"Chebotarev","year":"2012","journal-title":"Automation Remote Control"},{"key":"2021073018550929500_ref24","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":"Journal of the American Society for Information Science and Technology"},{"key":"2021073018550929500_ref25","doi-asserted-by":"crossref","first-page":"22955","DOI":"10.1038\/srep22955","article-title":"Predicting missing links and identifying spurious links via likelihood analysis","volume":"6","author":"Pan","year":"2016","journal-title":"Sci. Rep."},{"key":"2021073018550929500_ref26","doi-asserted-by":"crossref","first-page":"042317","DOI":"10.1103\/PhysRevE.95.042317","article-title":"Community detection, link prediction, and layer interdependence in multilayer networks","volume":"95","author":"Bacco","year":"2017","journal-title":"Physical Review E"},{"key":"2021073018550929500_ref27","doi-asserted-by":"crossref","first-page":"2166","DOI":"10.1016\/j.physa.2017.11.134","article-title":"A novel multilayer model for missing link prediction and future link forecasting in dynamic complex networks","volume":"492","author":"Yasami","year":"2018","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"2021073018550929500_ref28","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.physa.2018.02.189","article-title":"Statistical similarity measures for link prediction in heterogeneous complex networks","volume":"501","author":"Shakibian","year":"2018","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"2021073018550929500_ref29","first-page":"124289","article-title":"Link prediction techniques, applications, and performance: A survey","volume":"533","author":"Ajay","year":"2020","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"2021073018550929500_ref30","first-page":"13","volume-title":"Proceedings of 2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","author":"Min","year":"2018"},{"key":"2021073018550929500_ref31","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/ICIS.2017.7959962","volume-title":"Proceedings of 2017 IEEE\/ACIS 16th International Conference on Computer and Information Science (ICIS)","author":"Sun","year":"2017"},{"key":"2021073018550929500_ref32","first-page":"3377","article-title":"Common neighbour structure and similarity intensity in complex networks","volume":"381","author":"Lei","year":"2019","journal-title":"Physics Letters A"},{"key":"2021073018550929500_ref33","doi-asserted-by":"crossref","first-page":"1859","DOI":"10.1016\/j.physa.2017.11.103","article-title":"Improving local clustering based top-L link prediction methods via asymmetric link clustering information","volume":"492","author":"Wu","year":"2018","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"2021073018550929500_ref34","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.knosys.2018.05.027","article-title":"Combining contextual, temporal and topological information for unsupervised link prediction in social networks","volume":"156","author":"Carlos","year":"2018","journal-title":"Knowledge-Based Systems"},{"key":"2021073018550929500_ref35","first-page":"485","volume-title":"Proceedings of 2015 IEEE International Conference on Data Mining Workshop (ICDMW)","author":"Mustafa","year":"2016"},{"key":"2021073018550929500_ref36","first-page":"381","volume-title":"Proceedings of 2016 15th IEEE International Conference on Machine Learning and Applications (ICMLA)","author":"Alper","year":"2017"},{"key":"2021073018550929500_ref37","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1109\/SMC.2017.8122595","volume-title":"Proceedings of 2017 IEEE International Conference on Systems, Man and Cybernetics (SMC)","author":"Wang","year":"2017"},{"key":"2021073018550929500_ref38","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.physa.2016.02.014","article-title":"The degree-related clustering coefficient and its application to link prediction","volume":"454","author":"Liu","year":"2016","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"2021073018550929500_ref39","first-page":"407","volume-title":"Proceedings of 2017 International Conference on Computer Science and Engineering (UBMK)","author":"Aziz","year":"2017"},{"key":"2021073018550929500_ref40","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1109\/TKDE.2018.2801854","article-title":"Link weight prediction using supervised learning methods and its application to yelp layered network","volume":"30","author":"Chenbo","year":"2018","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2021073018550929500_ref41","first-page":"1","article-title":"A supervised learning approach to link prediction in twitter","volume":"6","author":"Cherry","year":"2016","journal-title":"Social Network Analysis and Mining"},{"article-title":"Variational graph auto-encoders","year":"2016","author":"Thomas","key":"2021073018550929500_ref42"},{"key":"2021073018550929500_ref43","doi-asserted-by":"crossref","first-page":"29940","DOI":"10.1109\/ACCESS.2018.2840054","article-title":"Restricted boltzmann machine-based approaches for link prediction in dynamic networks","volume":"6","author":"Li","year":"2018","journal-title":"IEEE Access"},{"key":"2021073018550929500_ref44","first-page":"815","volume-title":"Proceedings of 2016 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)","author":"Chuanting","year":"2017"},{"key":"2021073018550929500_ref45","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ins.2019.05.050","article-title":"Link prediction in temporal networks: Integrating survival analysis and game theory","volume":"498","author":"Bu","year":"2019","journal-title":"Inform. Sci."},{"key":"2021073018550929500_ref46","doi-asserted-by":"crossref","first-page":"35937","DOI":"10.1109\/ACCESS.2018.2845876","article-title":"Deep learning for link prediction in dynamic networks using weak estimators","volume":"6","author":"Chiu","year":"2018","journal-title":"IEEE Access"},{"key":"2021073018550929500_ref47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2542182.2542192","article-title":"Computationally efficient link prediction in a variety of social networks","volume":"5","author":"Fire","year":"2013","journal-title":"ACM Transactions on Intelligent Systems and Technology"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/advance-article-pdf\/doi\/10.1093\/comjnl\/bxab102\/39457530\/bxab102.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/advance-article-pdf\/doi\/10.1093\/comjnl\/bxab102\/39457530\/bxab102.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T13:46:57Z","timestamp":1725284817000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/advance-article\/doi\/10.1093\/comjnl\/bxab102\/6330818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,30]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab102","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published":{"date-parts":[[2021,7,30]]},"article-number":"bxab102"}}