{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T15:03:58Z","timestamp":1761491038368,"version":"3.37.3"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T00:00:00Z","timestamp":1592870400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"AAA-DS Program"},{"name":"Dutch National COMMIT program"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a new method for finding <jats:italic>network motifs<\/jats:italic>. Subgraphs are motifs when their frequency in the data is high compared to the expected frequency under a <jats:italic>null model<\/jats:italic>. To compute this expectation, a full or approximate count of the occurrences of a motif is normally repeated on as many as 1000 random graphs sampled from the null model; a prohibitively expensive step. We use ideas from the minimum description length literature to define a new measure of motif relevance. With our method, samples from the null model are not required. Instead we compute the probability of the data under the null model and compare this to the probability under a specially designed alternative model. With this new relevance test, we can search for motifs by random sampling, rather than requiring an accurate count of all instances of a motif. This allows motif analysis to scale to networks with billions of links.<\/jats:p>","DOI":"10.1007\/s10618-020-00691-y","type":"journal-article","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T04:14:44Z","timestamp":1592885684000},"page":"1421-1453","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Large-scale network motif analysis using compression"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0189-5817","authenticated-orcid":false,"given":"Peter","family":"Bloem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"de Rooij","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,23]]},"reference":[{"issue":"4","key":"691_CR1","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1007\/s10618-019-00627-1","volume":"33","author":"F Adriaens","year":"2019","unstructured":"Adriaens F, Lijffijt J, De Bie T (2019) Subjectively interesting connecting trees and forests. Data Min Knowl Discov 33(4):1088\u20131124","journal-title":"Data Min Knowl Discov"},{"key":"691_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2","volume-title":"Frequent pattern mining","author":"CC Aggarwal","year":"2014","unstructured":"Aggarwal CC, Han J (2014) Frequent pattern mining. Springer, Berlin"},{"issue":"1","key":"691_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47","journal-title":"Rev Mod Phys"},{"key":"691_CR4","doi-asserted-by":"crossref","unstructured":"Auer S, Bizer C, Kobilarov G, Lehmann J, Cyganiak R, Ives Z (2008) DBpedia: a nucleus for a web of open data. In: Proceedings of international semantic web conference, pp 722\u2013735","DOI":"10.1007\/978-3-540-76298-0_52"},{"issue":"3","key":"691_CR5","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","volume":"24","author":"EA Bender","year":"1978","unstructured":"Bender EA, Canfield ER (1978) The asymptotic number of labeled graphs with given degree sequences. J Combin Theory Ser A 24(3):296\u2013307","journal-title":"J Combin Theory Ser A"},{"key":"691_CR6","doi-asserted-by":"crossref","unstructured":"Bhuiyan MA, Rahman M, Rahman M, Al\u00a0Hasan M (2012) Guise: uniform sampling of graphlets for large graph analysis. In: 2012 IEEE 12th international conference on data mining. IEEE, pp 91\u2013100","DOI":"10.1109\/ICDM.2012.87"},{"issue":"4","key":"691_CR7","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/15427951.2010.557277","volume":"6","author":"JK Blitzstein","year":"2011","unstructured":"Blitzstein JK, Diaconis P (2011) A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math 6(4):489\u2013522. https:\/\/doi.org\/10.1080\/15427951.2010.557277","journal-title":"Internet Math"},{"key":"691_CR8","unstructured":"Bloem P, de\u00a0Rooij S (2018) A tutorial on MDL hypothesis testing for graph analysis. arXiv preprint arXiv:1810.13163"},{"key":"691_CR9","doi-asserted-by":"crossref","unstructured":"Budhathoki K, Vreeken J (2015) The difference and the norm\u2014characterising similarities and differences between databases. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 206\u2013223","DOI":"10.1007\/978-3-319-23525-7_13"},{"key":"691_CR10","doi-asserted-by":"publisher","unstructured":"Carstens CJ (2013) Motifs in directed acyclic networks. In: International conference on signal-image technology & internet-based systems, SITIS 2013, Kyoto, Japan, 2\u20135 Dec 2013. IEEE, pp 605\u2013611. https:\/\/doi.org\/10.1109\/SITIS.2013.99","DOI":"10.1109\/SITIS.2013.99"},{"key":"691_CR11","unstructured":"Carstens CJ, Berger A, Strona G (2016) Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence. arXiv preprint arXiv:1609.05137"},{"key":"691_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.2307\/2785979","volume":"20","author":"J Coleman","year":"1957","unstructured":"Coleman J, Katz E, Menzel H (1957) The diffusion of an innovation among physicians. Sociometry 20:253\u2013270","journal-title":"Sociometry"},{"key":"691_CR13","doi-asserted-by":"crossref","unstructured":"Cook DJ, Holder LB (1994) Substructure discovery using minimum description length and background knowledge. CoRR, arXiv:cs.AI\/9402102","DOI":"10.1613\/jair.43"},{"key":"691_CR14","volume-title":"Elements of information theory","author":"TM Cover","year":"2006","unstructured":"Cover TM, Thomas JA (2006) Elements of information theory, 2nd edn. Wiley, Hoboken","edition":"2"},{"key":"691_CR15","doi-asserted-by":"crossref","unstructured":"De\u00a0Bie T (2011) An information theoretic framework for data mining. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 564\u2013572","DOI":"10.1145\/2020408.2020497"},{"issue":"3","key":"691_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.3233\/SW-2012-0074","volume":"4","author":"V de Boer","year":"2013","unstructured":"de Boer V, Wielemaker J, van Gent J, Oosterbroek M, Hildebrand M, Isaac A, van Ossenbruggen J, Schreiber G (2013) Amsterdam museum linked open data. Semant Web 4(3):237\u2013243","journal-title":"Semant Web"},{"key":"691_CR17","doi-asserted-by":"crossref","unstructured":"Faas M, van Leeuwen M (2019) Vouw: geometric pattern mining using the mdl principle. arXiv preprint arXiv:1911.09587","DOI":"10.1007\/978-3-030-44584-3_13"},{"issue":"2","key":"691_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/980972.980992","volume":"5","author":"J Gehrke","year":"2003","unstructured":"Gehrke J, Ginsparg P, Kleinberg J (2003) Overview of the 2003 KDD cup. ACM SIGKDD Explor Newsl 5(2):149\u2013151","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"691_CR19","unstructured":"Genio CID, Kim H, Toroczkai Z, Bassler KE (2010) Efficient and exact sampling of simple graphs with given arbitrary degree sequence. CoRR, arXiv:1002.2975"},{"key":"691_CR20","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert EN (1959) Random graphs. Ann Math Stat 30:1141\u20131144","journal-title":"Ann Math Stat"},{"key":"691_CR21","doi-asserted-by":"crossref","unstructured":"Gionis A, Tsourakakis CE (2015) Dense subgraph discovery: KDD 2015 tutorial. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 2313\u20132314","DOI":"10.1145\/2783258.2789987"},{"key":"691_CR22","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The minimum description length principle","author":"P Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald P (2007) The minimum description length principle. The MIT Press, Cambridge"},{"issue":"4","key":"691_CR23","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2014","unstructured":"Ho\u010devar T, Dem\u0161ar J (2014) A combinatorial approach to graphlet counting. Bioinformatics 30(4):559\u2013565","journal-title":"Bioinformatics"},{"key":"691_CR24","doi-asserted-by":"crossref","unstructured":"Jha M, Seshadhri C, Pinar A (2015) Path sampling: a fast and provable method for estimating 4-vertex subgraph counts. In: Proceedings of the 24th international conference on world wide web, ACM, pp 495\u2013505","DOI":"10.1145\/2736277.2741101"},{"issue":"11","key":"691_CR25","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11):1746\u20131758. https:\/\/doi.org\/10.1093\/bioinformatics\/bth163","journal-title":"Bioinformatics"},{"issue":"7","key":"691_CR26","doi-asserted-by":"publisher","first-page":"e68073","DOI":"10.1371\/journal.pone.0068073","volume":"8","author":"S Khakabimamaghani","year":"2013","unstructured":"Khakabimamaghani S, Sharafuddin I, Dichter N, Koch I, Masoudi-Nejad A (2013) Quatexelero: an accelerated exact network motif detection algorithm. PLoS ONE 8(7):e68073","journal-title":"PLoS ONE"},{"issue":"3","key":"691_CR27","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1090\/S0002-9939-1953-0055639-3","volume":"4","author":"J Kiefer","year":"1953","unstructured":"Kiefer J (1953) Sequential minimax search for a maximum. Proc Am Math Soc 4(3):502\u2013506","journal-title":"Proc Am Math Soc"},{"key":"691_CR28","doi-asserted-by":"crossref","unstructured":"Knerr S, Personnaz L, Dreyfus G (1990) Single-layer learning revisited: a stepwise procedure for building and training a neural network. In: Neurocomputing. Springer, pp 41\u201350","DOI":"10.1007\/978-3-642-76153-9_5"},{"key":"691_CR29","unstructured":"KONECT (2014) King James network dataset\u2014KONECT. http:\/\/konect.uni-koblenz.de\/networks\/moreno_names"},{"key":"691_CR30","unstructured":"KONECT (2015) Physicians network dataset\u2014KONECT. http:\/\/konect.uni-koblenz.de\/networks\/moreno_innovation"},{"key":"691_CR31","unstructured":"KONECT (2016a) Friendster network dataset\u2014KONECT. http:\/\/konect.uni-koblenz.de\/networks\/friendster"},{"key":"691_CR32","unstructured":"KONECT (2016b) Twitter (www) network dataset\u2014KONECT. http:\/\/konect.uni-koblenz.de\/networks\/twitter"},{"key":"691_CR33","unstructured":"KONECT (2016c) Wikipedia, english network dataset\u2014KONECT. http:\/\/konect.uni-koblenz.de\/networks\/dbpedia-link"},{"key":"691_CR34","unstructured":"KONECT (2016d) Wikipedia, nl (dynamic) network dataset\u2014KONECT. http:\/\/konect.uni-koblenz.de\/networks\/link-dynamic-nlwiki"},{"issue":"5","key":"691_CR35","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1002\/widm.1063","volume":"2","author":"KN Kontonasios","year":"2012","unstructured":"Kontonasios KN, Spyropoulou E, De Bie T (2012) Knowledge discovery interestingness measures based on unexpectedness. Wiley Interdiscip Rev Data Min Knowl Discov 2(5):386\u2013399","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"691_CR36","unstructured":"Koskas M, Grasseau G, Birmel\u00e9 E, Schbath S, Robin S (2011) Nemo: fast count of network motifs. Book of abstracts for Journ\u00e9es Ouvertes Biologie Informatique Math\u00e9matiques (JOBIM), pp 53\u201360"},{"issue":"3","key":"691_CR37","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/sam.11267","volume":"8","author":"D Koutra","year":"2015","unstructured":"Koutra D, Kang U, Vreeken J, Faloutsos C (2015) Summarizing and understanding large graphs. Stat Anal Data Min 8(3):183\u2013202. https:\/\/doi.org\/10.1002\/sam.11267","journal-title":"Stat Anal Data Min"},{"issue":"2","key":"691_CR38","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TIT.1981.1056331","volume":"27","author":"RE Krichevsky","year":"1981","unstructured":"Krichevsky RE, Trofimov VK (1981) The performance of universal encoding. IEEE Trans Inf Theory 27(2):199\u2013207","journal-title":"IEEE Trans Inf Theory"},{"key":"691_CR39","doi-asserted-by":"crossref","unstructured":"Kunegis J (2013) KONECT\u2014The Koblenz network collection. In: Proceedings international conference on world wide web companion, pp 1343\u20131350.http:\/\/userpages.uni-koblenz.de\/~kunegis\/paper\/kunegis-koblenz-network-collection.pdf","DOI":"10.1145\/2487788.2488173"},{"key":"691_CR40","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S (2010) What is Twitter, a social network or a news media? In: Proceedings International World Wide Web Conference, pp 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"issue":"12","key":"691_CR41","doi-asserted-by":"publisher","first-page":"e50093","DOI":"10.1371\/journal.pone.0050093","volume":"7","author":"X Li","year":"2012","unstructured":"Li X, Stones DS, Wang H, Deng H, Liu X, Wang G (2012) Netmode: network motif detection without nauty. PLoS ONE 7(12):e50093","journal-title":"PLoS ONE"},{"issue":"12","key":"691_CR42","doi-asserted-by":"publisher","first-page":"3077","DOI":"10.1109\/TKDE.2014.2320716","volume":"26","author":"Y Lim","year":"2014","unstructured":"Lim Y, Kang U, Faloutsos C (2014) Slashburn: graph compression and mining beyond Caveman communities. IEEE Trans Knowl Data Eng 26(12):3077\u20133089","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"691_CR43","unstructured":"McKay BD et al (1981) Practical graph isomorphism. Vanderbilt University Tennessee, US Department of Computer Science"},{"issue":"5","key":"691_CR44","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TCBB.2014.2321150","volume":"11","author":"LA Meira","year":"2014","unstructured":"Meira LA, M\u00e1ximo VR, Fazenda \u00c1L, Da Concei\u00e7\u00e3o AF (2014) Acc-motif: accelerated network motif detection. IEEE\/ACM Trans Comput Biol Bioinform (TCBB) 11(5):853\u2013862","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform (TCBB)"},{"issue":"5594","key":"691_CR45","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"issue":"5663","key":"691_CR46","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo R, Itzkovitz S, Kashtan N, Levitt R, Shen-Orr S, Ayzenshtat I, Sheffer M, Alon U (2004) Superfamilies of evolved and designed networks. Science 303(5663):1538\u20131542","journal-title":"Science"},{"key":"691_CR47","doi-asserted-by":"crossref","unstructured":"Navlakha S, Rastogi R, Shrivastava N (2008) Graph summarization with bounded error. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data. ACM, pp 419\u2013432","DOI":"10.1145\/1376616.1376661"},{"key":"691_CR48","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman M (2010) Networks: an introduction. Oxford University Press, Oxford"},{"issue":"1","key":"691_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-015-0256-2","volume":"5","author":"P Paredes","year":"2015","unstructured":"Paredes P, Ribeiro P (2015) Rand-fase: fast approximate subgraph census. Soc Netw Anal Min 5(1):1\u201318","journal-title":"Soc Netw Anal Min"},{"issue":"1","key":"691_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/cmb.2007.0137","volume":"15","author":"F Picard","year":"2008","unstructured":"Picard F, Daudin JJ, Koskas M, Schbath S, Robin S (2008) Assessing the exceptionality of network motifs. J Comput Biol 15(1):1\u201320","journal-title":"J Comput Biol"},{"key":"691_CR51","unstructured":"Preusse J, Kunegis J, Thimm M, Gottron T, Staab S (2013) Structural dynamics of knowledge networks. In: Proceedings international conference on weblogs and social media"},{"issue":"4","key":"691_CR52","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/jbiol36","volume":"5","author":"T Reguly","year":"2006","unstructured":"Reguly T, Breitkreutz A, Boucher L, Breitkreutz BJ, Hon GC, Myers CL, Parsons A, Friesen H, Oughtred R, Tong A et al (2006) Comprehensive curation and analysis of global interaction networks in Saccharomyces cerevisiae. J Biol 5(4):11","journal-title":"J Biol"},{"issue":"290\u2013297","key":"691_CR53","first-page":"5","volume":"6","author":"A Renyi","year":"1959","unstructured":"Renyi A, Erd\u0151s P (1959) On random graphs. Publ Math 6(290\u2013297):5","journal-title":"Publ Math"},{"key":"691_CR54","doi-asserted-by":"crossref","unstructured":"Ribeiro P, Silva F (2010) G-tries: an efficient data structure for discovering network motifs. In: Proceedings of the 2010 ACM symposium on applied computing. ACM, pp 1559\u20131566","DOI":"10.1145\/1774088.1774422"},{"issue":"5","key":"691_CR55","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen J (1978) Modeling by shortest data description. Automatica 14(5):465\u2013471","journal-title":"Automatica"},{"issue":"2","key":"691_CR56","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1147\/rd.232.0149","volume":"23","author":"J Rissanen","year":"1979","unstructured":"Rissanen J, Langdon GG (1979) Arithmetic coding. IBM J Res Dev 23(2):149\u2013162","journal-title":"IBM J Res Dev"},{"key":"691_CR57","doi-asserted-by":"crossref","unstructured":"Ristoski P, de\u00a0Vries GKD, Paulheim H (2016) A collection of benchmark datasets for systematic evaluations of machine learning on the semantic web. In: International semantic web conference. Springer, pp 186\u2013194","DOI":"10.1007\/978-3-319-46547-0_20"},{"key":"691_CR58","unstructured":"R\u00f6mhild C, Harrison C (2007). http:\/\/chrisharrison.net\/projects\/bibleviz\/index.html. Accessed 22 Sept 2014"},{"issue":"18","key":"691_CR59","doi-asserted-by":"publisher","first-page":"7327","DOI":"10.1073\/pnas.0611034104","volume":"104","author":"M Rosvall","year":"2007","unstructured":"Rosvall M, Bergstrom CT (2007) An information-theoretic framework for resolving community structure in complex networks. Proc Natl Acad Sci 104(18):7327\u20137331","journal-title":"Proc Natl Acad Sci"},{"key":"691_CR60","unstructured":"Schreiber F, Schwobbermeyer H (2004) Towards motif detection in networks: frequency concepts and flexible search. In: Proceedings International WSH network tools and applications in biology (NETTAB\u201904), pp 91\u2013102"},{"key":"691_CR61","doi-asserted-by":"crossref","unstructured":"Shah N, Koutra D, Zou T, Gallagher B, Faloutsos C (2015) Timecrunch: Interpretable dynamic graph summarization. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 1055\u20131064","DOI":"10.1145\/2783258.2783321"},{"key":"691_CR62","doi-asserted-by":"crossref","unstructured":"Slota GM, Madduri K (2013) Fast approximate subgraph counting and enumeration. In: 2013 42nd International conference on parallel processing (ICPP). IEEE, pp 210\u2013219","DOI":"10.1109\/ICPP.2013.30"},{"key":"691_CR63","doi-asserted-by":"crossref","unstructured":"Slota GM, Madduri K (2014) Complex network analysis using parallel approximate motif counting. In: Parallel and distributed processing symposium, 2014 IEEE 28th international. IEEE, pp 405\u2013414","DOI":"10.1109\/IPDPS.2014.50"},{"key":"691_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms5114","volume":"5","author":"G Strona","year":"2014","unstructured":"Strona G, Nappo D, Boccacci F, Fattorini S, San-Miguel-Ayanz J (2014) A fast and unbiased procedure to randomize ecological binary matrices with fixed row and column totals. Nat Commun 5:1\u20139","journal-title":"Nat Commun"},{"key":"691_CR65","doi-asserted-by":"crossref","unstructured":"Tsourakakis C, Bonchi F, Gionis A, Gullo F, Tsiarli M (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 104\u2013112","DOI":"10.1145\/2487575.2487645"},{"key":"691_CR66","doi-asserted-by":"publisher","unstructured":"van Leeuwen M, Vreeken J, Siebes A (2006) Compression picks item sets that matter. In: F\u00fcrnkranz J, Scheffer T, Spiliopoulou M (eds) Knowledge discovery in databases: PKDD 2006, 10th European conference on principles and practice of knowledge discovery in databases, Berlin, 18\u201322 Sept 2006, Proceedings, Springer, Lecture notes in computer science, vol 4213, pp 585\u2013592. https:\/\/doi.org\/10.1007\/11871637_59","DOI":"10.1007\/11871637_59"},{"issue":"1","key":"691_CR67","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10994-015-5539-3","volume":"105","author":"M van Leeuwen","year":"2016","unstructured":"van Leeuwen M, De Bie T, Spyropoulou E, Mesnage C (2016) Subjective interestingness of subgraph patterns. Mach Learn 105(1):41\u201375","journal-title":"Mach Learn"},{"key":"691_CR68","first-page":"25","volume":"28","author":"S van der Pas","year":"2018","unstructured":"van der Pas S, Gr\u00fcnwald P et al (2018) Almost the best of three worlds: risk, consistency and optional stopping for the switch criterion in nested model selection. Stat Sin 28:25","journal-title":"Stat Sin"},{"issue":"1","key":"691_CR69","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken J, Van Leeuwen M, Siebes A (2011) Krimp: mining itemsets that compress. Data Min Knowl Discov 23(1):169\u2013214","journal-title":"Data Min Knowl Discov"},{"key":"691_CR70","doi-asserted-by":"crossref","unstructured":"Wang Y, Ramon J (2012) An efficiently computable support measure for frequent subgraph pattern mining. In: Machine learning and knowledge discovery in databases, pp 362\u2013377","DOI":"10.1007\/978-3-642-33460-3_29"},{"issue":"2","key":"691_CR71","first-page":"8","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang P, Lui J, Ribeiro B, Towsley D, Zhao J, Guan X (2014) Efficiently estimating motif statistics of large networks. ACM Trans Knowl Discov Data (TKDD) 9(2):8","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"691_CR72","doi-asserted-by":"publisher","unstructured":"Wernicke S (2005) A faster algorithm for detecting network motifs. In: Casadio R, Myers G (eds) Algorithms in bioinformatics, 5th international workshop, WABI 2005, Mallorca, Spain, 3\u20136 Oct 2005, Proceedings, Springer, Lecture notes in computer science, vol 3692, pp 165\u2013177. https:\/\/doi.org\/10.1007\/11557067_14","DOI":"10.1007\/11557067_14"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00691-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-020-00691-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00691-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T00:31:29Z","timestamp":1624408289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-020-00691-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,23]]},"references-count":72,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["691"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00691-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2020,6,23]]},"assertion":[{"value":"13 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}