{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T15:48:40Z","timestamp":1780501720299,"version":"3.54.1"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Science"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1016\/j.jocs.2021.101493","type":"journal-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T13:24:49Z","timestamp":1637673889000},"page":"101493","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":28,"special_numbering":"C","title":["Features fusion based link prediction in dynamic neworks"],"prefix":"10.1016","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2117-8660","authenticated-orcid":false,"given":"Mukesh","family":"Kumar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6429-3063","authenticated-orcid":false,"given":"Shivansh","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bhaskar","family":"Biswas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jocs.2021.101493_b1","first-page":"1","article-title":"Temporal link prediction: a survey","author":"Divakaran","year":"2019","journal-title":"New Gener. Comput."},{"issue":"5","key":"10.1016\/j.jocs.2021.101493_b2","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 Emergent Distrib. Syst."},{"key":"10.1016\/j.jocs.2021.101493_b3","series-title":"Proceedings of the Twelfth International Conference on Information and Knowledge Management","first-page":"556","article-title":"The link prediction problem for social networks","author":"Liben-Nowell","year":"2003"},{"key":"10.1016\/j.jocs.2021.101493_b4","series-title":"Proceedings of the 3rd International Workshop on Link Discovery","first-page":"90","article-title":"Discovering missing links in wikipedia","author":"Adafre","year":"2005"},{"key":"10.1016\/j.jocs.2021.101493_b5","series-title":"Proceedings of the Thirteenth ACM Conference on Hypertext and Hypermedia","first-page":"169","article-title":"Using Markov models for web site link prediction","author":"Zhu","year":"2002"},{"key":"10.1016\/j.jocs.2021.101493_b6","series-title":"Proceedings of the 5th ACM\/IEEE-CS Joint Conference on Digital Libraries","first-page":"141","article-title":"Link prediction approach to collaborative filtering","author":"Huang","year":"2005"},{"key":"10.1016\/j.jocs.2021.101493_b7","unstructured":"E.M. Airoldi, D.M. Blei, S.E. Fienberg, E.P. Xing, T. Jaakkola, Mixed membership stochastic block models for relational data with application to protein-protein interactions, in: Proceedings of the International Biometrics Society Annual Meeting, Vol. 15, 2006."},{"key":"10.1016\/j.jocs.2021.101493_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113666","article-title":"Robust link prediction in criminal networks: A case study of the Sicilian Mafia","volume":"161","author":"Calderoni","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.jocs.2021.101493_b9","doi-asserted-by":"crossref","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":"Physica A"},{"key":"10.1016\/j.jocs.2021.101493_b10","doi-asserted-by":"crossref","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":"10.1016\/j.jocs.2021.101493_b11","series-title":"Proceedings of the 3rd International Workshop on Link Discovery","first-page":"36","article-title":"The political blogosphere and the 2004 U.S. election: Divided they blog","author":"Adamic","year":"2005"},{"key":"10.1016\/j.jocs.2021.101493_b12","first-page":"241","article-title":"Distribution de la flore alpine dans le bassin des Dranses et dans quelques r\u00e9gions voisines","volume":"37","author":"Jaccard","year":"1901","journal-title":"Bull. Soc. Vaudoise Sci. Nat."},{"issue":"3\u20134","key":"10.1016\/j.jocs.2021.101493_b13","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":"Barab\u00e2si","year":"2002","journal-title":"Physica A"},{"issue":"3","key":"10.1016\/j.jocs.2021.101493_b14","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":"10.1016\/j.jocs.2021.101493_b15","series-title":"The matrix-forest theorem and measuring relations in small social groups","author":"Chebotarev","year":"2006"},{"issue":"5","key":"10.1016\/j.jocs.2021.101493_b16","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":"Europhys. Lett."},{"key":"10.1016\/j.jocs.2021.101493_b17","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.80.046122","article-title":"Similarity index based on local paths for link prediction of complex networks","volume":"80","author":"L\u00fc","year":"2009","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.jocs.2021.101493_b18","article-title":"Network-based prediction of protein interactions","author":"Kov\u00e1cs","year":"2018","journal-title":"BioRxiv"},{"issue":"1","key":"10.1016\/j.jocs.2021.101493_b19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41467-019-09177-y","article-title":"Network-based prediction of protein interactions","volume":"10","author":"Kov\u00e1cs","year":"2019","journal-title":"Nature Commun."},{"key":"10.1016\/j.jocs.2021.101493_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.106168","article-title":"Supervised link prediction in multiplex networks","volume":"203","author":"Shan","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.jocs.2021.101493_b21","series-title":"SDM06: Workshop on Link Analysis, Counter-Terrorism and Security, Vol. 30","first-page":"798","article-title":"Link prediction using supervised learning","author":"Al\u00a0Hasan","year":"2006"},{"key":"10.1016\/j.jocs.2021.101493_b22","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":"10.1016\/j.jocs.2021.101493_b23","series-title":"2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","first-page":"1234","article-title":"Combining temporal aspects of dynamic networks with Node2Vec for a more efficient dynamic link prediction","author":"De\u00a0Winter","year":"2018"},{"issue":"16","key":"10.1016\/j.jocs.2021.101493_b24","doi-asserted-by":"crossref","first-page":"6652","DOI":"10.1016\/j.eswa.2013.06.016","article-title":"Proximity measures for link prediction based on temporal events","volume":"40","author":"Soares","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.jocs.2021.101493_b25","series-title":"Comparative Analysis of Artificial Neural Network and XGBoost Algorithm for PolSAR Image Classification","first-page":"452","author":"Memon","year":"2019"},{"issue":"6","key":"10.1016\/j.jocs.2021.101493_b26","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"},{"key":"10.1016\/j.jocs.2021.101493_b27","doi-asserted-by":"crossref","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":"10.1016\/j.jocs.2021.101493_b28","series-title":"Dynamic network embeddings for network evolution analysis","author":"Chen","year":"2019"},{"key":"10.1016\/j.jocs.2021.101493_b29","series-title":"Introduction to Modern Information Retrieval","author":"Salton","year":"1983"},{"key":"10.1016\/j.jocs.2021.101493_b30","article-title":"Network-based prediction of protein interactions","author":"Kov\u00e1cs","year":"2018","journal-title":"BioRxiv"},{"key":"10.1016\/j.jocs.2021.101493_b31","series-title":"Deep Learning for Medical Image Analysis","first-page":"3","article-title":"Chapter 1 - An introduction to neural networks and deep learning","author":"Suk","year":"2017"},{"key":"10.1016\/j.jocs.2021.101493_b32","series-title":"Neural Networks and Deep Learning, Vol. 25","author":"Nielsen","year":"2015"},{"key":"10.1016\/j.jocs.2021.101493_b33","series-title":"Activation functions: Comparison of trends in practice and research for deep learning","author":"Nwankpa","year":"2018"},{"key":"10.1016\/j.jocs.2021.101493_b34","series-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"785","article-title":"XGBoost: A scalable tree boosting system","author":"Chen","year":"2016"},{"issue":"6","key":"10.1016\/j.jocs.2021.101493_b35","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":"Physica A"},{"issue":"4","key":"10.1016\/j.jocs.2021.101493_b36","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"},{"issue":"5","key":"10.1016\/j.jocs.2021.101493_b37","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1016\/S0893-6080(03)00104-7","article-title":"Extension neural network and its applications","volume":"16","author":"Wang","year":"2003","journal-title":"Neural Netw."},{"key":"10.1016\/j.jocs.2021.101493_b38","series-title":"Proceedings of the 23rd International Conference on Machine Learning","first-page":"233","article-title":"The relationship between precision-recall and ROC curves","author":"Davis","year":"2006"},{"key":"10.1016\/j.jocs.2021.101493_b39","first-page":"345","article-title":"A probabilistic interpretation of precision, recall and F-score, with implication for evaluation","volume":"3408","author":"Goutte","year":"2005"},{"key":"10.1016\/j.jocs.2021.101493_b40","series-title":"Pattern Recognition and Image Analysis","first-page":"441","article-title":"Index of balanced accuracy: A performance measure for skewed class distributions","author":"Garc\u00eda","year":"2009"},{"issue":"1","key":"10.1016\/j.jocs.2021.101493_b41","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","article-title":"The meaning and use of the area under a receiver operating characteristic (ROC) curve.","volume":"143","author":"Hanley","year":"1982","journal-title":"Radiology"},{"issue":"8","key":"10.1016\/j.jocs.2021.101493_b42","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":"10.1016\/j.jocs.2021.101493_b43","series-title":"Introduction to Information Retrieval","author":"Schutze","year":"2008"},{"key":"10.1016\/j.jocs.2021.101493_b44","series-title":"SNAP datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"10.1016\/j.jocs.2021.101493_b45","series-title":"AAAI","article-title":"The network data repository with interactive graph analytics and visualization","author":"Rossi","year":"2015"},{"key":"10.1016\/j.jocs.2021.101493_b46","series-title":"Reality mining network dataset \u2013 KONECT","author":"Kunegis","year":"2017"},{"key":"10.1016\/j.jocs.2021.101493_b47","series-title":"Lecture Notes in Business Information Processing, Vol. 87","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/978-3-642-21863-7_17","article-title":"Matching organizational structure and social network extracted from email communication","author":"Michalski","year":"2011"},{"key":"10.1016\/j.jocs.2021.101493_b48","series-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"}],"container-title":["Journal of Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877750321001587?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877750321001587?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T05:16:59Z","timestamp":1761801419000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877750321001587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":48,"alternative-id":["S1877750321001587"],"URL":"https:\/\/doi.org\/10.1016\/j.jocs.2021.101493","relation":{},"ISSN":["1877-7503"],"issn-type":[{"value":"1877-7503","type":"print"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Features fusion based link prediction in dynamic neworks","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jocs.2021.101493","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"101493"}}