{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:18:52Z","timestamp":1760059132608,"version":"build-2065373602"},"reference-count":65,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62205243"],"award-info":[{"award-number":["62205243"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Link prediction in bipartite networks is a challenging task due to their distinct structural characteristics, where edges only exist between nodes of different types. Most existing methods are based on structural similarity, assigning similarity scores to node pairs under the assumption that a higher similarity corresponds to a higher likelihood of connection. Local structural methods, in particular, are widely favored for their simplicity, interpretability, and computational efficiency. However, real-world bipartite networks often exhibit highly heterogeneous node degree distributions, which introduce biases and undermine the effectiveness of traditional local structure-based methods. To address this issue, we propose a novel link prediction framework that explicitly adjusts for the degree heterogeneity of intermediate nodes between unconnected node pairs and incorporates their influence within local connection patterns formed around these pairs. Furthermore, our framework differentiates between the roles of same-type and cross-type nodes by leveraging quadrangle graphs between unconnected nodes. This approach allows for a more nuanced capture of unique properties of bipartite networks and effectively mitigates the inherent degree bias commonly observed in such networks, resulting in considerable improvements in prediction accuracy. Experimental results on ten diverse bipartite networks demonstrate that our framework achieves competitive and robust performance compared to nineteen state-of-the-art link prediction methods.<\/jats:p>","DOI":"10.3390\/e27060556","type":"journal-article","created":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T20:26:50Z","timestamp":1748204810000},"page":"556","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Neighbor-Enhanced Link Prediction in Bipartite Networks"],"prefix":"10.3390","volume":"27","author":[{"given":"Guangtao","family":"Cheng","sequence":"first","affiliation":[{"name":"School of Information Engineering, Tianjin University of Commerce, Tianjin 300133, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3930-5680","authenticated-orcid":false,"given":"Chaochao","family":"Liu","sequence":"additional","affiliation":[{"name":"Chinese Academy of Cyberspace Studies, Beijing 100048, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuting","family":"Wei","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Tianjin University of Commerce, Tianjin 300133, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yueyue","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Tianjin University of Commerce, Tianjin 300133, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Chen","sequence":"additional","affiliation":[{"name":"Law School, Tianjin University, Tianjin 300054, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9944-3642","authenticated-orcid":false,"given":"Xiaobo","family":"Li","sequence":"additional","affiliation":[{"name":"School of Marine Science and Technology, Tianjin University, Tianjin 300054, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,5,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"124289","DOI":"10.1016\/j.physa.2020.124289","article-title":"Link prediction techniques, applications, and performance: A survey","volume":"553","author":"Kumar","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"3902","DOI":"10.1007\/s11227-023-05591-8","article-title":"A comprehensive survey of link prediction methods","volume":"80","author":"Arrar","year":"2024","journal-title":"J. Supercomput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"125795","DOI":"10.1016\/j.physa.2021.125795","article-title":"How to predict crime\u2014Informatics-inspired approach from link prediction","volume":"570","author":"Assouli","year":"2021","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"114046","DOI":"10.1016\/j.chaos.2023.114046","article-title":"A novel similarity-based parameterized method for link prediction","volume":"175","author":"Rai","year":"2023","journal-title":"Chaos Solitons Fractals"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1038\/s41467-019-09177-y","article-title":"Network-based prediction of protein interactions","volume":"10","author":"Luck","year":"2019","journal-title":"Nat. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Wong, L., Wang, L., You, Z.-H., Yuan, C.-A., Huang, Y.-A., and Cao, M.-Y. (2023). Gklomli: A link prediction model for inferring mirna\u2013lncrna interactions by using gaussian kernel-based method on network profile and linear optimization algorithm. BMC Bioinform., 24.","DOI":"10.1186\/s12859-023-05309-w"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TCSS.2020.3037040","article-title":"Personality-aware product recommendation system based on user interests mining and metapath discovery","volume":"8","author":"Dhelim","year":"2020","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"121229","DOI":"10.1016\/j.eswa.2023.121229","article-title":"Construction of implicit social network and recommendation between users and items via the isr-rrm algorithm","volume":"235","author":"Yu","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Cannistraci, C.V., Alanis-Lobato, G., and Ravasi, T. (2013). From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks. Sci. Rep., 3.","DOI":"10.1038\/srep01613"},{"key":"ref_10","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":"ref_11","doi-asserted-by":"crossref","first-page":"115991","DOI":"10.1016\/j.eswa.2021.115991","article-title":"Link prediction by deep non-negative matrix factorization","volume":"188","author":"Chen","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","article-title":"A survey on network embedding","volume":"31","author":"Cui","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.compbiomed.2018.09.019","article-title":"Prediction of new potential associations between lncrnas and environmental factors based on katz measure","volume":"102","author":"Vural","year":"2018","journal-title":"Comput. Biol. Med."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"046115","DOI":"10.1103\/PhysRevE.76.046115","article-title":"Bipartite network projection and personal recommendation","volume":"76","author":"Zhou","year":"2007","journal-title":"Phys. Rev. E"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.ins.2016.10.015","article-title":"Projection-based link prediction in a bipartite network","volume":"376","author":"Gao","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3474","DOI":"10.1093\/bioinformatics\/btaa157","article-title":"A graph regularized generalized matrix factorization model for predicting links in biomedical bipartite networks","volume":"36","author":"Zhang","year":"2020","journal-title":"Bioinformatics"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"128250","DOI":"10.1016\/j.neucom.2024.128250","article-title":"Self-supervised reconstructed graph learning for link prediction in bipartite graphs","volume":"602","author":"Jin","year":"2024","journal-title":"Neurocomputing"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"012805","DOI":"10.1103\/PhysRevE.90.012805","article-title":"Efficiently inferring community structure in bipartite networks","volume":"90","author":"Larremore","year":"2014","journal-title":"Phys. Rev. E"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1080\/09720502.2019.1643553","article-title":"Degree heterogeneity of graphs and networks. i. interpretation and the \u201cheterogeneity paradox\u201d","volume":"22","author":"Estrada","year":"2019","journal-title":"J. Interdiscip. Math."},{"key":"ref_20","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":"Phys. Rev. E"},{"key":"ref_21","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. Netw."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.physa.2017.02.078","article-title":"Extended resource allocation index for link prediction of complex network","volume":"479","author":"Liu","year":"2017","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_23","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":"Zhou","year":"2011","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"124980","DOI":"10.1016\/j.physa.2020.124980","article-title":"Link prediction using node information on local paths","volume":"557","author":"Aziz","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.eswa.2018.10.018","article-title":"A local random walk model for complex networks based on discriminative feature combinations","volume":"118","author":"Song","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"113037","DOI":"10.1088\/1367-2630\/17\/11\/113037","article-title":"Common neighbours and the local-community-paradigm for topological link prediction in bipartite networks","volume":"17","author":"Daminelli","year":"2015","journal-title":"New J. Phys."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"129853","DOI":"10.1016\/j.physa.2024.129853","article-title":"Mining odd-length paths for link prediction in bipartite networks","volume":"646","author":"Zhao","year":"2024","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1073\/pnas.98.2.404","article-title":"The structure of scientific collaboration networks","volume":"98","author":"Newman","year":"2001","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"016131","DOI":"10.1103\/PhysRevE.64.016131","article-title":"Scientific collaboration networks. i. network construction and fundamental results","volume":"64","author":"Newman","year":"2001","journal-title":"Phys. Rev. E"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.ins.2019.08.025","article-title":"Time-aware link prediction based on strengthened projection in bipartite networks","volume":"506","author":"Aslan","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"38002","DOI":"10.1209\/0295-5075\/117\/38002","article-title":"Link prediction via matrix completion","volume":"117","author":"Pech","year":"2017","journal-title":"Europhys. Lett."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"127016","DOI":"10.1016\/j.neucom.2023.127016","article-title":"Link prediction in bipartite networks via effective integration of explicit and implicit relations","volume":"566","author":"Chen","year":"2024","journal-title":"Neurocomputing"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"123645","DOI":"10.1016\/j.eswa.2024.123645","article-title":"Deep nonnegative matrix factorization with joint global and local structure preservation","volume":"249","author":"Biswas","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/s13278-023-01058-z","article-title":"A survey on bipartite graphs embedding","volume":"13","author":"Giamphy","year":"2023","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"102809","DOI":"10.1016\/j.inffus.2024.102809","article-title":"Cascaded frameworks in underwater optical image restoration","volume":"117","author":"Li","year":"2025","journal-title":"Inf. Fusion"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"4665","DOI":"10.1007\/s10489-022-03758-z","article-title":"Abine-crs: Course recommender system in online education using attributed bipartite network embedding","volume":"53","author":"Ahmad","year":"2023","journal-title":"Appl. Intell."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., and Skiena, S. (2014, January 24\u201327). Deepwalk: Online learning of social representations. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA.","DOI":"10.1145\/2623330.2623732"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Huang, W., Li, Y., Fang, Y., Fan, J., and Yang, H. (2020, January 25\u201330). Biane: Bipartite attributed network embedding. Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, Virtual.","DOI":"10.1145\/3397271.3401068"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Jing, B., Yan, Y., Ding, K., Park, C., Zhu, Y., Liu, H., and Tong, H. (2024, January 20\u201324). Sterling: Synergistic representation learning on bipartite graphs. Proceedings of the AAAI Conference on Artificial Intelligence, Vancouver, QC, Canada.","DOI":"10.1609\/aaai.v38i12.29195"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"2325","DOI":"10.1073\/pnas.1424644112","article-title":"Toward link predictability of complex networks","volume":"112","author":"Pan","year":"2015","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Muscoloni, A., and Cannistraci, C.V. (2021). Short note on comparing stacking modelling versus cannistraci-hebb adaptive network automata for link prediction in complex networks. Preprints.","DOI":"10.20944\/preprints202105.0689.v1"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Chen, X., Jiao, P., Yu, Y., Li, X., and Tang, M. (2019). Toward link predictability of bipartite networks based on structural enhancement and structural perturbation. Phys. A Stat. Mech. Its Appl., 527.","DOI":"10.1016\/j.physa.2019.121072"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Zheng, K., Zhang, X.-L., Wang, L., You, Z.-H., Ji, B.-Y., Liang, X., and Li, Z.-W. (2023). Sprda: A link prediction approach based on the structural perturbation to infer disease-associated piwi-interacting rnas. Briefings Bioinform., 24.","DOI":"10.1093\/bib\/bbac498"},{"key":"ref_44","unstructured":"Salha, G., Hennequin, R., and Vazirgiannis, M. (2019). Keep it simple: Graph autoencoders without graph convolutional networks. arXiv."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"140194","DOI":"10.1109\/ACCESS.2020.3010223","article-title":"Bipartite link prediction by intra-class connection based triadic closure","volume":"8","author":"Shin","year":"2020","journal-title":"IEEE Access"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Bl\u00f6cker, C., Smiljani\u0107, J., Scholtes, I., and Rosvall, M. (2022, January 9\u201312). Similarity-based link prediction from modular compression of network flows. Proceedings of the Learning on Graphs Conference, PMLR, Virtual Event.","DOI":"10.1093\/comnet\/cnab044"},{"key":"ref_47","unstructured":"Zhang, M., and Chen, Y. (2018). Link prediction based on graph neural networks. Advances in Neural Information Processing Systems, The MIT Press."},{"key":"ref_48","unstructured":"Zhang, M., and Chen, Y. (2019). Inductive matrix completion based on graph neural networks. arXiv."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/S0378-4371(02)00736-7","article-title":"Evolution of the social network of scientific collaborations","volume":"311","author":"Jeong","year":"2002","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1093\/bib\/bbx041","article-title":"Pioneering topological methods for network-based drug\u2013target prediction by exploiting a brain-network self-organization theory","volume":"19","author":"Daminelli","year":"2018","journal-title":"Briefings Bioinform."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1093\/bioinformatics\/btw715","article-title":"A novel approach based on katz measure to predict associations of human microbiota with non-infectious diseases","volume":"33","author":"Chen","year":"2017","journal-title":"Bioinformatics"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"122950","DOI":"10.1016\/j.physa.2019.122950","article-title":"Cndp: Link prediction based on common neighbors degree penalization","volume":"539","author":"Rafiee","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1007\/s10489-023-05211-1","article-title":"Deep non-negative matrix factorization with edge generator for link prediction in complex networks","volume":"54","author":"Yao","year":"2024","journal-title":"Appl. Intell."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"121319","DOI":"10.1016\/j.physa.2019.121319","article-title":"Link prediction via linear optimization","volume":"528","author":"Pech","year":"2019","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Wang, W., Chen, X., Jiao, P., and Jin, D. (2017). Similarity-based regularized latent feature model for link prediction in bipartite networks. Sci. Rep., 7.","DOI":"10.1038\/s41598-017-17157-9"},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-020-77364-9","article-title":"A potential energy and mutual information based link prediction approach for bipartite networks","volume":"10","author":"Kumar","year":"2020","journal-title":"Sci. Rep."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"i232","DOI":"10.1093\/bioinformatics\/btn162","article-title":"Prediction of drug\u2013target interaction networks from the integration of chemical and genomic spaces","volume":"24","author":"Yamanishi","year":"2008","journal-title":"Bioinformatics"},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Larremore, D.B., Clauset, A., and Buckee, C.O. (2013). A network approach to analyzing highly recombinant malaria parasite genes. PLoS Comput. Biol., 9.","DOI":"10.1371\/journal.pcbi.1003268"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"W39","DOI":"10.1093\/nar\/gku337","article-title":"Dinies: Drug\u2013target interaction network inference engine based on supervised analysis","volume":"42","author":"Yamanishi","year":"2014","journal-title":"Nucleic Acids Res."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1140\/epjb\/e2004-00124-y","article-title":"Detecting community structure in networks","volume":"38","author":"Newman","year":"2004","journal-title":"Eur. Phys. J. B"},{"key":"ref_61","first-page":"1","article-title":"The structure and dynamics of international development assistance","volume":"3","author":"Coscia","year":"2013","journal-title":"J. Glob. Dev."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"7794","DOI":"10.1073\/pnas.0407994102","article-title":"The worldwide air transportation network: Anomalous centrality, community structure, and cities\u2019 global roles","volume":"102","author":"Guimera","year":"2005","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Yildirim, M.A., and Coscia, M. (2014). Using random walks to generate associations between objects. PloS ONE, 9.","DOI":"10.1371\/journal.pone.0104813"},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/963770.963772","article-title":"Evaluating collaborative filtering recommender systems","volume":"22","author":"Herlocker","year":"2004","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1148\/radiology.148.3.6878708","article-title":"A method of comparing the areas under receiver operating characteristic curves derived from the same cases","volume":"148","author":"Hanley","year":"1983","journal-title":"Radiology"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/6\/556\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:40:10Z","timestamp":1760031610000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/6\/556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,25]]},"references-count":65,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["e27060556"],"URL":"https:\/\/doi.org\/10.3390\/e27060556","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,5,25]]}}}