{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T20:28:03Z","timestamp":1759091283953,"version":"3.37.3"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T00:00:00Z","timestamp":1524268800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T00:00:00Z","timestamp":1524268800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"CONICYT PAI:","award":["82140043"],"award-info":[{"award-number":["82140043"]}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1149789"],"award-info":[{"award-number":["IIS-1149789"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1618690","IIS-1546488"],"award-info":[{"award-number":["IIS-1618690","IIS-1546488"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10618-018-0566-x","type":"journal-article","created":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T07:11:05Z","timestamp":1524294665000},"page":"1561-1596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Scalable and exact sampling method for probabilistic generative graph models"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5422-0656","authenticated-orcid":false,"given":"Sebastian","family":"Moreno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"Joseph J.","family":"Pfeiffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Neville","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,21]]},"reference":[{"key":"566_CR1","unstructured":"Ahmadi B, Kersting K, Hadiji F (2010) Lifted belief propagation: Pairwise marginals and beyond. In: Proceedings of the 5th European workshop on probabilistic graphical models"},{"issue":"2","key":"566_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1093\/comnet\/cnu026","volume":"3","author":"C Aicher","year":"2015","unstructured":"Aicher C, Jacobs AZ, Clauset A (2015) Learning latent block structure in weighted networks. J Complex Netw 3(2):221\u2013248","journal-title":"J Complex Netw"},{"key":"566_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barabasi","year":"1999","unstructured":"Barabasi A, Albert R (1999) Emergence of scaling in random networks. Science 286:509\u2013512","journal-title":"Science"},{"key":"566_CR4","doi-asserted-by":"crossref","unstructured":"Benson AR, Riquelme C, Schmit S (2014) Learning multifractal structure in large networks. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1326\u20131335","DOI":"10.1145\/2623330.2623718"},{"issue":"9","key":"566_CR5","doi-asserted-by":"publisher","first-page":"2240","DOI":"10.1016\/j.physa.2013.01.006","volume":"392","author":"Z Bu","year":"2013","unstructured":"Bu Z, Xia Z, Wang J, Zhang C (2013a) A last updating evolution model for online social networks. Physica A 392(9):2240\u20132247","journal-title":"Physica A"},{"issue":"9","key":"566_CR6","doi-asserted-by":"publisher","first-page":"2240","DOI":"10.1016\/j.physa.2013.01.006","volume":"392","author":"Z Bu","year":"2013","unstructured":"Bu Z, Xia Z, Wang J, Zhang C (2013b) A last updating evolution model for online social networks. Physica A 392(9):2240\u20132247","journal-title":"Physica A"},{"key":"566_CR7","unstructured":"Bui HH, Huynh TN, Riedel S (2013) Automorphism groups of graphical models and lifted variational inference. In: Proceedings of the 29th conference on uncertainty in artificial intelligence, UAI\u201913, pp 132\u2013141"},{"key":"566_CR8","unstructured":"Choi J, Guzman-Rivera A, Amir E (2011) Lifted relational kalman filtering. In: Proceedings of the 22nd international joint conference on artificial intelligence\u20143, IJCAI\u201911, pp 2092\u20132099"},{"issue":"25","key":"566_CR9","doi-asserted-by":"publisher","first-page":"15,879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F Chung","year":"2002","unstructured":"Chung F, Lu L (2002) The average distances in random graphs with given expected degrees. Proc Nat Acad Sci 99(25):15,879\u201315,882","journal-title":"Proc Nat Acad Sci"},{"key":"566_CR10","unstructured":"de\u00a0Salvo R, Natarajan S, Bui H, Shavlik J, Russell S (2009) Anytime lifted belief propagation. In: Working notes if the international workshop on statistical relational learning, vol\u00a09"},{"key":"566_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11512-007-0067-4","volume":"47","author":"M Deijfen","year":"2009","unstructured":"Deijfen M, van den Esker H, van der Hofstad R, Hooghiemstra G (2009) A preferential attachment model with random initial degrees. Arkiv f\u00f6r Matematik 47:41\u201372","journal-title":"Arkiv f\u00f6r Matematik"},{"issue":"3","key":"566_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0898-1221(80)90039-5","volume":"6","author":"L Devroye","year":"1980","unstructured":"Devroye L (1980) Generating the maximum of independent identically distributed random variables. Comput Math Appl 6(3):305\u2013315","journal-title":"Comput Math Appl"},{"key":"566_CR13","unstructured":"Diestel R (1997) Graph Theory. No. 173 in Graduate Texts in Mathematics, Springer"},{"key":"566_CR14","doi-asserted-by":"publisher","first-page":"4633","DOI":"10.1103\/PhysRevLett.85.4633","volume":"85","author":"S Dorogovtsev","year":"2000","unstructured":"Dorogovtsev S, Mendes J, Samukhin A (2000) Structure of growing networks with preferential linking. Phys Rev Lett 85:4633\u20134636","journal-title":"Phys Rev Lett"},{"key":"566_CR15","doi-asserted-by":"crossref","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)"},{"key":"566_CR16","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos P, Renyi A (1960) On the evolution of random graphs. Publ Math Inst Hungarian Acad Sci 5:17\u201360","journal-title":"Publ Math Inst Hungarian Acad Sci"},{"key":"566_CR17","doi-asserted-by":"crossref","unstructured":"Flaxman A, Frieze A, Vera J (2004) A geometric preferential attachment model of networks. In: 3rd International workshop of algorithms and models for the web-graph, WAW, pp 44\u201355","DOI":"10.1007\/978-3-540-30216-2_4"},{"issue":"395","key":"566_CR18","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1080\/01621459.1986.10478342","volume":"81","author":"O Frank","year":"1986","unstructured":"Frank O, Strauss D (1986) Markov graphs. J Am Stat Assoc 81(395):832\u2013842","journal-title":"J Am Stat Assoc"},{"issue":"3","key":"566_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1080\/15427951.2012.680824","volume":"8","author":"DF Gleich","year":"2012","unstructured":"Gleich DF, Owen AB (2012) Moment-based estimation of stochastic kronecker graph parameters. Internet Math 8(3):232\u2013256","journal-title":"Internet Math"},{"key":"566_CR20","unstructured":"Gogate V, Domingos P (2010) Exploiting logical structure in lifted probabilistic inference. In: Workshops at the 24th AAAI conference on artificial intelligence"},{"key":"566_CR21","unstructured":"Gogate V, Domingos PM (2012) Probabilistic theorem proving. CoRR arXiv:1202.3724"},{"issue":"098","key":"566_CR22","first-page":"701","volume":"109","author":"M Golosovsky","year":"2012","unstructured":"Golosovsky M, Solomon S (2012) Stochastic dynamical model of a growing citation network based on a self-exciting point process. Phys Rev Lett 109(098):701","journal-title":"Phys Rev Lett"},{"key":"566_CR23","volume-title":"The National Longitudinal Study of Adolescent health, Waves I to III, 1994\u20132002 [machine-readable data file and documentation]","author":"K Harris","year":"2008","unstructured":"Harris K (2008) The National Longitudinal Study of Adolescent health, Waves I to III, 1994\u20132002 [machine-readable data file and documentation]. University of North Carolina at Chapel Hill, Chapel Hill"},{"issue":"373","key":"566_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/01621459.1981.10477598","volume":"76","author":"P Holland","year":"1981","unstructured":"Holland P, Leinhardt S (1981) An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76(373):33\u201350","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"566_CR25","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"},{"issue":"3","key":"566_CR26","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1257\/aer.97.3.890","volume":"97","author":"M Jackson","year":"2007","unstructured":"Jackson M, Rogers B (2007) Meeting strangers and friends of friends: how random are social networks? Am Econ Rev 97(3):890\u2013915","journal-title":"Am Econ Rev"},{"key":"566_CR27","unstructured":"Jaimovich A, Meshi O, Friedman N (2007) Template based inference in symmetric relational Markov random fields"},{"issue":"046","key":"566_CR28","first-page":"110","volume":"80","author":"B Karrer","year":"2009","unstructured":"Karrer B, Newman MEJ (2009) Random graph models for directed acyclic networks. Phys Rev E 80(046):110","journal-title":"Phys Rev E"},{"issue":"066","key":"566_CR29","first-page":"118","volume":"82","author":"B Karrer","year":"2010","unstructured":"Karrer B, Newman MEJ (2010) Random graphs containing arbitrary distributions of subgraphs. Phys Rev E 82(066):118","journal-title":"Phys Rev E"},{"key":"566_CR30","unstructured":"Kersting K (2012) Lifted probabilistic inference. In: Proceedings of the 20th European conference on artificial intelligence"},{"key":"566_CR31","unstructured":"Kersting K, Ahmadi B, Natarajan S (2009) Counting belief propagation. In: Proceedings of the 25th conference on uncertainty in artificial intelligence, pp 277\u2013284"},{"key":"566_CR32","doi-asserted-by":"crossref","unstructured":"Kersting K, El\u00a0Massaoudi Y (2010) Informed lifting for message-passing. In: Proceedings of the 24th conference on artificial intelligence (AAAI)","DOI":"10.1609\/aaai.v24i1.7759"},{"key":"566_CR33","doi-asserted-by":"crossref","unstructured":"Kim M, Leskovec J (2010) Multiplicative attribute graph model of real-world networks. Algorithms and Models for the Web-Graph, Springer, Berlin Heidelberg, Lecture Notes in Computer Science 6516:62\u201373","DOI":"10.1007\/978-3-642-18009-5_7"},{"issue":"5","key":"566_CR34","doi-asserted-by":"publisher","first-page":"C424","DOI":"10.1137\/130914218","volume":"36","author":"TG Kolda","year":"2014","unstructured":"Kolda TG, Pinar A, Plantenga T, Seshadhri C (2014) A scalable generative graph model with community structure. SIAM J Sci Comput 36(5):C424\u2013C452","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"566_CR35","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S1389-1286(02)00212-8","volume":"39","author":"P Krapivsky","year":"2002","unstructured":"Krapivsky P, Redner S (2002) A statistical physics perspective on web growth. Comput Netw 39(3):261\u2013276","journal-title":"Comput Netw"},{"key":"566_CR36","doi-asserted-by":"crossref","unstructured":"Kumar R, Raghavan P, Rajagopalan S, Sivakumar D, Tomkins A, Upfal E (2000) Stochastic models for the web graph. In: Proceedings of the 41st annual symposium on foundations of computer science, 2000, pp 57\u201365","DOI":"10.1109\/SFCS.2000.892065"},{"key":"566_CR37","first-page":"985","volume":"11","author":"J Leskovec","year":"2010","unstructured":"Leskovec J, Chakrabarti D, Kleinberg J, Faloutsos C, Ghahramani Z (2010) Kronecker graphs: an approach to modeling networks. J Mach Learn Res 11:985\u20131042","journal-title":"J Mach Learn Res"},{"key":"566_CR38","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2007) Scalable modeling of real graphs using Kronecker multiplication. In: Proceedings of the 24th international conference on machine learning, pp 497\u2013504","DOI":"10.1145\/1273496.1273559"},{"key":"566_CR39","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"key":"566_CR40","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1080\/01621459.1951.10500769","volume":"46","author":"FJ Massey","year":"1951","unstructured":"Massey FJ (1951) The Kolmogorov\u2013Smirnov test for goodness of fit. J Am Stat Assoc 46:68\u201378","journal-title":"J Am Stat Assoc"},{"issue":"2","key":"566_CR41","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1009953814988","volume":"3","author":"AK McCallum","year":"2000","unstructured":"McCallum AK, Nigam K, Rennie J, Seymore K (2000) Automating the construction of internet portals with machine learning. Inf Retr 3(2):127\u2013163","journal-title":"Inf Retr"},{"key":"566_CR42","unstructured":"Mladenov M, Ahmadi B, Kersting K (2012) Lifted linear programming. In: International conference on artificial intelligence and statistics, pp 788\u2013797"},{"key":"566_CR43","doi-asserted-by":"crossref","unstructured":"Moreno S, Kirshner S, Neville J, Vishwanathan S (2010) Tied Kronecker product graph models to capture variance in network populations. In: The 48th annual Allerton conference on communication, control, and computing, pp 1137\u20131144","DOI":"10.1109\/ALLERTON.2010.5707038"},{"key":"566_CR44","doi-asserted-by":"crossref","unstructured":"Moreno S, Neville J (2013) Network hypothesis testing using mixed Kronecker product graph models. In: IEEE 13th international conference on data mining, pp 1163\u20131168","DOI":"10.1109\/ICDM.2013.165"},{"key":"566_CR45","doi-asserted-by":"crossref","unstructured":"Moreno S, Neville J, Kirshner S (2013) Learning mixed Kronecker product graph models with simulated method of moments. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1052\u20131060","DOI":"10.1145\/2487575.2487675"},{"key":"566_CR46","doi-asserted-by":"crossref","unstructured":"Moreno S, Pfeiffer\u00a0III J, Kirshner S, Neville J (2014) A scalable method for exact sampling from kronecker family models. In: IEEE 14th international conference on data mining, pp 440\u2013449","DOI":"10.1109\/ICDM.2014.148"},{"key":"566_CR47","doi-asserted-by":"crossref","unstructured":"Pfeiffer JJ III, Neville J, Bennett PN (2014) Active exploration in networks: using probabilistic relationships for learning and inference. In: Proceedings of the 23rd ACM international conference on information and knowledge management, pp 639\u2013648","DOI":"10.1145\/2661829.2662072"},{"key":"566_CR48","unstructured":"Pinar A, Seshadhri C, Kolda TG (2011) The similarity between stochastic Kronecker and Chung-Lu graph models. CoRR arXiv:1110.4925"},{"key":"566_CR49","unstructured":"Poole D (2003) First-order probabilistic inference. In: Proceedings of the 18th international joint conference on artificial intelligence, pp 985\u2013991"},{"volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","year":"1988","key":"566_CR50","unstructured":"Pearl J (ed) (1988) Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, Burlington"},{"issue":"5","key":"566_CR51","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1002\/asi.4630270505","volume":"27","author":"D Price","year":"1976","unstructured":"Price D (1976) A general theory of bibliometric and other cumulative advantage processes. J Am Soc Inf Sci 27(5):292\u2013306","journal-title":"J Am Soc Inf Sci"},{"key":"566_CR52","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.socnet.2006.08.003","volume":"29","author":"G Robins","year":"2007","unstructured":"Robins G, Snijders T, Wang P, Handcock M, Pattison P (2007) Recent developments in exponential random graph (p*) models for social networks. Soc Netw 29:192\u2013215","journal-title":"Soc Netw"},{"key":"566_CR53","unstructured":"Sen P, Deshpande A, Getoor L (2009) Bisimulation-based approximate lifted inference. In: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, pp 496\u2013505"},{"issue":"5","key":"566_CR54","doi-asserted-by":"publisher","first-page":"056109","DOI":"10.1103\/PhysRevE.85.056109","volume":"85","author":"C Seshadhri","year":"2012","unstructured":"Seshadhri C, Kolda TG, Pinar A (2012) Community structure and scale-free collections of Erd\u0151s-R\u00e9nyi graphs. Phys Rev E 85(5):056109","journal-title":"Phys Rev E"},{"key":"566_CR55","volume-title":"A first course in probability","author":"R Sheldon","year":"2002","unstructured":"Sheldon R (2002) A first course in probability. Pearson Education, London"},{"issue":"3\u20134","key":"566_CR56","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1093\/biomet\/42.3-4.425","volume":"42","author":"H Simon","year":"1955","unstructured":"Simon H (1955) On a class of skew distribution functions. Biometrika 42(3\u20134):425\u2013440","journal-title":"Biometrika"},{"key":"566_CR57","unstructured":"Singla P, Domingos PM (2008) Lifted first-order belief propagation. In: Proceedings of the 23rd conference on artificial intelligence, vol\u00a08, pp 1094\u20131099"},{"issue":"2","key":"566_CR58","first-page":"1","volume":"3","author":"T Snijders","year":"2002","unstructured":"Snijders T (2002) Markov chain Monte Carlo estimation of exponential random graph models. J Soc Struct 3(2):1\u201340","journal-title":"J Soc Struct"},{"key":"566_CR59","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1111\/j.1467-9531.2006.00176.x","volume":"36","author":"T Snijders","year":"2004","unstructured":"Snijders T, Pattison P, Robins G, Handcock M (2004) New specifications for exponential random graph models. Sociol Methodol 36:99\u2013153","journal-title":"Sociol Methodol"},{"issue":"409","key":"566_CR60","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1080\/01621459.1990.10475327","volume":"85","author":"D Strauss","year":"1990","unstructured":"Strauss D, Ikeda M (1990) Pseudolikelihood estimation for social networks. J Am Stat Assoc 85(409):204\u2013212","journal-title":"J Am Stat Assoc"},{"issue":"1\u20132","key":"566_CR61","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0378-4371(01)00014-0","volume":"293","author":"B Tadic","year":"2001","unstructured":"Tadic B (2001) Dynamics of directed graphs: the world-wide web. Physica A 293(1\u20132):273\u2013284","journal-title":"Physica A"},{"key":"566_CR62","unstructured":"Van den Broeck G, Choi A, Darwiche A (2012) Lifted relax, compensate and then recover: from approximate to exact lifted probabilistic inference. In: Proceedings of the 28th conference on uncertainty in artificial intelligence (UAI)"},{"key":"566_CR63","unstructured":"Van den Broeck G, Davis J (2012) Conditioning in first-order knowledge compilation and lifted probabilistic inference. In: Proceedings of the 26th conference on artificial intelligence, AAAI\u201912, pp 1961\u20131967"},{"key":"566_CR64","doi-asserted-by":"crossref","unstructured":"Van den Broeck G, Niepert M (2015) Lifted probabilistic inference for asymmetric graphical models. In: Proceedings of the 29th conference on artificial intelligence, pp 3599\u20133605","DOI":"10.1609\/aaai.v29i1.9678"},{"key":"566_CR65","unstructured":"Van\u00a0den Broeck G (2013) Lifted inference and learning in statistical relational models. PhD thesis, Arenberg Doctoral School, Faculty of Engineering"},{"volume-title":"An introduction to statistical computing: a simulation-based approach","year":"2013","key":"566_CR66","unstructured":"Voss J (ed) (2013) An introduction to statistical computing: a simulation-based approach. Wiley, Hoboken"},{"issue":"1","key":"566_CR67","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.socnet.2013.01.004","volume":"35","author":"P Wang","year":"2013","unstructured":"Wang P, Robins G, Pattison P, Lazega E (2013) Exponential random graph models for multilevel networks. Soc Netw 35(1):96\u2013115","journal-title":"Soc Netw"},{"issue":"1","key":"566_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0378-8733(87)90015-3","volume":"9","author":"S Wasserman","year":"1987","unstructured":"Wasserman S, Anderson C (1987) Stochastic a posteriori blockmodels: construction and assessment. Soc Netw 9(1):1\u201336","journal-title":"Soc Netw"},{"key":"566_CR69","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02294547","volume":"61","author":"S Wasserman","year":"1996","unstructured":"Wasserman S, Pattison PE (1996) Logit models and logistic regression for social networks: I. An introduction to Markov graphs and p*. Psychometrika 61:401\u2013425","journal-title":"Psychometrika"},{"key":"566_CR70","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D Watts","year":"1998","unstructured":"Watts D, Strogatz S (1998) Collective dynamics of \u2019small-world\u2019 networks. Nature 393:440\u201342","journal-title":"Nature"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-018-0566-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0566-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0566-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T06:56:39Z","timestamp":1693637799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-018-0566-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,21]]},"references-count":70,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["566"],"URL":"https:\/\/doi.org\/10.1007\/s10618-018-0566-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2018,4,21]]},"assertion":[{"value":"29 October 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}