{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:53:17Z","timestamp":1760151197747,"version":"build-2065373602"},"reference-count":40,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2022,2,20]],"date-time":"2022-02-20T00:00:00Z","timestamp":1645315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61803384"],"award-info":[{"award-number":["61803384"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In the domain of network science, the future link between nodes is a significant problem in social network analysis. Recently, temporal network link prediction has attracted many researchers due to its valuable real-world applications. However, the methods based on network structure similarity are generally limited to static networks, and the methods based on deep neural networks often have high computational costs. This paper fully mines the network structure information and time-domain attenuation information, and proposes a novel temporal link prediction method. Firstly, the network collective influence (CI) method is used to calculate the weights of nodes and edges. Then, the graph is divided into several community subgraphs by removing the weak link. Moreover, the biased random walk method is proposed, and the embedded representation vector is obtained by the modified Skip-gram model. Finally, this paper proposes a novel temporal link prediction method named TLP-CCC, which integrates collective influence, the community walk features, and the centrality features. Experimental results on nine real dynamic network data sets show that the proposed method performs better for area under curve (AUC) evaluation compared with the classical link prediction methods.<\/jats:p>","DOI":"10.3390\/e24020296","type":"journal-article","created":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T08:18:05Z","timestamp":1645431485000},"page":"296","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["TLP-CCC: Temporal Link Prediction Based on Collective Community and Centrality Feature Fusion"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1337-1612","authenticated-orcid":false,"given":"Yuhang","family":"Zhu","sequence":"first","affiliation":[{"name":"Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou 450002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuxin","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou 450002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingle","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou 450002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Information Technology, PLA Strategic Support Force Information Engineering University, Zhengzhou 450002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,2,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.comcom.2021.10.009","article-title":"Triad link prediction method based on the evolutionary analysis with IoT in opportunistic social networks","volume":"181","author":"Gou","year":"2022","journal-title":"Comput. Commun."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"102385","DOI":"10.1016\/j.scs.2020.102385","article-title":"Predictions of electricity consumption in a campus building using occupant rates and weather elements with sensitivity analysis: Artificial neural network vs. linear regression","volume":"62","author":"Kim","year":"2020","journal-title":"Sustain. Cit. Soc."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"105740","DOI":"10.1016\/j.knosys.2020.105740","article-title":"Link prediction of time-evolving network based on node ranking","volume":"195","author":"Wu","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s00354-019-00065-z","article-title":"Temporal link prediction: A survey","volume":"38","author":"Divakaran","year":"2020","journal-title":"New Gener. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Albert","year":"1999","journal-title":"Science"},{"key":"ref_6","first-page":"1","article-title":"A survey of link prediction in complex networks","volume":"49","author":"Berzal","year":"2016","journal-title":"ACM Comput. Surv."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","article-title":"Structural equivalence of individuals in social networks","volume":"1","author":"Lorrain","year":"1971","journal-title":"J. Math. Sociol."},{"key":"ref_8","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_9","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_10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","article-title":"A new status index derived from sociometric analysis","volume":"18","author":"Katz","year":"1953","journal-title":"Psychometrika"},{"key":"ref_11","unstructured":"Zhao, H., Du, L., and Buntine, W. (2017, January 6\u201311). Leveraging node attributes for incomplete relational data. Proceedings of the International Conference on Machine Learning, Sydney, Australia."},{"key":"ref_12","first-page":"70","article-title":"Link prediction method based on matching degree of resource transmission for complex network","volume":"41","author":"Shuxin","year":"2020","journal-title":"J. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Javari, A., Qiu, H., Barzegaran, E., Jalili, M., and Chang, K.C.C. (2017, January 18\u201321). Statistical link label modeling for sign prediction: Smoothing sparsity by joining local and global information. Proceedings of the 2017 IEEE International Conference on Data Mining (ICDM), Orleans, LA, USA.","DOI":"10.1109\/ICDM.2017.135"},{"key":"ref_14","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":"ref_15","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":"ref_16","first-page":"1","article-title":"GC-LSTM: Graph convolution embedded LSTM for dynamic network link prediction","volume":"52","author":"Chen","year":"2021","journal-title":"Appl. Intell."},{"key":"ref_17","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_18","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_19","first-page":"3674","article-title":"Time series link prediction method based on motif evolution and community consistency","volume":"36","author":"Liu","year":"2019","journal-title":"Appl. Res. Comput."},{"key":"ref_20","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_21","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_22","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"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature"},{"key":"ref_24","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_25","unstructured":"Goldberg, Y., and Levy, O. (2014). word2vec Explained: Deriving Mikolov et al.\u2019s negative-sampling word-embedding method. arXiv."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1007\/s10489-014-0631-0","article-title":"Link prediction in dynamic social networks by integrating different types of information","volume":"42","author":"Ibrahim","year":"2015","journal-title":"Appl. Intell."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Selvarajah, K., Ragunathan, K., Kobti, Z., and Kargar, M. (2020, January 19\u201324). Dynamic Network Link Prediction by Learning Effective Subgraphs using CNN-LSTM. Proceedings of the 2020 International Joint Conference on Neural Networks (IJCNN), Glasgow, UK.","DOI":"10.1109\/IJCNN48605.2020.9207301"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2-es","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: Densification and shrinking diameters","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","article-title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters","volume":"6","author":"Leskovec","year":"2009","journal-title":"Internet Math."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Viswanath, B., Mislove, A., Cha, M., and Gummadi, K.P. (2009, January 17). On the evolution of user interaction in facebook. Proceedings of the 2nd ACM Workshop on Online Social Networks, Barcelona, Spain.","DOI":"10.1145\/1592665.1592675"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Kunegis, J. (2013). KONECT\u2014The Koblenz Network Collection: Proceedings of the 22nd International Conference on World Wide Web Companion, Rio de Janeiro, Brazil, 13\u201317 May 2013, Association for Computing Machinery.","DOI":"10.1145\/2487788.2488173"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1002\/asi.21015","article-title":"Patterns and dynamics of users\u2019 behavior and interaction: Network analysis of an online community","volume":"60","author":"Panzarasa","year":"2009","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"ref_33","unstructured":"Leskovec, J., and Krevl, A. (2022, January 24). SNAP Datasets: Stanford Large Network Dataset Collection. Available online: https:\/\/snap.stanford.edu\/data."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., and Leskovec, J. (2017, January 6\u201310). Motifs in temporal networks. Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, Cambridge, UK.","DOI":"10.1145\/3018661.3018731"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10618-015-0407-0","article-title":"Link prediction using time series of neighborhood-based node similarity scores","volume":"30","year":"2016","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_36","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_37","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_38","doi-asserted-by":"crossref","unstructured":"Sankar, A., Wu, Y., Gou, L., Zhang, W., and Yang, H. (2020, January 3\u20137). Dysat: Deep neural representation learning on dynamic graphs via self-attention networks. Proceedings of the 13th International Conference on Web Search and Data Mining, Houston, TX, USA.","DOI":"10.1145\/3336191.3371845"},{"key":"ref_39","unstructured":"Li, J., Peng, J., Liu, S., Weng, L., and Li, C. (2020). TSAM: Temporal Link Prediction in Directed Networks based on Self-Attention Mechanism. arXiv."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Pareja, A., Domeniconi, G., Chen, J., Ma, T., Suzumura, T., Kanezashi, H., Kaler, T., Schardl, T., and Leiserson, C. (2020, January 7\u201312). Evolvegcn: Evolving graph convolutional networks for dynamic graphs. Proceedings of the AAAI Conference on Artificial Intelligence, New York, NY, USA.","DOI":"10.1609\/aaai.v34i04.5984"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/2\/296\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:23:23Z","timestamp":1760135003000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/2\/296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,20]]},"references-count":40,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,2]]}},"alternative-id":["e24020296"],"URL":"https:\/\/doi.org\/10.3390\/e24020296","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,2,20]]}}}