{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T19:32:19Z","timestamp":1774726339990,"version":"3.50.1"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["N0.62366030"],"award-info":[{"award-number":["N0.62366030"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 62062010"],"award-info":[{"award-number":["No. 62062010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Planning Project of Guangxi","award":["No. AD19245101"],"award-info":[{"award-number":["No. AD19245101"]}]},{"name":"the Higher Education Innovation Fund project of Gansu","award":["No. 2022A-022"],"award-info":[{"award-number":["No. 2022A-022"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10489-023-05211-1","type":"journal-article","created":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T01:02:00Z","timestamp":1702602120000},"page":"592-613","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Deep non-negative matrix factorization with edge generator for link prediction in complex networks"],"prefix":"10.1007","volume":"54","author":[{"given":"Yabing","family":"Yao","sequence":"first","affiliation":[]},{"given":"Yangyang","family":"He","sequence":"additional","affiliation":[]},{"given":"Zhentian","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zhipeng","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"5211_CR1","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1016\/j.physa.2019.04.246","volume":"523","author":"A Wahid-Ul-Ashraf","year":"2019","unstructured":"Wahid-Ul-Ashraf A, Budka M, Musial K (2019) How to predict social relationships-physics-inspired approach to link prediction. Physica A 523:1110\u20131129","journal-title":"Physica A"},{"key":"5211_CR2","doi-asserted-by":"crossref","first-page":"128428","DOI":"10.1016\/j.physa.2022.128428","volume":"610","author":"Y Yao","year":"2023","unstructured":"Yao Y, Cheng T, Li X, He Y, Yang F, Li T, Liu Z, Xu Z (2023) Link prediction based on the mutual information with high-order clustering structure of nodes in complex networks. Physica A 610:128428","journal-title":"Physica A"},{"issue":"11","key":"5211_CR3","doi-asserted-by":"crossref","first-page":"103217","DOI":"10.1016\/j.isci.2021.103217","volume":"24","author":"T Zhou","year":"2021","unstructured":"Zhou T (2021) Progresses and challenges in link prediction. Iscience 24(11):103217","journal-title":"Iscience"},{"issue":"6","key":"5211_CR4","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: A survey. Physica A 390(6):1150\u20131170","journal-title":"Physica A"},{"key":"5211_CR5","doi-asserted-by":"crossref","first-page":"112839","DOI":"10.1016\/j.eswa.2019.112839","volume":"139","author":"S Li","year":"2020","unstructured":"Li S, Song X, Lu H, Zeng L, Shi M, Liu F (2020) Friend recommendation for cross marketing in online brand community based on intelligent attention allocation link prediction algorithm. Expert Syst Appl 139:112839","journal-title":"Expert Syst Appl"},{"key":"5211_CR6","doi-asserted-by":"crossref","first-page":"125154","DOI":"10.1016\/j.physa.2020.125154","volume":"560","author":"Z Su","year":"2020","unstructured":"Su Z, Zheng X, Ai J, Shen Y, Zhang X (2020) Link prediction in recommender systems based on vector similarity. Physica A 560:125154","journal-title":"Physica A"},{"issue":"1","key":"5211_CR7","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/j.aej.2021.04.081","volume":"61","author":"G Liu","year":"2022","unstructured":"Liu G (2022) An ecommerce recommendation algorithm based on link prediction. Alex Eng J 61(1):905\u2013910","journal-title":"Alex Eng J"},{"key":"5211_CR8","doi-asserted-by":"crossref","first-page":"104772","DOI":"10.1016\/j.compbiomed.2021.104772","volume":"137","author":"E Nasiri","year":"2021","unstructured":"Nasiri E, Berahmand K, Rostami M, Dabiri M (2021) A novel link prediction algorithm for protein-protein interaction networks by attributed graph embedding. Comput Biol Med 137:104772","journal-title":"Comput Biol Med"},{"key":"5211_CR9","doi-asserted-by":"crossref","unstructured":"Li Z, Zhu S, Shao B, Zeng X, Wang T, Liu T-Y (2023) Dsn-ddi: an accurate and generalized framework for drug\u2013drug interaction prediction by dual-view representation learning. Briefings in Bioinformatics 24(1)","DOI":"10.1093\/bib\/bbac597"},{"key":"5211_CR10","doi-asserted-by":"crossref","first-page":"124289","DOI":"10.1016\/j.physa.2020.124289","volume":"553","author":"A Kumar","year":"2020","unstructured":"Kumar A, Singh SS, Singh K, Biswas B (2020) Link prediction techniques, applications, and performance: A survey. Physica A 553:124289","journal-title":"Physica A"},{"key":"5211_CR11","doi-asserted-by":"crossref","first-page":"115991","DOI":"10.1016\/j.eswa.2021.115991","volume":"188","author":"G Chen","year":"2022","unstructured":"Chen G, Wang H, Fang Y, Jiang L (2022) Link prediction by deep non-negative matrix factorization. Expert Syst Appl 188:115991","journal-title":"Expert Syst Appl"},{"key":"5211_CR12","doi-asserted-by":"crossref","first-page":"102716","DOI":"10.1016\/j.jnca.2020.102716","volume":"166","author":"NN Daud","year":"2020","unstructured":"Daud NN, Ab Hamid SH, Saadoon M, Sahran F, Anuar NB (2020) Applications of link prediction in social networks: A review. J Netw Comput Appl 166:102716","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"5211_CR13","doi-asserted-by":"crossref","first-page":"025102","DOI":"10.1103\/PhysRevE.64.025102","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman ME (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64(2):025102","journal-title":"Phys Rev E"},{"issue":"3","key":"5211_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Social networks 25(3):211\u2013230","journal-title":"Social networks"},{"key":"5211_CR15","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.physa.2017.02.078","volume":"479","author":"S Liu","year":"2017","unstructured":"Liu S, Ji X, Liu C, Bai Y (2017) Extended resource allocation index for link prediction of complex network. Physica A 479:174\u2013183","journal-title":"Physica A"},{"key":"5211_CR16","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.compbiomed.2018.09.019","volume":"102","author":"H Vural","year":"2018","unstructured":"Vural H, Kaya M (2018) Prediction of new potential associations between lncrnas and environmental factors based on katz measure. Comput Biol Med 102:120\u2013125","journal-title":"Comput Biol Med"},{"issue":"5","key":"5211_CR17","doi-asserted-by":"crossref","first-page":"58007","DOI":"10.1209\/0295-5075\/89\/58007","volume":"89","author":"W Liu","year":"2010","unstructured":"Liu W, L\u00fc L (2010) Link prediction based on local random walk. Europhys Lett 89(5):58007","journal-title":"Europhys Lett"},{"key":"5211_CR18","doi-asserted-by":"crossref","first-page":"125783","DOI":"10.1016\/j.physa.2021.125783","volume":"570","author":"Y Zhou","year":"2021","unstructured":"Zhou Y, Wu C, Tan L (2021) Biased random walk with restart for link prediction with graph embedding method. Physica A 570:125783","journal-title":"Physica A"},{"key":"5211_CR19","doi-asserted-by":"crossref","first-page":"124980","DOI":"10.1016\/j.physa.2020.124980","volume":"557","author":"F Aziz","year":"2020","unstructured":"Aziz F, Gul H, Muhammad I, Uddin I (2020) Link prediction using node information on local paths. Physica A 557:124980","journal-title":"Physica A"},{"key":"5211_CR20","doi-asserted-by":"crossref","first-page":"122950","DOI":"10.1016\/j.physa.2019.122950","volume":"539","author":"S Rafiee","year":"2020","unstructured":"Rafiee S, Salavati C, Abdollahpouri A (2020) Cndp: Link prediction based on common neighbors degree penalization. Physica A 539:122950","journal-title":"Physica A"},{"issue":"7191","key":"5211_CR21","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A Clauset","year":"2008","unstructured":"Clauset A, Moore C, Newman ME (2008) Hierarchical structure and the prediction of missing links in networks. Nature 453(7191):98\u2013101","journal-title":"Nature"},{"issue":"52","key":"5211_CR22","doi-asserted-by":"crossref","first-page":"22073","DOI":"10.1073\/pnas.0908366106","volume":"106","author":"R Guimer\u00e0","year":"2009","unstructured":"Guimer\u00e0 R, Sales-Pardo M (2009) Missing and spurious interactions and the reconstruction of complex networks. Proc Natl Acad Sci 106(52):22073\u201322078","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"5211_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3491206","volume":"55","author":"J Zhou","year":"2022","unstructured":"Zhou J, Liu L, Wei W, Fan J (2022) Network representation learning: from preprocessing, feature extraction to node embedding. ACM Computing Surveys (CSUR) 55(2):1\u201335","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"5211_CR24","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"5211_CR25","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International conference on knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"5211_CR26","doi-asserted-by":"crossref","unstructured":"Lei K, Qin M, Bai B, Zhang G, Yang M (2019) Gcn-gan: A non-linear temporal link prediction model for weighted dynamic networks. In: IEEE INFOCOM 2019-IEEE conference on computer communications, IEEE pp 388\u2013396","DOI":"10.1109\/INFOCOM.2019.8737631"},{"key":"5211_CR27","doi-asserted-by":"crossref","unstructured":"Hao Y, Cao X, Fang Y, Xie X, Wang S (2021) Inductive link prediction for nodes having only attribute information. In: Proceedings of the twenty-ninth international conference on international joint conferences on artificial intelligence, pp 1209\u20131215","DOI":"10.24963\/ijcai.2020\/168"},{"key":"5211_CR28","first-page":"805","volume":"2023","author":"AE Samy","year":"2023","unstructured":"Samy AE, Kefato TZ, Girdzijauskas S (2023) Graph2feat: Inductive link prediction via knowledge distillation. Companion Proceedings of the ACM Web Conference 2023:805\u2013812","journal-title":"Companion Proceedings of the ACM Web Conference"},{"key":"5211_CR29","doi-asserted-by":"crossref","unstructured":"Wu E, Cui H, Chen Z (2022) Relpnet: Relation-based link prediction neural network. In: Proceedings of the 31st ACM International conference on information & knowledge management, pp 2138\u20132147","DOI":"10.1145\/3511808.3557430"},{"key":"5211_CR30","unstructured":"Guo Z, Shiao W, Zhang S, Liu Y, Chawla NV, Shah N, Zhao T (2023) Linkless link prediction via relational distillation. In: International conference on machine learning, PMLR pp 12012\u201312033"},{"key":"5211_CR31","doi-asserted-by":"crossref","first-page":"116033","DOI":"10.1016\/j.eswa.2021.116033","volume":"188","author":"Z Zhao","year":"2022","unstructured":"Zhao Z, Gou Z, Du Y, Ma J, Li T, Zhang R (2022) A novel link prediction algorithm based on inductive matrix completion. Expert Syst Appl 188:116033","journal-title":"Expert Syst Appl"},{"issue":"1","key":"5211_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-016-0001-8","volume":"6","author":"W Wang","year":"2016","unstructured":"Wang W, Cai F, Jiao P, Pan L (2016) A perturbation-based framework for link prediction via non-negative matrix factorization. Sci Rep 6(1):1\u201311","journal-title":"Sci Rep"},{"key":"5211_CR33","doi-asserted-by":"crossref","first-page":"122882","DOI":"10.1016\/j.physa.2019.122882","volume":"539","author":"G Chen","year":"2020","unstructured":"Chen G, Xu C, Wang J, Feng J, Feng J (2020) Robust non-negative matrix factorization for link prediction in complex networks using manifold regularization and sparse learning. Physica A 539:122882","journal-title":"Physica A"},{"key":"5211_CR34","doi-asserted-by":"crossref","unstructured":"Lei K, Qin M, Bai B, Zhang G (2018) Adaptive multiple non-negative matrix factorization for temporal link prediction in dynamic networks. In: Proceedings of the 2018 workshop on network meets AI & ML, pp 28\u201334","DOI":"10.1145\/3229543.3229546"},{"issue":"6","key":"5211_CR35","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1109\/TPAMI.2019.2962679","volume":"43","author":"Y Zhao","year":"2019","unstructured":"Zhao Y, Wang H, Pei J (2019) Deep non-negative matrix factorization architecture based on underlying basis images learning. IEEE Trans Pattern Anal Mach Intell 43(6):1897\u20131913","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5211_CR36","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.neucom.2021.08.152","volume":"491","author":"W-S Chen","year":"2022","unstructured":"Chen W-S, Zeng Q, Pan B (2022) A survey of deep nonnegative matrix factorization. Neurocomputing 491:305\u2013320","journal-title":"Neurocomputing"},{"key":"5211_CR37","doi-asserted-by":"crossref","unstructured":"Ye F, Chen C, Zheng Z (2018) Deep autoencoder-like nonnegative matrix factorization for community detection. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 1393\u20131402","DOI":"10.1145\/3269206.3271697"},{"key":"5211_CR38","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.neucom.2019.01.028","volume":"334","author":"W Zhang","year":"2019","unstructured":"Zhang W, Zhang X, Wang H, Chen D (2019) A deep variational matrix factorization method for recommendation on large scale sparse dataset. Neurocomputing 334:206\u2013218","journal-title":"Neurocomputing"},{"key":"5211_CR39","doi-asserted-by":"crossref","unstructured":"He X, Liao L, Zhang H, Nie L, Hu X, Chua T-S (2017) Neural collaborative filtering. In: Proceedings of the 26th international conference on World Wide Web, pp 173\u2013182","DOI":"10.1145\/3038912.3052569"},{"key":"5211_CR40","doi-asserted-by":"crossref","unstructured":"Luo L, Xie H, Rao Y, Wang FL (2019) Personalized recommendation by matrix co-factorization with tags and time information. expert systems with applications 119:311\u2013321","DOI":"10.1016\/j.eswa.2018.11.003"},{"key":"5211_CR41","doi-asserted-by":"crossref","unstructured":"Bhowmick AK, Meneni K, Danisch M, Guillaume J-L, Mitra B (2020) Louvainne: Hierarchical louvain method for high quality and scalable network embedding. In: Proceedings of the 13th international conference on web search and data mining, pp 43\u201351","DOI":"10.1145\/3336191.3371800"},{"key":"5211_CR42","doi-asserted-by":"crossref","unstructured":"Zhao S, Du Z, Chen J, Zhang Y, Tang J, Yu P (2021) Hierarchical representation learning for attributed networks. IEEE Transactions on Knowledge and Data Engineering","DOI":"10.1109\/TKDE.2021.3117274"},{"key":"5211_CR43","doi-asserted-by":"crossref","unstructured":"Wang Y, Zhao Y (2023) Arbitrary spatial trajectory reconstruction based on a single inertial sensor. IEEE Sensors Journal","DOI":"10.1109\/JSEN.2023.3257867"},{"issue":"2","key":"5211_CR44","doi-asserted-by":"crossref","first-page":"2627","DOI":"10.1109\/TPAMI.2022.3169734","volume":"45","author":"Z Zhu","year":"2022","unstructured":"Zhu Z, Huang G, Deng J, Ye Y, Huang J, Chen X, Zhu J, Yang T, Du D, Lu J et al (2022) Webface260m: A benchmark for million-scale deep face recognition. IEEE Trans Pattern Anal Mach Intell 45(2):2627\u20132644","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5211_CR45","doi-asserted-by":"crossref","first-page":"128546","DOI":"10.1016\/j.physa.2023.128546","volume":"616","author":"H Yuliansyah","year":"2023","unstructured":"Yuliansyah H, Othman Z, Bakar AA (2023) A new link prediction method to alleviate the cold-start problem based on extending common neighbor and degree centrality. Physica A 616:128546","journal-title":"Physica A"},{"issue":"1","key":"5211_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41109-019-0170-z","volume":"4","author":"N Stanley","year":"2019","unstructured":"Stanley N, Bonacci T, Kwitt R, Niethammer M, Mucha PJ (2019) Stochastic block models with multiple continuous attributes. Applied Netw Sci 4(1):1\u201322","journal-title":"Applied Netw Sci"},{"issue":"2","key":"5211_CR47","doi-asserted-by":"crossref","first-page":"024301","DOI":"10.1103\/PhysRevE.104.024301","volume":"104","author":"J Kuang","year":"2021","unstructured":"Kuang J, Scoglio C (2021) Layer reconstruction and missing link prediction of a multilayer network with maximum a posteriori estimation. Phys Rev E 104(2):024301","journal-title":"Phys Rev E"},{"key":"5211_CR48","unstructured":"Zhao H, Du L, Buntine W (2017) Leveraging node attributes for incomplete relational data. In: International Conference on Machine Learning, PMLR pp 4072\u20134081"},{"key":"5211_CR49","doi-asserted-by":"crossref","first-page":"357","DOI":"10.7717\/peerj-cs.357","volume":"7","author":"I Makarov","year":"2021","unstructured":"Makarov I, Kiselev D, Nikitinsky N, Subelj L (2021) Survey on graph embeddings and their applications to machine learning problems on graphs. PeerJ Comput Sci 7:357","journal-title":"PeerJ Comput Sci"},{"issue":"9","key":"5211_CR50","first-page":"1","volume":"55","author":"P Liu","year":"2023","unstructured":"Liu P, Yuan W, Fu J, Jiang Z, Hayashi H, Neubig G (2023) Pre-train, prompt, and predict: A systematic survey of prompting methods in natural language processing. ACM Comput Surv 55(9):1\u201335","journal-title":"ACM Comput Surv"},{"key":"5211_CR51","doi-asserted-by":"crossref","unstructured":"Zhang M, Chen Y (2017) Weisfeiler-lehman neural machine for link prediction. In: Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 575\u2013583","DOI":"10.1145\/3097983.3097996"},{"key":"5211_CR52","unstructured":"Zhang M, Chen Y (2018) Link prediction based on graph neural networks. Advances in neural information processing systems 31"},{"issue":"8","key":"5211_CR53","doi-asserted-by":"crossref","first-page":"3653","DOI":"10.1109\/TNNLS.2020.3015896","volume":"32","author":"Z Wang","year":"2020","unstructured":"Wang Z, Lei Y, Li W (2020) Neighborhood attention networks with adversarial learning for link prediction. IEEE Trans Neural Netw Learn Syst 32(8):3653\u20133663","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"5211_CR54","doi-asserted-by":"crossref","first-page":"107431","DOI":"10.1016\/j.knosys.2021.107431","volume":"232","author":"Z Wang","year":"2021","unstructured":"Wang Z, Li W, Su H (2021) Hierarchical attention link prediction neural network. Knowl-Based Syst 232:107431","journal-title":"Knowl-Based Syst"},{"key":"5211_CR55","doi-asserted-by":"crossref","unstructured":"Qin M, Zhang C, Bai B, Zhang G, Yeung D-Y (2023) High-quality temporal link prediction for weighted dynamic graphs via inductive embedding aggregation. IEEE Transactions on Knowledge and Data Engineering","DOI":"10.1109\/TKDE.2023.3238360"},{"issue":"8","key":"5211_CR56","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30\u201337","journal-title":"Computer"},{"issue":"1","key":"5211_CR57","doi-asserted-by":"crossref","first-page":"19","DOI":"10.26599\/BDMA.2017.9020002","volume":"1","author":"NM Ahmed","year":"2018","unstructured":"Ahmed NM, Chen L, Wang Y, Li B, Li Y, Liu W (2018) Deepeye: link prediction in dynamic networks based on non-negative matrix factorization. Big Data Mining and Analytics 1(1):19\u201333","journal-title":"Big Data Mining and Analytics"},{"key":"5211_CR58","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1609\/icwsm.v15i1.18067","volume":"15","author":"J Liang","year":"2021","unstructured":"Liang J, Gurukar S, Parthasarathy S (2021) Mile: A multi-level framework for scalable graph embedding. Proceedings of the International AAAI Conference on Web and Social Media 15:361-372","journal-title":"Proceedings of the International AAAI Conference on Web and Social Media"},{"key":"5211_CR59","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.patcog.2019.01.016","volume":"91","author":"Z Chen","year":"2019","unstructured":"Chen Z, Shi Y, Qi Z (2019) Constrained matrix factorization for semi-weakly learning with label proportions. Pattern Recogn 91:13\u201324","journal-title":"Pattern Recogn"},{"key":"5211_CR60","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.neuroimage.2018.03.007","volume":"173","author":"DP Varikuti","year":"2018","unstructured":"Varikuti DP, Genon S, Sotiras A, Schwender H, Hoffstaedter F, Patil KR, Jockwitz C, Caspers S, Moebus S, Amunts K et al (2018) Evaluation of non-negative matrix factorization of grey matter in age prediction. Neuroimage 173:394\u2013410","journal-title":"Neuroimage"},{"issue":"1","key":"5211_CR61","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1148\/radiology.143.1.7063747","volume":"143","author":"JA Hanley","year":"1982","unstructured":"Hanley JA, McNeil BJ (1982) The meaning and use of the area under a receiver operating characteristic (roc) curve. Radiology 143(1):29\u201336","journal-title":"Radiology"},{"issue":"1","key":"5211_CR62","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/963770.963772","volume":"22","author":"JL Herlocker","year":"2004","unstructured":"Herlocker JL, Konstan JA, Terveen LG, Riedl JT (2004) Evaluating collaborative filtering recommender systems. ACM Trans Inform Syst (TOIS) 22(1):5\u201353","journal-title":"ACM Trans Inform Syst (TOIS)"},{"key":"5211_CR63","doi-asserted-by":"crossref","unstructured":"Batagelj V, Mrvar, A (2014) Pajek","DOI":"10.1007\/978-1-4614-6170-8_310"},{"key":"5211_CR64","doi-asserted-by":"crossref","unstructured":"De\u00a0Winter S, Decuypere T, Mitrovi\u0107 S, Baesens B, De\u00a0Weerdt J (2018) Combining temporal aspects of dynamic networks with node2vec for a more efficient dynamic link prediction. In: 2018 IEEE\/ACM International conference on advances in social networks analysis and mining (ASONAM), IEEE pp 1234\u20131241","DOI":"10.1109\/ASONAM.2018.8508272"},{"issue":"1165","key":"5211_CR65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1098\/rstb.1986.0056","volume":"314","author":"JG White","year":"1986","unstructured":"White JG, Southgate E, Thomson JN, Brenner S et al (1986) The structure of the nervous system of the nematode caenorhabditis elegans. Philos Trans R Soc Lond B Biol Sci 314(1165):1-340","journal-title":"Philos Trans R Soc Lond B Biol Sci"},{"key":"5211_CR66","doi-asserted-by":"crossref","unstructured":"Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Proceedings of the AAAI conference on artificial intelligence, vol 29","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"5211_CR67","doi-asserted-by":"crossref","unstructured":"Adamic LA, Glance N (2005) The political blogosphere and the 2004 us election: divided they blog. In: Proceedings of the 3rd international workshop on link discovery, pp 36\u201343","DOI":"10.1145\/1134271.1134277"},{"key":"5211_CR68","doi-asserted-by":"crossref","unstructured":"Jorgensen Z, Yu T, Cormode G (2016) Publishing attributed social graphs with formal privacy guarantees. In: Proceedings of the 2016 international conference on management of data, pp 107\u2013122","DOI":"10.1145\/2882903.2915215"},{"key":"5211_CR69","doi-asserted-by":"crossref","unstructured":"Spring N, Mahajan R, Wetherall D (2002) Measuring isp topologies with rocketfuel. ACM SIGCOMM Comput Commun Rev 32(4):133\u2013145","DOI":"10.1145\/964725.633039"},{"key":"5211_CR70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2019\/1439415","volume":"2019","author":"V Martinez","year":"2019","unstructured":"Martinez V, Berzal F, Cubero J-C (2019) Noesis: a framework for complex network data analysis. Complexity 2019:1\u201314","journal-title":"Complexity"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05211-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-05211-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05211-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:19:15Z","timestamp":1705141155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-05211-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5211"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-05211-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"assertion":[{"value":"1 December 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"In our research, we emphasize the importance of ethical practices and informed consent in the acquisition and utilization of data. Firstly, we obtain the dataset used in our study following strict ethical guidelines. The data is sourced from  and , and we ensure that the data is anonymized and stripped of any personally identifiable information to protect the privacy and confidentiality of the individuals or entities involved. Furthermore, we highlight the significance of informed consent in the process of data usage. As the data used in our study is pre-existing and publicly available, we adhere to the ethical standards and legal requirements set forth by the data source. It is important to emphasize that our research aligns with the principles of research ethics and integrity, complying with all regulations and guidelines related to data acquisition, storage, and usage. We acknowledge the importance of responsible data handling and are committed to maintaining the confidentiality and privacy of the data subjects.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}},{"value":"We declare that there are no conflicts of interest in this work. Throughout the research process, we have not encountered any conflicts of interest that could have influenced the research outcomes. We are committed to upholding the highest standards of research ethics and integrity.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}