{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:23:46Z","timestamp":1776680626555,"version":"3.51.2"},"reference-count":62,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T00:00:00Z","timestamp":1665705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&amp;D Program of China","award":["2018YFD1100302"],"award-info":[{"award-number":["2018YFD1100302"]}]},{"name":"National Key R&amp;D Program of China","award":["31514020501"],"award-info":[{"award-number":["31514020501"]}]},{"name":"National Key R&amp;D Program of China","award":["31514020503"],"award-info":[{"award-number":["31514020503"]}]},{"name":"All-Army Common Information System Equipment Pre-Research Project","award":["2018YFD1100302"],"award-info":[{"award-number":["2018YFD1100302"]}]},{"name":"All-Army Common Information System Equipment Pre-Research Project","award":["31514020501"],"award-info":[{"award-number":["31514020501"]}]},{"name":"All-Army Common Information System Equipment Pre-Research Project","award":["31514020503"],"award-info":[{"award-number":["31514020503"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Classical link prediction methods mainly utilize vertex information and topological structure to predict missing links in networks. However, accessing vertex information in real-world networks, such as social networks, is still challenging. Moreover, link prediction methods based on topological structure are usually heuristic, and mainly consider common neighbors, vertex degrees and paths, which cannot fully represent the topology context. In recent years, network embedding models have shown efficiency for link prediction, but they lack interpretability. To address these issues, this paper proposes a novel link prediction method based on an optimized vertex collocation profile (OVCP). First, the 7-subgraph topology was proposed to represent the topology context of vertexes. Second, any 7-subgraph can be converted into a unique address by OVCP, and then we obtained the interpretable feature vectors of vertexes. Third, the classification model with OVCP features was used to predict links, and the overlapping community detection algorithm was employed to divide a network into multiple small communities, which can greatly reduce the complexity of our method. Experimental results demonstrate that the proposed method can achieve a promising performance compared with traditional link prediction methods, and has better interpretability than network-embedding-based methods.<\/jats:p>","DOI":"10.3390\/e24101465","type":"journal-article","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:04:55Z","timestamp":1665965095000},"page":"1465","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Supervised Link Prediction Method Using Optimized Vertex Collocation Profile"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8782-857X","authenticated-orcid":false,"given":"Peng","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing 211189, China"},{"name":"School of Cyber Science and Engineering, Southeast University, Nanjing 211189, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenxiao","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing 211189, China"},{"name":"Chien-Shiung Wu College, Southeast University, Nanjing 211189, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teng","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing 211189, China"},{"name":"Chien-Shiung Wu College, Southeast University, Nanjing 211189, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing 211189, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,14]]},"reference":[{"key":"ref_1","first-page":"1","article-title":"Link prediction in social networks: The state-of-the-art","volume":"58","author":"Wang","year":"2015","journal-title":"Sci. China Inf. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., and Kleinberg, J. (2003). The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol., 556\u2013559.","DOI":"10.1145\/956863.956972"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"L\u00fc, L., and Zhou, T. (2011). Link prediction in complex networks: A survey. Phys. A Stat. Mech. Its Appl., 1150\u20131170.","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1961","DOI":"10.1007\/s10462-017-9590-2","article-title":"A systemic analysis of link prediction in social network","volume":"52","author":"Haghani","year":"2019","journal-title":"Artif. Intell. Rev."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/356827.356830","article-title":"Approximate string matching","volume":"12","author":"Hall","year":"1980","journal-title":"ACM Comput. Surv."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","article-title":"A guided tour to approximate string matching","volume":"33","author":"Navarro","year":"2001","journal-title":"ACM Comput. Surv."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Huang, Z. (2010). Link prediction based on graph topology: The predictive value of generalized clustering coefficient. Soc. Sci. Res. Netw.","DOI":"10.2139\/ssrn.1634014"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1109\/TCSS.2019.2950589","article-title":"Topo2vec: A novel node embedding generation based on network topology for link prediction","volume":"6","author":"Mallick","year":"2019","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"102716","DOI":"10.1016\/j.jnca.2020.102716","article-title":"Applications of link prediction in social networks: A review","volume":"166","author":"Daud","year":"2020","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Ouyang, B., Jiang, L., and Teng, Z. (2016). A noise-filtering method for link prediction in complex networks. PLoS ONE, 11.","DOI":"10.1371\/journal.pone.0146925"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika, 39\u201343.","DOI":"10.1007\/BF02289026"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Newman, M.E. (2001). Clustering and preferential attachment in growing networks. Phys. Rev. E, 025102.","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"ref_13","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_14","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., and Mei, Q. (2015, January 18\u201322). Line: Large-scale information network embedding. Proceedings of the 24th International Conference on World Wide Web, Florence, Italy.","DOI":"10.1145\/2736277.2741093"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Grover, A., and Leskovec, J. (2016, January 13\u201317). Node2vec: Scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939754"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.neucom.2021.03.138","article-title":"Dynamic network embedding survey","volume":"472","author":"Xue","year":"2022","journal-title":"Neurocomputing"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Lichtenwalter, R.N., and Chawla, N.V. (2012, January 16\u201320). Vertex collocation profiles: Subgraph counting for link analysis and prediction. Proceedings of the 21st International Conference on World Wide Web, Lyon, France.","DOI":"10.1145\/2187836.2187973"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/2193-1801-3-116","article-title":"Vertex collocation profiles: Theory, computation, and results","volume":"3","author":"Lichtenwalter","year":"2014","journal-title":"SpringerPlus"},{"key":"ref_19","unstructured":"Christakis, N.A., and Fowler, J.H. (2009). Connected: The Surprising Power of Our Social Networks and How they Shape Our Lives, Brown Spark."},{"key":"ref_20","unstructured":"Guare, J. (2016). Six degrees of separation. The Contemporary Monologue Men, Routledge."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2501654.2501657","article-title":"Overlapping community detection in networks: The state-of-the-art and comparative study","volume":"45","author":"Xie","year":"2013","journal-title":"ACM Comput. Surv."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"032801","DOI":"10.1103\/PhysRevE.92.032801","article-title":"Faster unfolding of communities: Speeding up the Louvain algorithm","volume":"92","author":"Traag","year":"2015","journal-title":"Phys. Rev. E"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Anderson, A., Huttenlocher, D., Kleinberg, J., and Leskovec, J. (2012, January 8\u201312). Effects of user similarity in social media. Proceedings of the 5th ACM International Conference on Web Search and Data Mining, Seattle, CA, USA.","DOI":"10.1145\/2124295.2124378"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s13278-010-0006-4","article-title":"Analysis of user keyword similarity in online social networks","volume":"1","author":"Bhattacharyya","year":"2011","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s13278-012-0090-8","article-title":"User similarities on social networks","volume":"3","author":"Akcora","year":"2013","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_27","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_28","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting missing links via local information","volume":"71","author":"Zhou","year":"2009","journal-title":"Eur. Phys. J. B"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"046122","DOI":"10.1103\/PhysRevE.80.046122","article-title":"Similarity index based on local paths for link prediction of complex networks","volume":"80","author":"Jin","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Chen, H.H., Gou, L., Zhang, X., and Giles, C.L. (2012, January 26\u201330). Discovering missing links in networks using vertex similarity measures. Proceedings of the 27th Annual ACM Symposium on Applied Computing, Trento, Italy.","DOI":"10.1145\/2245276.2245305"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2119","DOI":"10.1016\/j.jss.2012.04.019","article-title":"Fast and accurate link prediction in social networking systems","volume":"85","author":"Papadimitriou","year":"2012","journal-title":"J. Syst. Softw."},{"key":"ref_32","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 Trans. Knowl. Data Eng."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Jeh, G., and Widom, J. (2002, January 23\u201326). Simrank: A measure of structural-context similarity. Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada.","DOI":"10.1145\/775047.775126"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1016\/j.dss.2012.09.019","article-title":"Recommendation as link prediction in bipartite graphs: A graph kernel-based machine learning approach","volume":"54","author":"Li","year":"2013","journal-title":"Decis. Support Syst."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Pujari, M., and Kanawati, R. (2012, January 7\u20139). Link prediction in complex networks by supervised rank aggregation. Proceedings of the 2012 IEEE 24th International Conference on Tools with Artificial Intelligence, Athens, Greece.","DOI":"10.1109\/ICTAI.2012.111"},{"key":"ref_36","unstructured":"Hahn, F. (1980). General equilibrium theory. Public Interest, 123."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Chiang, K.Y., Natarajan, N., Tewari, A., and Dhillon, I.S. (2011, January 24\u201328). Exploiting longer cycles for link prediction in signed networks. Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow, UK.","DOI":"10.1145\/2063576.2063742"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Wu, S., Sun, J., and Tang, J. (2013, January 4\u20138). Patent partner recommendation in enterprise social networks. Proceedings of the 6th ACM International Conference on Web Search and Data Mining, Rome, Italy.","DOI":"10.1145\/2433396.2433404"},{"key":"ref_39","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_40","doi-asserted-by":"crossref","first-page":"22073","DOI":"10.1073\/pnas.0908366106","article-title":"Missing and spurious interactions and the reconstruction of complex networks","volume":"106","year":"2009","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Kashima, H., and Abe, N. (2006, January 18\u201322). A parameterized probabilistic model of network evolution for supervised link prediction. Proceedings of the 6th International Conference on Data Mining, Hong Kong.","DOI":"10.1109\/ICDM.2006.8"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Menon, A.K., and Elkan, C. (2011, January 5\u20139). Link prediction via matrix factorization. Proceedings of the 2011 European Conference on Machine Learning and Knowledge Discovery in Databases-Volume Part II, Athens, Greece.","DOI":"10.1007\/978-3-642-23783-6_28"},{"key":"ref_43","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_44","unstructured":"Zhang, M., and Chen, Y. (2018). Link prediction based on graph neural networks. Adv. Neural Inf. Process. Syst., 31."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Islam, M.K., Aridhi, S., and Smail-Tabbone, M. (2020). A comparative study of similarity-based and GNN-based link prediction approaches. arXiv.","DOI":"10.5121\/csit.2021.111106"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1007\/s13278-013-0142-8","article-title":"Exploiting behaviors of communities of twitter users for link prediction","volume":"3","year":"2013","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"18004","DOI":"10.1209\/0295-5075\/101\/18004","article-title":"Hidden link prediction based on node centrality and weak ties","volume":"101","author":"Liu","year":"2013","journal-title":"Europhys. Lett."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Li, R.H., Yu, J.X., and Liu, J. (2011, January 24\u201328). Link prediction: The power of maximal entropy random walk. Proceedings of the 20th ACM International Conference on Information and Knowledge Management, Glasgow, UK.","DOI":"10.1145\/2063576.2063741"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S1574-0722(07)00039-X","article-title":"Information cascade experiments","volume":"1","author":"Anderson","year":"2008","journal-title":"Handb. Exp. Econ. Results"},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Qiu, B., Ivanova, K., Yen, J., and Liu, P. (2010, January 20\u201322). Behavior evolution and event-driven growth dynamics in social networks. Proceedings of the 2010 IEEE Second International Conference on Social Computing, Minneapolis, MI, USA.","DOI":"10.1109\/SocialCom.2010.38"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Kashima, H., Kato, T., Yamanishi, Y., Sugiyama, M., and Tsuda, K. (May, January 30). Link propagation: A fast semi-supervised learning algorithm for link prediction. Proceedings of the 2009 SIAM International Conference on Data Mining, Sparks, NV, USA.","DOI":"10.1137\/1.9781611972795.94"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2014.08.006","article-title":"Mining hidden links in social networks to achieve equilibrium","volume":"556","author":"Ma","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Chandrasekhar, A.G., and Jackson, M.O. (2014). Tractable and Consistent Random Graph Models, National Bureau of Economic Research.","DOI":"10.3386\/w20276"},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Juszczyszyn, K., Musial, K., and Budka, M. (2011, January 19\u201322). Link prediction based on subgraph evolution in dynamic social networks. Proceedings of the 2011 IEEE International Conference on Social Computing, Dalian, China.","DOI":"10.1109\/PASSAT\/SocialCom.2011.15"},{"key":"ref_55","first-page":"763","article-title":"Temporal changes in local topology of an email-based social network","volume":"28","author":"Juszczyszyn","year":"2009","journal-title":"Comput. Inform."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Juszczyszyn, K., Budka, M., and Musial, K. (2011, January 25\u201327). The dynamic structural patterns of social networks based on triad transitions. Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining, Kaohsiung City, Taiwan.","DOI":"10.1109\/ASONAM.2011.50"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961189.1961199","article-title":"LIBSVM: A library for support vector machines","volume":"2","author":"Chang","year":"2011","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref_58","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/MCSE.2011.37","article-title":"The NumPy array: A structure for efficient numerical computation","volume":"13","author":"Colbert","year":"2011","journal-title":"Comput. Sci. Eng."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","article-title":"SciPy 1.0: Fundamental algorithms for scientific computing in Python","volume":"17","author":"Virtanen","year":"2020","journal-title":"Nat. Methods"},{"key":"ref_61","unstructured":"Hagberg, A., Swart, P., and Chult, D.S. (2008). Exploring Network Structure, Dynamics, and Function Using NetworkX, Los Alamos National Lab. Technical Report."},{"key":"ref_62","first-page":"519","article-title":"AUC: A statistically consistent and more discriminating measure than accuracy","volume":"3","author":"Ling","year":"2003","journal-title":"Ijcai"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/10\/1465\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:54:05Z","timestamp":1760144045000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/10\/1465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,14]]},"references-count":62,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["e24101465"],"URL":"https:\/\/doi.org\/10.3390\/e24101465","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,14]]}}}