{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:31:25Z","timestamp":1760401885027,"version":"build-2065373602"},"reference-count":55,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,1,5]],"date-time":"2020-01-05T00:00:00Z","timestamp":1578182400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"publisher","award":["20170540320"],"award-info":[{"award-number":["20170540320"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473073"],"award-info":[{"award-number":["61473073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Doctoral Scientific Research Foundation of Liaoning Province","award":["20170520358"],"award-info":[{"award-number":["20170520358"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["N161702001;N172410005-2"],"award-info":[{"award-number":["N161702001;N172410005-2"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Social network analysis is a multidisciplinary study covering informatics, mathematics, sociology, management, psychology, etc. Link prediction, as one of the fundamental studies with a variety of applications, has attracted increasing focus from scientific society. Traditional research based on graph theory has made numerous achievements, whereas suffering from incapability of dealing with dynamic behaviors and low predicting accuracy. Aiming at addressing the problem, this paper employs a diagonally symmetrical supra-adjacency matrix to represent the dynamic social networks, and proposes a temporal links prediction framework combining with an improved gravity model. Extensive experiments on several real-world datasets verified the superiority on competitors, which benefits recommending friends in social networks. It is of remarkable significance in revealing the evolutions in temporal networks and promoting considerable commercial interest for social applications.<\/jats:p>","DOI":"10.3390\/sym12010100","type":"journal-article","created":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T03:48:48Z","timestamp":1578282528000},"page":"100","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Feasible Temporal Links Prediction Framework Combining with Improved Gravity Model"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6446-8612","authenticated-orcid":false,"given":"Xinyu","family":"Huang","sequence":"first","affiliation":[{"name":"Software College, Northeastern University, Shenyang 110169, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongming","family":"Chen","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang 110169, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Ren","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang 110169, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,1,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1108\/JKM-11-2016-0504","article-title":"It is rotating leaders who build the swarm: Social network determinants of growth for healthcare virtual communities of practice","volume":"21","author":"Antonacci","year":"2017","journal-title":"J. Knowl. Manag."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11280-017-0463-z","article-title":"Temporal link prediction in multi-relational network","volume":"21","author":"Sett","year":"2018","journal-title":"World Wide Web"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1117454.1117456","article-title":"Link mining: A survey","volume":"7","author":"Getoor","year":"2005","journal-title":"ACM SIGKDD Explor. Newslett."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Srinivas, V., and Mitra, P. (2016). Link Prediction Using Thresholding Nodes Based on Their Degree. Link Prediction in Social Networks, Springer.","DOI":"10.1007\/978-3-319-28922-9"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Oyama, S., Hayashi, K., and Kashima, H. (2011, January 11\u201314). Cross-temporal link prediction. Proceedings of the 2011 IEEE 11th International Conference on Data Mining, Vancouver, BC, Canada.","DOI":"10.1109\/ICDM.2011.45"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Slokom, M., and Ayachi, R. (2017, January 17\u201319). A New Social Recommender System Based on Link Prediction Across Heterogeneous Networks. Proceedings of the International Conference on Intelligent Decision Technologies, Sorrento, Italy.","DOI":"10.1007\/978-3-319-59424-8_31"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"617","DOI":"10.3982\/QE545","article-title":"The identification power of smoothness assumptions in models with counterfactual outcomes","volume":"9","author":"Kim","year":"2018","journal-title":"Quantit. Econ."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Kleinberg","year":"2007","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"ref_10","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. Appl."},{"key":"ref_11","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":"EPL (Europhys. Lett.)"},{"key":"ref_12","unstructured":"Munasinghe, L., and Ichise, R. (September, January 29). Time aware index for link prediction in social networks. Proceedings of the International Conference on Data Warehousing and Knowledge Discovery, Toulouse, France."},{"key":"ref_13","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":"Phys. A Stat. Mech. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","article-title":"Temporal graphs","volume":"388","author":"Kostakos","year":"2009","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Alhajj, R., and Rokne, J. (2014). Encyclopedia of Social Network Analysis and Mining, Springer.","DOI":"10.1007\/978-1-4614-6170-8"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/17445760.2012.668546","article-title":"Time-varying graphs and dynamic networks","volume":"27","author":"Casteigts","year":"2012","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Hua, T.D., Nguyen-Thi, A.T., and Nguyen, T.A.H. (2017, January 24\u201325). Link prediction in weighted network based on reliable routes by machine learning approach. Proceedings of the 2017 4th NAFOSTED Conference on Information and Computer Science, Hanoi, Vietnam.","DOI":"10.1109\/NAFOSTED.2017.8108070"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s11425-015-0807-8","article-title":"A dynamic logistic regression for network link prediction","volume":"60","author":"Zhou","year":"2017","journal-title":"Sci. China Math."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1007\/s10994-019-05792-4","article-title":"RankMerging: A supervised learning-to-rank framework to predict links in large social networks","volume":"108","author":"Tabourier","year":"2019","journal-title":"Mach. Learn."},{"key":"ref_20","unstructured":"Hyndman, R.J., and Athanasopoulos, G. (2018). Forecasting: Principles and Practice, OTexts."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Hyndman, R., Koehler, A.B., Ord, J.K., and Snyder, R.D. (2008). Forecasting with Exponential Smoothing: The State Space Approach, Springer Science & Business Media.","DOI":"10.1007\/978-3-540-71918-2"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Divakaran, A., and Mohan, A. (2019). Temporal Link Prediction: A Survey. New Gener. Comput.","DOI":"10.1007\/s00354-019-00065-z"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, A., and \u00d6\u011f\u00fcd\u00fcc\u00fc, \u015e.G. (July, January 28). Multivariate temporal link prediction in evolving social networks. Proceedings of the 2015 IEEE\/ACIS 14th International Conference on Computer and Information Science (ICIS), Las Vegas, NV, USA.","DOI":"10.1109\/ICIS.2015.7166591"},{"key":"ref_24","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. Soc."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1080\/00048623.2010.10721488","article-title":"Introduction to modern information retrieval","volume":"41","author":"Worth","year":"2010","journal-title":"Aust. Acad. Res. Libr."},{"key":"ref_26","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura","volume":"37","author":"Jaccard","year":"1901","journal-title":"Bull. Soc. Vaudoise Sci. Nat."},{"key":"ref_27","first-page":"1","article-title":"A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons","volume":"5","author":"Sorensen","year":"1948","journal-title":"Biol. Skar."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1126\/science.1073374","article-title":"Hierarchical organization of modularity in metabolic networks","volume":"297","author":"Ravasz","year":"2002","journal-title":"Science"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/rsa.3240060204","article-title":"A critical point for random graphs with a given degree sequence","volume":"6","author":"Molloy","year":"1995","journal-title":"Random Struct. Algorithms"},{"key":"ref_30","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_31","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_32","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_33","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_34","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_35","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":"Phys. Rev. E"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"58007","DOI":"10.1209\/0295-5075\/89\/58007","article-title":"Link prediction based on local random walk","volume":"89","author":"Liu","year":"2010","journal-title":"EPL (Europhys. Lett.)"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"016105","DOI":"10.1103\/PhysRevE.74.016105","article-title":"Network community structure and loop coefficient method","volume":"74","author":"Louis","year":"2006","journal-title":"Phys. Rev. E"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01164627","article-title":"Resistance distance","volume":"12","author":"Klein","year":"1993","journal-title":"J. Math. Chem."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Jeh, G., and Widom, J. (2002, January 23\u201326). SimRank: A measure of structural-context similarity. Proceedings of the eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, AB, Canada.","DOI":"10.1145\/775047.775126"},{"key":"ref_40","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_41","doi-asserted-by":"crossref","first-page":"017101","DOI":"10.1103\/PhysRevE.80.017101","article-title":"Information filtering based on transferring similarity","volume":"80","author":"Sun","year":"2009","journal-title":"Phys. Rev. E"},{"key":"ref_42","first-page":"125","article-title":"A matrix-forest theorem and measuring relations in small social group","volume":"58","author":"Chebotarev","year":"1997","journal-title":"Avtomatika i Telemekhanika"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","article-title":"The structure and dynamics of multilayer networks","volume":"544","author":"Boccaletti","year":"2014","journal-title":"Phys. Rep."},{"key":"ref_44","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_45","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","article-title":"An introduction to ROC analysis","volume":"27","author":"Fawcett","year":"2006","journal-title":"Pattern Recognit. Lett."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"8387","DOI":"10.1038\/s41598-019-44930-9","article-title":"Identifying influential spreaders by gravity model","volume":"9","author":"Li","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_47","unstructured":"Chen, D., Kong, L., Wang, D., Huang, X., and Fang, B. (2018). TNLCD: A Feasible Algorithm for Local Community Discovery in Temporal Networks. FSDM, IOS Press."},{"key":"ref_48","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_49","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","article-title":"The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations","volume":"54","author":"Lusseau","year":"2003","journal-title":"Behav. Ecol. Sociobiol."},{"key":"ref_51","unstructured":"Tsvetovat, M., and Kouznetsov, A. (2011). Social Network Analysis for Startups: Finding Connections on the Social Web, O\u2019Reilly Media, Inc."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"8577","DOI":"10.1073\/pnas.0601602103","article-title":"Modularity and community structure in networks","volume":"103","author":"Newman","year":"2006","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"3769","DOI":"10.1016\/j.physa.2008.01.113","article-title":"Unified index to quantifying heterogeneity of complex networks","volume":"387","author":"Hu","year":"2008","journal-title":"Phys. A Stat. Mech. Appl."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/1\/100\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:18:53Z","timestamp":1760361533000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/1\/100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,5]]},"references-count":55,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["sym12010100"],"URL":"https:\/\/doi.org\/10.3390\/sym12010100","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2020,1,5]]}}}