{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T10:27:03Z","timestamp":1778840823138,"version":"3.51.4"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1741197"],"award-info":[{"award-number":["IIS-1741197"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1750539"],"award-info":[{"award-number":["CCF-1750539"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["GCP credit support."],"award-info":[{"award-number":["GCP credit support."]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10115-022-01782-6","type":"journal-article","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T19:11:36Z","timestamp":1671649896000},"page":"1627-1656","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Graph transfer learning"],"prefix":"10.1007","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5074-7282","authenticated-orcid":false,"given":"Andrey","family":"Gritsenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0545-3255","authenticated-orcid":false,"given":"Kimia","family":"Shayestehfard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Moharrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8430-134X","authenticated-orcid":false,"given":"Jennifer","family":"Dy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8355-4751","authenticated-orcid":false,"given":"Stratis","family":"Ioannidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"1782_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed A, Shervashidze N, Narayanamurthy SM, Josifovski V, Smola AJ (2013) Distributed large-scale natural graph factorization. In: Proceedings of the 22nd international world wide web conference, WWW, 2013, pp 37\u201348","DOI":"10.1145\/2488388.2488393"},{"issue":"6","key":"1782_CR2","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","volume":"15","author":"M Belkin","year":"2003","unstructured":"Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15(6):1373\u20131396","journal-title":"Neural Comput"},{"key":"1782_CR3","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, KDD, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"issue":"10","key":"1782_CR4","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1109\/TKDE.2009.191","volume":"22","author":"SJ Pan","year":"2010","unstructured":"Pan SJ, Yang Q (2010) A survey on transfer learning. IEEE Trans Knowl Data Eng 22(10):1345\u20131359","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1782_CR5","doi-asserted-by":"publisher","first-page":"107-1","DOI":"10.1007\/s41109-019-0219-z","volume":"4","author":"J Bento","year":"2019","unstructured":"Bento J, Ioannidis S (2019) A family of tractable graph metrics. Appl Netw Sci 4(1):107-1\u2013107-27","journal-title":"Appl Netw Sci"},{"key":"1782_CR6","first-page":"147","volume":"5","author":"G Birkhoff","year":"1946","unstructured":"Birkhoff G (1946) Tres observaciones sobre el algebra lineal [three observations on linear algebra]. Revista - Universidad Nacional de Tucum\u00e1n, Serie A 5:147\u2013151","journal-title":"Revista - Universidad Nacional de Tucum\u00e1n, Serie A"},{"key":"1782_CR7","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2015) GraRep: learning graph representations with global structural information. In: Proceedings of the 24th ACM international conference on information and knowledge management, CIKM, pp 891\u2013900","DOI":"10.1145\/2806416.2806512"},{"issue":"3","key":"1782_CR8","first-page":"52","volume":"40","author":"WL Hamilton","year":"2017","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Representation learning on graphs: methods and applications. IEEE Data Eng Bull 40(3):52\u201374","journal-title":"IEEE Data Eng Bull"},{"key":"1782_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: a survey. Knowl Based Syst 151:78\u201394","journal-title":"Knowl Based Syst"},{"issue":"9","key":"1782_CR10","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang KC (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1782_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TNN.2008.2005605","volume":"20","author":"F Scarselli","year":"2009","unstructured":"Scarselli F, Gori M, Tsoi AC, Hagenbuchner M, Monfardini G (2009) The graph neural network model. IEEE Trans Neural Netw 20(1):61\u201380","journal-title":"IEEE Trans Neural Netw"},{"key":"1782_CR12","unstructured":"Li Y, Tarlow D, Brockschmidt M, Zemel RS (2016) Gated graph sequence neural networks. In: Proceedings of the 4th international conference on learning representations, ICLR,"},{"key":"1782_CR13","unstructured":"Hamilton W\u00a0L, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the annual conference on neural information processing systems, NeurIPS, pp 1024\u20131034"},{"key":"1782_CR14","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: Proceedings of the 5th international conference on learning representations, ICLR"},{"issue":"4","key":"1782_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MSP.2017.2693418","volume":"34","author":"MM Bronstein","year":"2017","unstructured":"Bronstein MM, Bruna J, LeCun Y, Szlam A, Vandergheynst P (2017) Geometric deep learning: going beyond Euclidean data. IEEE Signal Process Mag 34(4):18\u201342","journal-title":"IEEE Signal Process Mag"},{"key":"1782_CR16","unstructured":"Kipf TN, Welling M (2016) Variational graph auto-encoders. In: Proceedings of the NeurIPS Bayesian deep learning workshop"},{"key":"1782_CR17","doi-asserted-by":"crossref","unstructured":"Pratt L, Jennings B (1996) A survey of connectionist network reuse through transfer. In Learning to Learn, 1996, pp 19\u201343","DOI":"10.1007\/978-1-4615-5529-2_2"},{"key":"1782_CR18","unstructured":"Do CB, Ng AY(2005) Transfer learning for text classification. Adv Neural Inf Process Syst pp 299\u2013306"},{"key":"1782_CR19","unstructured":"Wan C, Pan R, Li J (2011) Bi-weighting domain adaptation for cross-language text classification. In: Proceedings of the 21d international joint conference on artificial intelligence, IJCAI"},{"key":"1782_CR20","doi-asserted-by":"crossref","unstructured":"Lu Z, Zhu Y, Pan SJ, Xiang EW, Wang Y, Yang Q (2014) Source free transfer learning for text classification. In: Proceedings of the 28th conference on artificial intelligence, AAAI, pp 122\u2013128","DOI":"10.1609\/aaai.v28i1.8721"},{"key":"1782_CR21","doi-asserted-by":"crossref","unstructured":"Lee J, Kim H, Lee J, Yoon S (2017) Transfer learning for deep learning on graph-structured data. In: Proceedings of the 31st conference on artificial intelligence, AAAI, pp 2154\u20132160","DOI":"10.1609\/aaai.v31i1.10904"},{"key":"1782_CR22","doi-asserted-by":"crossref","unstructured":"Gong K, Gao Y, Liang X, Shen X, Wang M, Lin L (2019) Graphonomy: universal human parsing via graph transfer learning. In: Proceedings of the IEEE conference on computer vision and pattern recognition, CVP, pp 7450\u20137459","DOI":"10.1109\/CVPR.2019.00763"},{"key":"1782_CR23","unstructured":"Verma S, Zhang Z-L (2019) Learning universal graph neural network embeddings with aid of transfer learning, arXiv preprint arXiv:1909.10086"},{"key":"1782_CR24","unstructured":"Banerjee B, Stone P (2007) General game learning using knowledge transfer. In: Proceedings of the 20th international joint conference on artificial intelligence, IJCAI, pp 672\u2013677"},{"key":"1782_CR25","doi-asserted-by":"crossref","unstructured":"Kuhlmann G, Stone P (2007) Graph-based domain mapping for transfer learning in general games. In: Proceedings of the 18th European conference on machine learning, ECML, pp 188\u2013200","DOI":"10.1007\/978-3-540-74958-5_20"},{"issue":"7","key":"1782_CR26","doi-asserted-by":"publisher","first-page":"1805","DOI":"10.1109\/TKDE.2013.97","volume":"26","author":"M Long","year":"2013","unstructured":"Long M, Wang J, Ding G, Shen D, Yang Q (2013) Transfer learning with graph co-regularization. IEEE Trans Knowl Data Eng 26(7):1805\u20131818","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1782_CR27","doi-asserted-by":"crossref","unstructured":"Piao G, Breslin JG (2018) Transfer learning for item recommendations and knowledge graph completion in item related domains via a co-factorization model. In: Proceedings of the 15th extended semantic web conference, ESWC, pp 496\u2013511","DOI":"10.1007\/978-3-319-93417-4_32"},{"issue":"3","key":"1782_CR28","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching in pattern recognition. Int J Pattern Recognit Artif Intell 18(3):265\u2013298","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"3","key":"1782_CR29","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1107\/S0108768102003890","volume":"58","author":"FH Allen","year":"2002","unstructured":"Allen FH (2002) The cambridge structural database: a quarter of a million crystal structures and rising. Acta Crystallogr B 58(3):380\u2013388","journal-title":"Acta Crystallogr B"},{"issue":"1","key":"1782_CR30","first-page":"65","volume":"79","author":"V Kvasni\u010dka","year":"1991","unstructured":"Kvasni\u010dka V, Posp\u00edchal J, Bal\u00e1\u017e V (1991) Reaction and chemical distances and reaction graphs. Theoret Chem Account Theory Comput Model 79(1):65\u201379","journal-title":"Theoret Chem Account Theory Comput Model"},{"key":"1782_CR31","doi-asserted-by":"crossref","unstructured":"Macindoe O, Richards W (2010) Graph comparison using fine structure analysis. In Proceedings of the IEEE 2nd international conference on social computing, SocialCom, 2010, pp 193\u2013200","DOI":"10.1109\/SocialCom.2010.35"},{"key":"1782_CR32","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Koutra D, Vogelstein JT(2013) DELTACON: a principled massive-graph similarity function. In: Proceedings of the 13th SIAM international conference on data mining, ICDM, pp 162\u2013170","DOI":"10.1137\/1.9781611972832.18"},{"key":"1782_CR33","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co,"},{"issue":"2","key":"1782_CR34","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.patcog.2014.07.015","volume":"48","author":"A Fischer","year":"2015","unstructured":"Fischer A, Suen CY, Frinken V, Riesen K, Bunke H (2015) Approximation of graph edit distance based on hausdorff matching. Pattern Recogn 48(2):331\u2013343","journal-title":"Pattern Recogn"},{"issue":"8","key":"1782_CR35","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H Bunke","year":"1997","unstructured":"Bunke H (1997) On a relation between graph edit distance and maximum common subgraph. Pattern Recogn Lett 18(8):689\u2013694","journal-title":"Pattern Recogn Lett"},{"issue":"3\u20134","key":"1782_CR36","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke H, Shearer K (1998) A graph distance metric based on the maximal common subgraph. Pattern Recogn Lett 19(3\u20134):255\u2013259","journal-title":"Pattern Recogn Lett"},{"key":"1782_CR37","doi-asserted-by":"crossref","unstructured":"Chartrand G, Kubicki G, Schultz M (1998) Graph similarity and distance in graphs. Aequationes Mathematicae","DOI":"10.1007\/s000100050025"},{"key":"1782_CR38","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2016.06.027","volume":"214","author":"BJ Jain","year":"2016","unstructured":"Jain BJ (2016) On the geometry of graph spaces. Discret Appl Math 214:126\u2013144","journal-title":"Discret Appl Math"},{"key":"1782_CR39","unstructured":"Koca J, Kratochvil M, Kvasnicka V, Matyska L, Pospichal J (2012) Synthon model of organic chemistry and synthesis design. Springer Science & Business Media, vol\u00a051"},{"key":"1782_CR40","first-page":"383","volume":"4538","author":"K Riesen","year":"2007","unstructured":"Riesen K, Neuhaus M, Bunke K (2007) Graph embedding in vector spaces by means of prototype selection. Graph-Based Represent Pattern Recogn 4538:383\u2013393","journal-title":"Graph-Based Represent Pattern Recogn"},{"key":"1782_CR41","doi-asserted-by":"crossref","unstructured":"Riesen K, Bunke H (2010) Graph Classification and clustering based on vector space embedding. World Scientific","DOI":"10.1142\/7731"},{"issue":"4","key":"1782_CR42","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1016\/j.patcog.2009.10.013","volume":"43","author":"M Ferrer","year":"2010","unstructured":"Ferrer M, Valveny E, Serratosa F, Riesen K, Bunke H (2010) Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recogn 43(4):1642\u20131655","journal-title":"Pattern Recogn"},{"key":"1782_CR43","doi-asserted-by":"crossref","unstructured":"Zhu P, Wilson RC (2005) A study of graph spectra for comparing graphs. In: Proceedings of the the British machine vision conference, BMVC","DOI":"10.5244\/C.19.69"},{"key":"1782_CR44","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1016\/j.patcog.2008.03.011","volume":"41","author":"RC Wilson","year":"2008","unstructured":"Wilson RC, Zhu P (2008) A study of graph spectra for comparing graphs and trees. Pattern Recogn 41:2833\u20132841","journal-title":"Pattern Recogn"},{"key":"1782_CR45","doi-asserted-by":"crossref","unstructured":"Elghawalby H, Hancock ER (2008) Measuring graph similarity using spectral geometry. In: Proceedings of the 5th international conference on image analysis and recognition, ICIAR, 2008, pp 517\u2013526","DOI":"10.1007\/978-3-540-69812-8_51"},{"key":"1782_CR46","doi-asserted-by":"crossref","unstructured":"Zhang S, Tong H (2016) Final: fast attributed network alignment. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, KDD, pp 1345\u20131354","DOI":"10.1145\/2939672.2939766"},{"issue":"7","key":"1782_CR47","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen K, Bunke H (2009) Approximate graph edit distance computation by means of bipartite graph matching. Image Vis Comput 27(7):950\u2013959","journal-title":"Image Vis Comput"},{"key":"1782_CR48","doi-asserted-by":"crossref","unstructured":"Fankhauser S, Riesen K, Bunke H (2011) Speeding up graph edit distance computation through fast bipartite matching. In: Proceedings of the 8th international workshop on graph-based representations in pattern recognition, GbRPR, pp 102\u2013111","DOI":"10.1007\/978-3-642-20844-7_11"},{"key":"1782_CR49","doi-asserted-by":"crossref","unstructured":"Heimann M, Shen H, Safavi T, Koutra D (2018) REGAL: representation learning-based graph alignment. In: Proceedings of the 27th ACM international conference on information and knowledge management, CIKM, pp 117\u2013126","DOI":"10.1145\/3269206.3271788"},{"key":"1782_CR50","doi-asserted-by":"crossref","unstructured":"Chen X, Heimann M, Vahedian F, Koutra D (2020) CONE-align: consistent network alignment with proximity-preserving node embedding. In: Proceedings of the The 29th ACM international conference on information and knowledge management, CIKM, pp 1985\u20131988","DOI":"10.1145\/3340531.3412136"},{"key":"1782_CR51","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg JM, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, KDD, 2003, pp. 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1782_CR52","unstructured":"Myers SA, Leskovec J (2010) On the convexity of latent social network inference. In: Proceedings of the 24th annual conference on neural information processing systems, NeurIPS, pp 1741\u20131749"},{"issue":"4","key":"1782_CR53","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/2086737.2086741","volume":"5","author":"M Gomez-Rodriguez","year":"2012","unstructured":"Gomez-Rodriguez M, Leskovec J, Krause A (2012) Inferring networks of diffusion and influence. ACM Trans Knowl Discov Data 5(4):211\u20132137","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1782_CR54","doi-asserted-by":"crossref","unstructured":"Abrahao B\u00a0D, Chierichetti F, Kleinberg R, Panconesi A (2013) Trace complexity of network inference. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, KDD, pp 491\u2013499","DOI":"10.1145\/2487575.2487664"},{"key":"1782_CR55","unstructured":"Morin F, Bengio Y (2005) Hierarchical probabilistic neural network language model. In: Proceedings of the 10th international workshop on artificial intelligence and statistics, AISTATS"},{"key":"1782_CR56","unstructured":"Mikolov T, Sutskever I, Chen K, Corrado GS, Dean J (2013) Distributed representations of words and phrases and their compositionality. In: Proceedings of the 27th annual conference on neural information processing systems, NeurIPS, pp 3111\u20133119"},{"issue":"4","key":"1782_CR57","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold S, Rangarajan A (1996) A graduated assignment algorithm for graph matching. IEEE Trans Pattern Anal Mach Intell 18(4):377\u2013388","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1782_CR58","doi-asserted-by":"crossref","unstructured":"Wiskott L, Fellous J, Kr\u00fcger N, von\u00a0der Malsburg C (1997) Face recognition by elastic bunch graph matching. In: Proceedings of the 7th international conference on computer analysis of images and patterns, CAIP, vol 1296, pp 456\u2013463","DOI":"10.1007\/3-540-63460-6_150"},{"key":"1782_CR59","doi-asserted-by":"crossref","unstructured":"Babai L (2016) Graph isomorphism in quasipolynomial time [extended abstract]. In Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC, 2016, pp 684\u2013697","DOI":"10.1145\/2897518.2897542"},{"issue":"1\u20132","key":"1782_CR60","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Res Logist Quart 3(1\u20132):95\u2013110","journal-title":"Naval Res Logist Quart"},{"issue":"1","key":"1782_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"SP Boyd","year":"2011","unstructured":"Boyd SP, Parikh N, Chu E, Peleato B, Eckstein J (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn 3(1):1\u2013122","journal-title":"Found Trends Mach Learn"},{"key":"1782_CR62","doi-asserted-by":"crossref","unstructured":"Andersen M, Dahl J, Liu Z, Vandenberghe L, Sra S, Nowozin S, Wright S (2011)Interior-point methods for large-scale cone programming. Optim Mach Learn 5583","DOI":"10.7551\/mitpress\/8996.003.0005"},{"key":"1782_CR63","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press","DOI":"10.1017\/CBO9780511804441"},{"key":"1782_CR64","unstructured":"Bertsekas DP (1999) Nonlinear programming. Athena Scientific Belmont,"},{"issue":"1\u20132","key":"1782_CR65","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn HW (1955) The hungarian method for the assignment problem. Naval Res Logist Quart 2(1\u20132):83\u201397","journal-title":"Naval Res Logist Quart"},{"issue":"1","key":"1782_CR66","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF00938486","volume":"50","author":"C Michelot","year":"1986","unstructured":"Michelot C (1986) A finite algorithm for finding the projection of a point onto the canonical simplex of $$R^n$$. J Optim Theory Appl 50(1):195\u2013200","journal-title":"J Optim Theory Appl"},{"issue":"4","key":"1782_CR67","first-page":"381","volume":"2","author":"S Gold","year":"1996","unstructured":"Gold S, Rangarajan A (1996) Softmax to Softassign: neural network algorithms for combinatorial optimization. J Art Neural Netw 2(4):381\u2013399","journal-title":"J Art Neural Netw"},{"issue":"4","key":"1782_CR68","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"key":"1782_CR69","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg JM, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data 1(1): 2\u2013es","DOI":"10.1145\/1217299.1217301"},{"issue":"51","key":"1782_CR70","doi-asserted-by":"publisher","first-page":"22020","DOI":"10.1073\/pnas.1009094108","volume":"107","author":"M Salath\u00e9","year":"2010","unstructured":"Salath\u00e9 M, Kazandjieva M, Lee JW, Levis P, Feldman MW, Jones JH (2010) A high-resolution human contact network for infectious disease transmission. Proc Natl Acad Sci 107(51):22020\u201322025","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"1782_CR71","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman ME, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113","journal-title":"Phys Rev E"},{"key":"1782_CR72","unstructured":"Zhu Y, Xu Y, Yu F, Liu Q, Wu S, Wang L (2021) Graph contrastive learning with adaptive augmentation. In: WWW \u201921: the web conference 2021, Virtual Event\/Ljubljana, Slovenia, April 19\u201323, 2021. ACM \/ IW3C2, 2021, pp 2069\u20132080"},{"key":"1782_CR73","doi-asserted-by":"crossref","unstructured":"Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, 2016, pp 1225\u20131234","DOI":"10.1145\/2939672.2939753"},{"issue":"1","key":"1782_CR74","first-page":"29","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec J, Lang KJ, Dasgupta A, Mahoney MW (2009) Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Int Math 6(1):29\u2013123","journal-title":"Int Math"},{"key":"1782_CR75","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On Random Graphs I. Publicationes Mathematicae Debrecen 6:290\u2013297","journal-title":"Publicationes Mathematicae Debrecen"},{"issue":"2","key":"1782_CR76","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland PW, Laskey KB, Leinhardt S (1983) Stochastic blockmodels: first steps. Soc Netw 5(2):109\u2013137","journal-title":"Soc Netw"},{"key":"1782_CR77","doi-asserted-by":"crossref","unstructured":"Rossetti G, Milli L, Rinzivillo, S S\u00eerbu A, Pedreschi D, Giannotti F (2017) NDlib: studying network diffusion dynamics. In: Proceedings of the IEEE international conference on data science and advanced analytics, DSAA, 2017, pp 155\u2013164","DOI":"10.1109\/DSAA.2017.6"},{"key":"1782_CR78","unstructured":"Glantz SA, Slinker BK, Neilands TB (1990) Primer of applied regression and analysis of variance, vol 309. McGraw-Hill"},{"key":"1782_CR79","doi-asserted-by":"crossref","unstructured":"Draper NR, Smith H (1998) Applied regression analysis, vol 326. Wiley","DOI":"10.1002\/9781118625590"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01782-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01782-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01782-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,3]],"date-time":"2023-12-03T11:16:36Z","timestamp":1701602196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01782-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,21]]},"references-count":79,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1782"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01782-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,21]]},"assertion":[{"value":"26 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}