{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T22:52:54Z","timestamp":1776725574496,"version":"3.51.2"},"reference-count":229,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T00:00:00Z","timestamp":1656892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T00:00:00Z","timestamp":1656892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Eastern Finland (UEF) including Kuopio University Hospital"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Mining patterns is a core task in data analysis and, beyond issues of efficient enumeration, the selection of patterns constitutes a major challenge. The Minimum Description Length (MDL) principle, a model selection method grounded in information theory, has been applied to pattern mining with the aim to obtain compact high-quality sets of patterns. After giving an outline of relevant concepts from information theory and coding, we review MDL-based methods for mining different kinds of patterns from various types of data. Finally, we open a discussion on some issues regarding these methods.<\/jats:p>","DOI":"10.1007\/s10618-022-00846-z","type":"journal-article","created":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T12:11:17Z","timestamp":1656936677000},"page":"1679-1727","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The minimum description length principle for pattern mining: a survey"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2585-9252","authenticated-orcid":false,"given":"Esther","family":"Galbrun","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,4]]},"reference":[{"issue":"4","key":"846_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 Disc 33(4):1088\u20131124. https:\/\/doi.org\/10.1007\/s10618-019-00627-1","journal-title":"Data Min Knowl Disc"},{"key":"846_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases, VLDB\u201994, Morgan Kaufmann, pp 487\u2013499"},{"issue":"2","key":"846_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Rec 22(2):207\u2013216. https:\/\/doi.org\/10.1145\/170036.170072","journal-title":"ACM SIGMOD Rec"},{"key":"846_CR4","doi-asserted-by":"publisher","unstructured":"Akoglu L, Tong H, Meeder B, Faloutsos C (2012a) PICS: Parameter-free identification of cohesive subgroups in large attributed graphs. In: Proceedings of the 2012 SIAM International Conference on Data Mining, SDM\u201912, SIAM, pp 439\u2013450, https:\/\/doi.org\/10.1137\/1.9781611972825.38","DOI":"10.1137\/1.9781611972825.38"},{"key":"846_CR5","doi-asserted-by":"publisher","unstructured":"Akoglu L, Tong H, Vreeken J, Faloutsos C (2012b) Fast and reliable anomaly detection in categorical data. In: Proceedings of the 21st ACM international conference on Information and knowledge management, CIKM\u201912, ACM, pp 415\u2013424, https:\/\/doi.org\/10.1145\/2396761.2396816","DOI":"10.1145\/2396761.2396816"},{"key":"846_CR6","doi-asserted-by":"publisher","unstructured":"Akoglu L, Chau DH, Vreeken J, Tatti N, Tong H, Faloutsos C (2013) Mining connection pathways for marked nodes in large graphs. In: Proceedings of the 2013 SIAM International Conference on Data Mining, SDM\u201913, SIAM, pp 37\u201345, https:\/\/doi.org\/10.1137\/1.9781611972832.5","DOI":"10.1137\/1.9781611972832.5"},{"issue":"2","key":"846_CR7","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1086\/377106","volume":"73","author":"EC Anderson","year":"2003","unstructured":"Anderson EC, Novembre J (2003) Finding haplotype block boundaries by using the minimum-description-length principle. Am J Hum Genet 73(2):336\u2013354","journal-title":"Am J Hum Genet"},{"key":"846_CR8","doi-asserted-by":"publisher","unstructured":"Aoga JOR, Guns T, Nijssen S, Schaus P (2018) Finding probabilistic rule lists using the minimum description length principle. In: Proceedings of the International Conference on Discovery Science, DS\u201918, Springer, pp 66\u201382, https:\/\/doi.org\/10.1007\/978-3-030-01771-2_5","DOI":"10.1007\/978-3-030-01771-2_5"},{"key":"846_CR9","doi-asserted-by":"publisher","unstructured":"Araujo M, G\u00fcnnemann S, Mateos G, Faloutsos C (2014a) Beyond blocks: Hyperbolic community detection. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201914, Springer, pp 50\u201365, https:\/\/doi.org\/10.1007\/978-3-662-44848-9_4","DOI":"10.1007\/978-3-662-44848-9_4"},{"key":"846_CR10","doi-asserted-by":"publisher","unstructured":"Araujo M, Papadimitriou S, G\u00fcnnemann S, Faloutsos C, Basu P, Swami A, Papalexakis EE, Koutra D (2014b) Com2: Fast automatic discovery of temporal (\u2018comet\u2019) communities. In: Proceedings of 18th Pacific-Asia Conference on the Advances in Knowledge Discovery and Data Mining, PAKDD\u201914, Springer, pp 271\u2013283, https:\/\/doi.org\/10.1007\/978-3-319-06605-9_23","DOI":"10.1007\/978-3-319-06605-9_23"},{"issue":"3","key":"846_CR11","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s10115-015-0847-2","volume":"46","author":"M Araujo","year":"2016","unstructured":"Araujo M, G\u00fcnnemann S, Papadimitriou S, Faloutsos C, Basu P, Swami A, Papalexakis EE, Koutra D (2016) Discovery of \u201ccomet\u2019\u2019 communities in temporal and labeled graphs COM$$^2$$. Knowl Inf Syst 46(3):657\u2013677. https:\/\/doi.org\/10.1007\/s10115-015-0847-2","journal-title":"Knowl Inf Syst"},{"key":"846_CR12","unstructured":"Asadi B, Varadharajan V (2019a) An MDL-based classifier for transactional datasets with application in malware detection. arXiv:1910.03751"},{"key":"846_CR13","doi-asserted-by":"crossref","unstructured":"Asadi B, Varadharajan V (2019b) Towards a robust classifier: An MDL-based method for generating adversarial examples. arXiv:1912.05945","DOI":"10.1109\/TrustCom50675.2020.00108"},{"key":"846_CR14","unstructured":"Bariatti F (2021) Mining tractable sets of graph patterns with the minimum description length principle. Phd thesis, Universit\u00e9 de Rennes 1, https:\/\/hal.inria.fr\/tel-03523742"},{"key":"846_CR15","doi-asserted-by":"publisher","unstructured":"Bariatti F, Cellier P, Ferr\u00e9 S (2020a) GraphMDL: Graph pattern selection based on minimum description length. In: Proceedings of the 18th International Symposium on Advances in Intelligent Data Analysis, IDA\u201920, Springer, pp 54\u201366, https:\/\/doi.org\/10.1007\/978-3-030-44584-3_5","DOI":"10.1007\/978-3-030-44584-3_5"},{"key":"846_CR16","doi-asserted-by":"crossref","unstructured":"Bariatti F, Cellier P, Ferr\u00e9 S (2020b) GraphMDL visualizer: Interactive visualization of graph patterns. In: Proceedings of the Graph Embedding and Mining Workshop GEM@ECML\/PKDD\u201920, https:\/\/hal.inria.fr\/hal-03142207","DOI":"10.1145\/3412841.3441917"},{"key":"846_CR17","doi-asserted-by":"publisher","unstructured":"Bariatti F, Cellier P, Ferr\u00e9 S (2021) GraphMDL+: interleaving the generation and MDL-based selection of graph patterns. In: Proceedings of the 36th Annual ACM Symposium on Applied Computing, SAC\u201921, ACM, pp 355\u2013363, https:\/\/doi.org\/10.1145\/3412841.3441917","DOI":"10.1145\/3412841.3441917"},{"key":"846_CR18","doi-asserted-by":"crossref","unstructured":"Bastide Y, Pasquier N, Taouil R, Stumme G, Lakhal L (2000) Mining minimal non-redundant association rules using frequent closed itemsets. In: Proceedings of the First International Conference on Computational Logic, CL\u201900, Springer, pp 972\u2013986","DOI":"10.1007\/3-540-44957-4_65"},{"key":"846_CR19","doi-asserted-by":"publisher","unstructured":"Begum N, Hu B, Rakthanmanon T, Keogh E (2013) Towards a minimum description length based stopping criterion for semi-supervised time series classification. In: Proceedings of the 14th IEEE International Conference on Information Reuse Integration, IRI\u201913, IEEE Computer Society, pp 333\u2013340, https:\/\/doi.org\/10.1109\/IRI.2013.6642490","DOI":"10.1109\/IRI.2013.6642490"},{"key":"846_CR20","doi-asserted-by":"publisher","unstructured":"Begum N, Hu B, Rakthanmanon T, Keogh E (2014) A minimum description length technique for semi-supervised time series classification. Integration of Reusable Systems pp 171\u2013192, https:\/\/doi.org\/10.1007\/978-3-319-04717-1_8","DOI":"10.1007\/978-3-319-04717-1_8"},{"key":"846_CR21","doi-asserted-by":"publisher","unstructured":"Belth C, Zheng X, Vreeken J, Koutra D (2020) What is normal, what is strange, and what is missing in a knowledge graph: Unified characterization via inductive summarization. In: Proceedings of The Web Conference, WWW\u201920, ACM, pp 1115\u20131126, https:\/\/doi.org\/10.1145\/3366423.3380189","DOI":"10.1145\/3366423.3380189"},{"key":"846_CR22","unstructured":"Bertens R (2017) Insight in information : from abstract to anomaly. Phd thesis, Universiteit Utrecht, Netherland"},{"key":"846_CR23","doi-asserted-by":"publisher","unstructured":"Bertens R, Siebes A (2014) Characterising seismic data. In: Proceedings of the 2014 SIAM International Conference on Data Mining, SDM\u201914, SIAM, pp 884\u2013892, https:\/\/doi.org\/10.1137\/1.9781611973440.101","DOI":"10.1137\/1.9781611973440.101"},{"key":"846_CR24","unstructured":"Bertens R, Vreeken J, Siebes A (2015) Beauty and brains: Detecting anomalous pattern co-occurrences. arXiv:1512.07048"},{"key":"846_CR25","doi-asserted-by":"crossref","unstructured":"Bertens R, Vreeken J, Siebes A (2016) Keeping it short and simple: Summarising complex event sequences with multivariate patterns. In: Proceedings of the 22th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201916, ACM","DOI":"10.1145\/2939672.2939761"},{"key":"846_CR26","doi-asserted-by":"publisher","unstructured":"Bertens R, Vreeken J, Siebes A (2017) Efficiently discovering unexpected pattern-co-occurrences. In: Proceedings of the 2017 SIAM International Conference on Data Mining, SDM\u201917, SIAM, pp 126\u2013134, https:\/\/doi.org\/10.1137\/1.9781611974973.15","DOI":"10.1137\/1.9781611974973.15"},{"key":"846_CR27","doi-asserted-by":"crossref","unstructured":"Bhattacharyya A, Vreeken J (2017) Efficiently summarising event sequences with rich interleaving patterns. In: Proceedings of the 2017 SIAM International Conference on Data Mining, SDM\u201917, SIAM","DOI":"10.1137\/1.9781611974973.89"},{"issue":"6539","key":"846_CR28","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1126\/science.abd5110","volume":"372","author":"F Blanco","year":"2021","unstructured":"Blanco F, Calatayud J, Mart\u00edn-Perea DM, Domingo MS, Men\u00e9ndez I, M\u00fcller J, Fern\u00e1ndez MH, Cantalapiedra JL (2021) Punctuated ecological equilibrium in mammal communities over evolutionary time scales. Science 372(6539):300\u2013303. https:\/\/doi.org\/10.1126\/science.abd5110","journal-title":"Science"},{"key":"846_CR29","unstructured":"Bloem P (2013) Compression-based inference on graph data. In: Proceedings of the 22nd annual Belgian-Dutch Conference on Machine Learning, BENELEARN\u201913"},{"key":"846_CR30","unstructured":"Bloem P, de\u00a0Rooij S (2018) A tutorial on MDL hypothesis testing for graph analysis. arXiv:1810.13163"},{"issue":"5","key":"846_CR31","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1007\/s10618-020-00691-y","volume":"34","author":"P Bloem","year":"2020","unstructured":"Bloem P, de Rooij S (2020) Large-scale network motif analysis using compression. Data Min Knowl Disc 34(5):1421\u20131453. https:\/\/doi.org\/10.1007\/s10618-020-00691-y","journal-title":"Data Min Knowl Disc"},{"key":"846_CR32","doi-asserted-by":"crossref","unstructured":"Bobed C, Maillot P, Cellier P, Ferr\u00e9 S (2019) Data-driven assessment of structural evolution of RDF graphs. Semantic Web - Interoperability, Usability, Applicability","DOI":"10.3233\/SW-200368"},{"key":"846_CR33","doi-asserted-by":"crossref","unstructured":"Bohlin L, Edler D, Lancichinetti A, Rosvall M (2014) Community detection and visualization of networks with the map equation framework. In: Scholarly Measuring (ed) Ding Y, Rousseau R, Wolfram D. Impact, Methods and Practice, Springer International Publishing, pp 3\u201334","DOI":"10.1007\/978-3-319-10377-8_1"},{"key":"846_CR34","doi-asserted-by":"publisher","unstructured":"Boley M, Lucchese C, Paurat D, G\u00e4rtner T (2011) Direct local pattern sampling by efficient two-step random procedures. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201911, ACM, pp 582\u2013590, https:\/\/doi.org\/10.1145\/2020408.2020500","DOI":"10.1145\/2020408.2020500"},{"key":"846_CR35","doi-asserted-by":"publisher","unstructured":"Boley M, Mampaey M, Kang B, Tokmakov P, Wrobel S (2013) One click mining: Interactive local pattern discovery through implicit preference and performance learning. In: Proceedings of the Workshop on Interactive Data Exploration and Analytics, IDEA @KDD\u201913, ACM, pp 27\u201335, https:\/\/doi.org\/10.1145\/2501511.2501517","DOI":"10.1145\/2501511.2501517"},{"key":"846_CR36","doi-asserted-by":"crossref","unstructured":"Bonchi F, van Leeuwen M, Ukkonen A (2011) Characterizing uncertain data using compression. In: Proceedings of the 2011 SIAM International Conference on Data Mining, SDM\u201911, SIAM, pp 534\u2013545","DOI":"10.1137\/1.9781611972818.46"},{"key":"846_CR37","doi-asserted-by":"publisher","unstructured":"Bourrand E, Gal\u00e1rraga L, Galbrun E, Fromont E, Termier A (2021a) Discovering useful compact sets of sequential rules in a long sequence. In: Proceedings of the 2021 IEEE 33rd International Conference on Tools with Artificial Intelligence, ICTAI\u201921, IEEE Computer Society, pp 1295\u20131299, https:\/\/doi.org\/10.1109\/ICTAI52525.2021.00204","DOI":"10.1109\/ICTAI52525.2021.00204"},{"key":"846_CR38","doi-asserted-by":"crossref","unstructured":"Bourrand E, Gal\u00e1rraga L, Galbrun E, Fromont E, Termier A (2021b) Discovering useful compact sets of sequential rules in a long sequence. arXiv:2109.07519","DOI":"10.1109\/ICTAI52525.2021.00204"},{"key":"846_CR39","doi-asserted-by":"publisher","unstructured":"Budhathoki K, Vreeken J (2015) The difference and the norm \u2013 characterising similarities and differences between databases. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201915, Springer, vol 9285, pp 206\u2013223, https:\/\/doi.org\/10.1007\/978-3-319-23525-7_13","DOI":"10.1007\/978-3-319-23525-7_13"},{"key":"846_CR40","doi-asserted-by":"publisher","unstructured":"Budhathoki K, Vreeken J (2017a) Correlation by compression. In: Proceedings of the 2017 SIAM International Conference on Data Mining, SDM\u201917, SIAM, pp 525\u2013533, https:\/\/doi.org\/10.1137\/1.9781611974973.59","DOI":"10.1137\/1.9781611974973.59"},{"key":"846_CR41","doi-asserted-by":"publisher","unstructured":"Budhathoki K, Vreeken J (2017b) MDL for causal inference on discrete data. In: Proceedings of the 17th IEEE International Conference on Data Mining, ICDM\u201917, IEEE Computer Society, pp 751\u2013756, https:\/\/doi.org\/10.1109\/ICDM.2017.87","DOI":"10.1109\/ICDM.2017.87"},{"issue":"5","key":"846_CR42","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.100.052308","volume":"100","author":"J Calatayud","year":"2019","unstructured":"Calatayud J, Bernardo-Madrid R, Neuman M, Rojas A, Rosvall M (2019) Exploring the solution landscape enables more reliable network community detection. Phys Rev E 100(5):052308. https:\/\/doi.org\/10.1103\/PhysRevE.100.052308","journal-title":"Phys Rev E"},{"key":"846_CR43","doi-asserted-by":"publisher","unstructured":"Chakrabarti D (2004) AutoPart: Parameter-free graph partitioning and outlier detection. In: Proceedings of the European Conference on Knowledge Discovery in Databases, PKDD\u201904, Springer, pp 112\u2013124, https:\/\/doi.org\/10.1007\/978-3-540-30116-5_13","DOI":"10.1007\/978-3-540-30116-5_13"},{"key":"846_CR44","doi-asserted-by":"publisher","unstructured":"Chakrabarti D, Papadimitriou S, Modha DS, Faloutsos C (2004) Fully automatic cross-associations. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201904, ACM, pp 79\u201388, https:\/\/doi.org\/10.1145\/1014052.1014064","DOI":"10.1145\/1014052.1014064"},{"key":"846_CR45","doi-asserted-by":"crossref","unstructured":"Chen L, Amiri SE, Prakash BA (2018) Automatic segmentation of data sequences. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, AAAI\u201918, Association for the Advancement of Artificial Intelligence","DOI":"10.1609\/aaai.v32i1.11815"},{"issue":"1","key":"846_CR46","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1994","unstructured":"Cook DJ, Holder LB (1994) Substructure discovery using minimum description length and background knowledge. J Artifi Intell Res 1(1):231\u2013255","journal-title":"J Artifi Intell Res"},{"key":"846_CR47","doi-asserted-by":"crossref","unstructured":"Coupette C, Vreeken J (2021) Graph similarity description: How are these graphs similar? In: Proceedings of the 27th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201921, ACM","DOI":"10.1145\/3447548.3467257"},{"key":"846_CR48","volume-title":"Elements Of Information Theory","author":"TM Cover","year":"2012","unstructured":"Cover TM, Thomas JA (2012) Elements Of Information Theory. John Wiley & Sons, US"},{"key":"846_CR49","doi-asserted-by":"crossref","unstructured":"C\u00fcppers J, Vreeken J (2020) Just wait for it...mining sequential patterns with reliable prediction delays. In: Proceedings of the 20th IEEE International Conference on Data Mining, ICDM\u201920, IEEE Computer Society","DOI":"10.1109\/ICDM50108.2020.00017"},{"key":"846_CR50","unstructured":"Das SK, Cook DJ (2004) Health monitoring in an agent-based smart home. In: Proceedings of the International Conference on Smart Homes and Health Telematics, ICOST\u201904, IOS Press, pp 3\u201314"},{"key":"846_CR51","doi-asserted-by":"crossref","unstructured":"De Bie T, Kontonasios KN, Spyropoulou E (2010) A framework for mining interesting pattern sets. SIGKDD Explorations (and Proceedings of the ACM SIGKDD Workshop on Useful Patterns, UP\u201910) 12(2):92\u2013100","DOI":"10.1145\/1964897.1964920"},{"issue":"1","key":"846_CR52","doi-asserted-by":"publisher","first-page":"11027","DOI":"10.1103\/PhysRevX.5.011027","volume":"5","author":"M De Domenico","year":"2015","unstructured":"De Domenico M, Lancichinetti A, Arenas A, Rosvall M (2015) Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems. Phys Rev X 5(1):11027. https:\/\/doi.org\/10.1103\/PhysRevX.5.011027","journal-title":"Phys Rev X"},{"key":"846_CR53","doi-asserted-by":"publisher","unstructured":"De\u00a0Raedt L, Zimmermann A (2007) Constraint-based pattern set mining. In: Proceedings of the 2007 SIAM International Conference on Data Mining, SDM\u201907, SIAM, pp 237\u2013248, https:\/\/doi.org\/10.1137\/1.9781611972771.22","DOI":"10.1137\/1.9781611972771.22"},{"issue":"4","key":"846_CR54","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3390\/a10040112","volume":"10","author":"D Edler","year":"2017","unstructured":"Edler D, Bohlin L, Rosvall M (2017) Mapping higher-order network flows in memory and multilayer networks with infomap. Algorithms 10(4):112. https:\/\/doi.org\/10.3390\/a10040112","journal-title":"Algorithms"},{"issue":"2","key":"846_CR55","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1093\/sysbio\/syw087","volume":"66","author":"D Edler","year":"2017","unstructured":"Edler D, Guedes T, Zizka A, Rosvall M, Antonelli A (2017) Infomap bioregions: Interactive mapping of biogeographical regions from species distributions. Syst Biol 66(2):197\u2013204. https:\/\/doi.org\/10.1093\/sysbio\/syw087","journal-title":"Syst Biol"},{"issue":"2","key":"846_CR56","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.100.022301","volume":"100","author":"S Emmons","year":"2019","unstructured":"Emmons S, Mucha PJ (2019) Map equation with metadata: Varying the role of attributes in community detection. Phys Rev E 100(2):022301. https:\/\/doi.org\/10.1103\/PhysRevE.100.022301","journal-title":"Phys Rev E"},{"key":"846_CR57","unstructured":"Evans S, Saulnier G, Bush SF (2003) A new universal two part code for estimation of string kolmogorov complexity and algorithmic minimum sufficient statistic. In: Proceedings of the DIMACS Workshop on Complexity and Inference"},{"key":"846_CR58","doi-asserted-by":"publisher","unstructured":"Evans S, Markham TS, Torres A, Kourtidis A, Conklin D (2006) An improved minimum description length learning algorithm for nucleotide sequence analysis. In: Proceedings of the 2006 Fortieth Asilomar Conference on Signals, Systems and Computers, ACSSC\u201906, pp 1843\u20131850, https:\/\/doi.org\/10.1109\/ACSSC.2006.355081","DOI":"10.1109\/ACSSC.2006.355081"},{"key":"846_CR59","doi-asserted-by":"publisher","first-page":"43670","DOI":"10.1186\/1687-4153-2007-43670","volume":"1","author":"S Evans","year":"2007","unstructured":"Evans S, Kourtidis A, Markham TS, Miller J, Conklin DS, Torres AS (2007) MicroRNA target detection and analysis for genes related to breast cancer using MDLcompress. EURASIP J Bioinf Syst Biol 1:43670. https:\/\/doi.org\/10.1186\/1687-4153-2007-43670","journal-title":"EURASIP J Bioinf Syst Biol"},{"key":"846_CR60","doi-asserted-by":"publisher","unstructured":"Faas M, van Leeuwen M (2020) Vouw: Geometric pattern mining using the MDL principle. In: Proceedings of the 18th International Symposium on Advances in Intelligent Data Analysis, IDA\u201920, Springer, pp 158\u2013170, https:\/\/doi.org\/10.1007\/978-3-030-44584-3_13","DOI":"10.1007\/978-3-030-44584-3_13"},{"key":"846_CR61","unstructured":"Feng J (2015) Information-theoretic Graph Mining. Phd thesis, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, Germany"},{"key":"846_CR62","doi-asserted-by":"publisher","unstructured":"Feng J, He X, Konte B, B\u00f6hm C, Plant C (2012) Summarization-based mining bipartite graphs. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD\u201912, ACM, pp 1249\u20131257, https:\/\/doi.org\/10.1145\/2339530.2339725","DOI":"10.1145\/2339530.2339725"},{"key":"846_CR63","doi-asserted-by":"publisher","unstructured":"Feng J, He X, Hubig N, B\u00f6hm C, Plant C (2013) Compression-based graph mining exploiting structure primitives. In: Proceedings of the 13th IEEE International Conference on Data Mining, ICDM\u201913, IEEE Computer Society, pp 181\u2013190, https:\/\/doi.org\/10.1109\/ICDM.2013.56","DOI":"10.1109\/ICDM.2013.56"},{"key":"846_CR64","doi-asserted-by":"publisher","unstructured":"Fischer J, Vreeken J (2019) Sets of robust rules, and how to find them. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201919, ACM, pp 38\u201354, https:\/\/doi.org\/10.1007\/978-3-030-46150-8_3","DOI":"10.1007\/978-3-030-46150-8_3"},{"key":"846_CR65","doi-asserted-by":"crossref","unstructured":"Fischer J, Vreeken J (2020) Discovering succinct pattern sets expressing co-occurrence and mutual exclusivity. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201919, ACM","DOI":"10.1145\/3394486.3403124"},{"key":"846_CR66","unstructured":"Fischer J, Ol\u00e1h A, Vreeken J (2021) What\u2019s in the box? explaining neural networks with robust rules. In: Proceedings of the 38th International Conference on Machine Learning, ICML\u201921"},{"key":"846_CR67","doi-asserted-by":"crossref","unstructured":"Fowkes J, Sutton C (2016) A subsequence interleaving model for sequential pattern mining. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201916, ACM, pp 835\u2013844","DOI":"10.1145\/2939672.2939787"},{"key":"846_CR68","doi-asserted-by":"crossref","unstructured":"Galbrun E, Cellier P, Tatti N, Termier A, Cr\u00e9milleux B (2018) Mining periodic patterns with a MDL criterion. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201918, pp 535\u2013551","DOI":"10.1007\/978-3-030-10928-8_32"},{"key":"846_CR69","doi-asserted-by":"publisher","unstructured":"Gallo A, De Bie T, Cristianini N (2007) MINI: Mining informative non-redundant itemsets. In: Proceedings of the European Conference on Knowledge Discovery in Databases, PKDD\u201907, Springer, pp 438\u2013445, https:\/\/doi.org\/10.1007\/978-3-540-74976-9_44","DOI":"10.1007\/978-3-540-74976-9_44"},{"key":"846_CR70","doi-asserted-by":"publisher","unstructured":"Gautrais C, Cellier P, van Leeuwen M, Termier A (2020) Widening for MDL-based retail signature discovery. In: Proceedings of the 18th International Symposium on Advances in Intelligent Data Analysis, IDA\u201920, Springer, pp 197\u2013209, https:\/\/doi.org\/10.1007\/978-3-030-44584-3_16","DOI":"10.1007\/978-3-030-44584-3_16"},{"issue":"3","key":"846_CR71","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1132960.1132963","volume":"38","author":"L Geng","year":"2006","unstructured":"Geng L, Hamilton HJ (2006) Interestingness measures for data mining: A survey. ACM Comput Surv 38(3):9. https:\/\/doi.org\/10.1145\/1132960.1132963","journal-title":"ACM Comput Surv"},{"issue":"3","key":"846_CR72","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1297332.1297338","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis A, Mannila H, Mielik\u00e4inen T, Tsaparas P (2007) Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data 1(3):14. https:\/\/doi.org\/10.1145\/1297332.1297338","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"846_CR73","doi-asserted-by":"publisher","unstructured":"Goebl S, Tonch A, B\u00f6hm C, Plant C (2016) MeGS: Partitioning meaningful subgraph structures using minimum description length. In: Proceedings of the 16th IEEE International Conference on Data Mining, ICDM\u201916, IEEE Computer Society, pp 889\u2013894, https:\/\/doi.org\/10.1109\/ICDM.2016.0108","DOI":"10.1109\/ICDM.2016.0108"},{"key":"846_CR74","doi-asserted-by":"publisher","unstructured":"Greenspan G, Geiger D (2003) Model-based inference of haplotype block variation. In: Proceedings of the seventh annual international conference on Research in computational molecular biology, RECOMB\u201903, ACM, pp 131\u2013137, https:\/\/doi.org\/10.1145\/640075.640092","DOI":"10.1145\/640075.640092"},{"issue":"2","key":"846_CR75","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1089\/1066527041410300","volume":"11","author":"G Greenspan","year":"2004","unstructured":"Greenspan G, Geiger D (2004) Model-based inference of haplotype block variation. J Comput Biol 11(2):493\u2013504. https:\/\/doi.org\/10.1089\/1066527041410300","journal-title":"J Comput Biol"},{"key":"846_CR76","unstructured":"Grosse K, Vreeken J (2017) Summarising event sequences using serial episodes and an ontology. In: Proceedings of the Workshop on Interactions between Data Mining and Natural Language Processing @ECML\/PKDD\u201917"},{"key":"846_CR77","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The Minimum Description Length Principle","author":"PD Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald PD (2007) The Minimum Description Length Principle. MIT Press, Cambridge, MA"},{"issue":"12","key":"846_CR78","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T Guns","year":"2011","unstructured":"Guns T, Nijssen S, De Raedt L (2011) Itemset mining: A constraint programming perspective. Artif Intell 175(12):1951\u20131983","journal-title":"Artif Intell"},{"issue":"2","key":"846_CR79","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TKDE.2011.204","volume":"25","author":"T Guns","year":"2013","unstructured":"Guns T, Nijssen S, De Raedt L (2013) k-pattern set mining under constraints. IEEE Trans Knowl Data Eng 25(2):402\u2013418. https:\/\/doi.org\/10.1109\/TKDE.2011.204","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"846_CR80","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-018-0590-x","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2018","unstructured":"H\u00e4m\u00e4l\u00e4inen W, Webb GI (2018) A tutorial on statistically sound pattern discovery. Data Min Knowl Disc. https:\/\/doi.org\/10.1007\/s10618-018-0590-x","journal-title":"Data Min Knowl Disc"},{"key":"846_CR81","doi-asserted-by":"publisher","unstructured":"Hanhij\u00e4rvi S, Ojala M, Vuokko N, Puolam\u00e4ki K, Tatti N, Mannila H (2009) Tell me something i don\u2019t know: Randomization strategies for iterative data mining. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201909, ACM, pp 379\u2013388, https:\/\/doi.org\/10.1145\/1557019.1557065","DOI":"10.1145\/1557019.1557065"},{"key":"846_CR82","unstructured":"He J, Tong H, Papadimitriou S, Eliassi-Rad T, Faloutsos C, Carbonell J (2009) PaCK: Scalable parameter-free clustering on k-partite graphs. In: Proceedings of the 2006 SIAM International Conference on Data Mining, SDM\u201909, SIAM, pp 1278\u20131287"},{"key":"846_CR83","doi-asserted-by":"publisher","unstructured":"He X, Feng J, Plant C (2011) Automatically spotting information-rich nodes in graphs. In: Proceedings of the 11th IEEE International Conference on Data Mining Workshops, ICDMW\u201911, IEEE Computer Society, pp 941\u2013948, https:\/\/doi.org\/10.1109\/ICDMW.2011.37","DOI":"10.1109\/ICDMW.2011.37"},{"key":"846_CR84","doi-asserted-by":"publisher","unstructured":"He X, Feng J, Konte B, Mai ST, Plant C (2014) Relevant overlapping subspace clusters on categorical data. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD\u201914, ACM, pp 213\u2013222, https:\/\/doi.org\/10.1145\/2623330.2623652","DOI":"10.1145\/2623330.2623652"},{"key":"846_CR85","doi-asserted-by":"publisher","unstructured":"Heierman EO, Cook DJ (2003) Improving home automation by discovering regularly occurring device usage patterns. In: Proceedings of the 3rd IEEE International Conference on Data Mining, ICDM\u201903, IEEE Computer Society, pp 537\u2013540, https:\/\/doi.org\/10.1109\/ICDM.2003.1250971","DOI":"10.1109\/ICDM.2003.1250971"},{"key":"846_CR86","unstructured":"Heierman EO, Youngblood GM, Cook DJ (2004) Mining temporal sequences to discover interesting patterns. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201919, ACM"},{"key":"846_CR87","doi-asserted-by":"publisher","unstructured":"Heikinheimo H, Siebes A, Vreeken J, Mannila H (2009) Low-entropy set selection. In: Proceedings of the 2009 SIAM International Conference on Data Mining, SDM\u201909, SIAM, pp 569\u2013580, https:\/\/doi.org\/10.1137\/1.9781611972795.49","DOI":"10.1137\/1.9781611972795.49"},{"key":"846_CR88","unstructured":"Hess S, Piatkowski N, Morik K (2014) SHrimp: Descriptive patterns in a tree. In: Proceedings of the LWA (Lernen, Wissen, Adaption) 2014 Workshops: KDML, IR, FGWM"},{"issue":"4","key":"846_CR89","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1007\/s10618-017-0508-z","volume":"31","author":"S Hess","year":"2017","unstructured":"Hess S, Morik K, Piatkowski N (2017) The PRIMPING routine - tiling through proximal alternating linearized minimization. Data Min Knowl Disc 31(4):1090\u20131131. https:\/\/doi.org\/10.1007\/s10618-017-0508-z","journal-title":"Data Min Knowl Disc"},{"key":"846_CR90","unstructured":"Hinrichs F, Vreeken J (2017) Characterising the difference and the norm between sequence databases. In: Proceedings of the Workshop on Interactions between Data Mining and Natural Language Processing @ECML\/PKDD\u201917"},{"key":"846_CR91","doi-asserted-by":"publisher","unstructured":"Hu B, Rakthanmanon T, Hao Y, Evans S, Lonardi S, Keogh E (2011) Discovering the intrinsic cardinality and dimensionality of time series using MDL. In: Proceedings of the 11th IEEE International Conference on Data Mining, ICDM\u201911, IEEE Computer Society, pp 1086\u20131091, https:\/\/doi.org\/10.1109\/ICDM.2011.54","DOI":"10.1109\/ICDM.2011.54"},{"key":"846_CR92","doi-asserted-by":"publisher","unstructured":"Hu B, Rakthanmanon T, Hao Y, Evans S, Lonardi S, Keogh E (2013) Towards discovering the intrinsic cardinality and dimensionality of time series using MDL. In: Proceedings of the Ray Solomonoff 85th Memorial Conference, Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence, Springer, pp 184\u2013197, https:\/\/doi.org\/10.1007\/978-3-642-44958-1_14","DOI":"10.1007\/978-3-642-44958-1_14"},{"issue":"2","key":"846_CR93","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s10618-014-0345-2","volume":"29","author":"B Hu","year":"2015","unstructured":"Hu B, Rakthanmanon T, Hao Y, Evans S, Lonardi S, Keogh E (2015) Using the minimum description length to discover the intrinsic cardinality and dimensionality of time series. Data Min Knowl Disc 29(2):358\u2013399. https:\/\/doi.org\/10.1007\/s10618-014-0345-2","journal-title":"Data Min Knowl Disc"},{"issue":"2","key":"846_CR94","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10115-015-0854-3","volume":"47","author":"A Ibrahim","year":"2016","unstructured":"Ibrahim A, Sastry S, Sastry PS (2016) Discovering compressing serial episodes from event sequences. Knowl Inf Syst 47(2):405\u2013432. https:\/\/doi.org\/10.1007\/s10115-015-0854-3","journal-title":"Knowl Inf Syst"},{"key":"846_CR95","doi-asserted-by":"publisher","unstructured":"Jaroszewicz S, Simovici DA (2004) Interestingness of frequent itemsets using bayesian networks as background knowledge. In: Proceedings of the 10th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD\u201904, ACM, pp 178\u2013186, https:\/\/doi.org\/10.1145\/1014052.1014074","DOI":"10.1145\/1014052.1014074"},{"key":"846_CR96","doi-asserted-by":"publisher","unstructured":"Jiang M, Faloutsos C, Han J (2016) CatchTartan: Representing and summarizing dynamic multicontextual behaviors. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201916, ACM, pp 945\u2013954, https:\/\/doi.org\/10.1145\/2939672.2939749","DOI":"10.1145\/2939672.2939749"},{"issue":"1","key":"846_CR97","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1142\/S0218213004001429","volume":"13","author":"I Jonyer","year":"2004","unstructured":"Jonyer I, Holder LB, Cook DJ (2004) Mdl-based context-free graph grammar induction and applications. Int J Artif Intell Tools 13(1):65\u201379. https:\/\/doi.org\/10.1142\/S0218213004001429","journal-title":"Int J Artif Intell Tools"},{"key":"846_CR98","doi-asserted-by":"publisher","unstructured":"Kameya Y (2011) Time series discretization via MDL-based histogram density estimation. In: Proceedings of the 23rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI\u201911, IEEE Computer Society, pp 732\u2013739, https:\/\/doi.org\/10.1109\/ICTAI.2011.115","DOI":"10.1109\/ICTAI.2011.115"},{"key":"846_CR99","doi-asserted-by":"publisher","unstructured":"Kang U, Faloutsos C (2011) Beyond \u2018caveman communities\u2019: Hubs and spokes for graph compression and mining. In: Proceedings of the 11th IEEE International Conference on Data Mining, ICDM\u201911, IEEE Computer Society, pp 300\u2013309, https:\/\/doi.org\/10.1109\/ICDM.2011.26","DOI":"10.1109\/ICDM.2011.26"},{"key":"846_CR100","doi-asserted-by":"publisher","unstructured":"Ketkar NS, Holder LB, Cook DJ (2005) Subdue: compression-based frequent pattern discovery in graph data. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, OSDM\u201905, ACM, pp 71\u201376, https:\/\/doi.org\/10.1145\/1133905.1133915","DOI":"10.1145\/1133905.1133915"},{"key":"846_CR101","doi-asserted-by":"publisher","unstructured":"Khan KU (2015) Set-based approach for lossless graph summarization using locality sensitive hashing. In: Proceedings of the 31st IEEE International Conference on Data Engineering Workshops, ICDEW\u201915, IEEE Computer Society, pp 255\u2013259, https:\/\/doi.org\/10.1109\/ICDEW.2015.7129586","DOI":"10.1109\/ICDEW.2015.7129586"},{"key":"846_CR102","doi-asserted-by":"publisher","unstructured":"Khan KU, Nawaz W, Lee YK (2014) Set-based unified approach for attributed graph summarization. In: Proceedings of the 4th IEEE International Conference on Big Data and Cloud Computing, BDCloud\u201914, IEEE Computer Society, pp 378\u2013385, https:\/\/doi.org\/10.1109\/BDCloud.2014.108","DOI":"10.1109\/BDCloud.2014.108"},{"key":"846_CR103","doi-asserted-by":"publisher","unstructured":"Khan KU, Nawaz W, Lee YK (2015a) Lossless graph summarization using dense subgraphs discovery. In: Proceedings of the 9th International Conference on Ubiquitous Information Management and Communication, IMCOM\u201915, ACM, pp 1\u20137, https:\/\/doi.org\/10.1145\/2701126.2701157","DOI":"10.1145\/2701126.2701157"},{"issue":"12","key":"846_CR104","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s00607-015-0454-9","volume":"97","author":"KU Khan","year":"2015","unstructured":"Khan KU, Nawaz W, Lee YK (2015) Set-based approximate approach for lossless graph summarization. Computing 97(12):1185\u20131207. https:\/\/doi.org\/10.1007\/s00607-015-0454-9","journal-title":"Computing"},{"key":"846_CR105","doi-asserted-by":"publisher","unstructured":"Kiernan J, Terzi E (2008) Constructing comprehensive summaries of large event sequences. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201908, ACM, pp 417\u2013425, https:\/\/doi.org\/10.1145\/1401890.1401943","DOI":"10.1145\/1401890.1401943"},{"issue":"4","key":"846_CR106","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/1631162.1631169","volume":"3","author":"J Kiernan","year":"2009","unstructured":"Kiernan J, Terzi E (2009) Constructing comprehensive summaries of large event sequences. ACM Transactions on Knowledge Discovery from Data 3(4):21:1-21:31. https:\/\/doi.org\/10.1145\/1631162.1631169","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"846_CR107","doi-asserted-by":"publisher","unstructured":"Kiernan J, Terzi E (2009b) EventSummarizer: A tool for summarizing large event sequences. In: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT\u201909, ACM, pp 1136\u20131139, https:\/\/doi.org\/10.1145\/1516360.1516497","DOI":"10.1145\/1516360.1516497"},{"key":"846_CR108","doi-asserted-by":"publisher","unstructured":"Koivisto M, Perola M, Varilo T, Hennah W, Ekelund J, Lukk M, Peltonen L, Ukkonen E, Mannila H (2002) An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries. In: Proceedings of the 2003 Pacific Symposium on Biocomputing, PSB\u201903, World Scientific, pp 502\u2013513, https:\/\/doi.org\/10.1142\/9789812776303_0047","DOI":"10.1142\/9789812776303_0047"},{"key":"846_CR109","unstructured":"Kontkanen P, Myllym\u00e4ki P (2007) MDL histogram density estimation. In: Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, AISTATS\u201907, pp 219\u2013226"},{"key":"846_CR110","doi-asserted-by":"crossref","unstructured":"Kontonasios KN, De Bie T (2012) Formalizing complex prior information to quantify subjective interestingness of frequent pattern sets. In: Proceedings of the 11th International Symposium on Advances in Intelligent Data Analysis, IDA\u201912, Springer, pp 161\u2013171","DOI":"10.1007\/978-3-642-34156-4_16"},{"key":"846_CR111","doi-asserted-by":"crossref","unstructured":"Kontonasios KN, Vreeken J, De Bie T (2013) Maximum entropy models for iteratively identifying subjectively interesting structure in real-valued data. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201913, Springer, pp 256\u2013271","DOI":"10.1007\/978-3-642-40991-2_17"},{"key":"846_CR112","doi-asserted-by":"publisher","unstructured":"Koopman A, Siebes A (2008) Discovering relational item sets efficiently. In: Proceedings of the 2008 SIAM International Conference on Data Mining, SDM\u201908, SIAM, pp 108\u2013119, https:\/\/doi.org\/10.1137\/1.9781611972788.10","DOI":"10.1137\/1.9781611972788.10"},{"key":"846_CR113","doi-asserted-by":"publisher","unstructured":"Koopman A, Siebes A (2009) Characteristic relational patterns. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201909, ACM, pp 437\u2013446, https:\/\/doi.org\/10.1145\/1557019.1557071","DOI":"10.1145\/1557019.1557071"},{"key":"846_CR114","doi-asserted-by":"publisher","unstructured":"Koutra D, Kang U, Vreeken J, Faloutsos C (2014) VOG: Summarizing and understanding large graphs. In: Proceedings of the 2014 SIAM International Conference on Data Mining, SDM\u201914, SIAM, pp 91\u201399, https:\/\/doi.org\/10.1137\/1.9781611973440.11","DOI":"10.1137\/1.9781611973440.11"},{"issue":"3","key":"846_CR115","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. Statistical Analysis and Data Mining 8(3):183\u2013202","journal-title":"Statistical Analysis and Data Mining"},{"key":"846_CR116","doi-asserted-by":"crossref","unstructured":"Lakshmanan LVS, Ng RT, Wang CX, Zhou X, Johnson TJ (2002) The generalized MDL approach for summarization. In: Proceedings of the 28th international conference on Very Large Data Bases, VLDB\u201902, VLDB Endowment, pp 766\u2013777","DOI":"10.1016\/B978-155860869-6\/50073-1"},{"key":"846_CR117","doi-asserted-by":"publisher","unstructured":"Lam HT, M\u00f6rchen F, Fradkin D, Calders T (2012) Mining compressing sequential patterns. In: Proceedings of the 2012 SIAM International Conference on Data Mining, SDM\u201912, SIAM, pp 319\u2013330, https:\/\/doi.org\/10.1137\/1.9781611972825.28","DOI":"10.1137\/1.9781611972825.28"},{"key":"846_CR118","doi-asserted-by":"publisher","unstructured":"Lam HT, Calders T, Yang J, M\u00f6rchen F, Fradkin D (2013) Zips: Mining compressing sequential patterns in streams. In: Proceedings of the Workshop on Interactive Data Exploration and Analytics, IDEA @KDD\u201913, ACM, pp 54\u201362, https:\/\/doi.org\/10.1145\/2501511.2501520","DOI":"10.1145\/2501511.2501520"},{"key":"846_CR119","unstructured":"Lam HT, Kiseleva J, Pechenizkiy M, Calders T (2014a) Decomposing a sequence into independent subsequences using compression algorithms. In: Proceedings of the Workshop on Interactive Data Exploration and Analytic, IDEA @KDD\u201914, pp 67\u201375"},{"issue":"1","key":"846_CR120","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/sam.11192","volume":"7","author":"HT Lam","year":"2014","unstructured":"Lam HT, M\u00f6rchen F, Fradkin D, Calders T (2014) Mining compressing sequential patterns. Stat Anal Data Mining 7(1):34\u201352. https:\/\/doi.org\/10.1002\/sam.11192","journal-title":"Stat Anal Data Mining"},{"key":"846_CR121","doi-asserted-by":"publisher","unstructured":"Lee K, Jo H, Ko J, Lim S, Shin K (2020) SSumM: Sparse summarization of massive graphs. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201920, ACM, pp 144\u2013154, https:\/\/doi.org\/10.1145\/3394486.3403057","DOI":"10.1145\/3394486.3403057"},{"key":"846_CR122","doi-asserted-by":"publisher","unstructured":"LeFevre K, Terzi E (2010) GraSS: Graph structure summarization. In: Proceedings of the 2010 SIAM International Conference on Data Mining, SDM\u201910, SIAM, pp 454\u2013465, https:\/\/doi.org\/10.1137\/1.9781611972801.40","DOI":"10.1137\/1.9781611972801.40"},{"issue":"12","key":"846_CR123","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. https:\/\/doi.org\/10.1109\/TKDE.2014.2320716","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"846_CR124","unstructured":"Liu Y, Shah N, Koutra D (2015) An empirical comparison of the summarization power of graph clustering methods. arXiv:1511.06820"},{"key":"846_CR125","unstructured":"Liu Y, Safavi T, Shah N (2016) Reducing million-node graphs to a few structural patterns: A unified approach. In: Proceedings of the 12th International Workshop on Mining and Learning with Graphs, MLG @KDD\u201916, p\u00a08"},{"issue":"3","key":"846_CR126","doi-asserted-by":"publisher","first-page":"62:1","DOI":"10.1145\/3186727","volume":"51","author":"Y Liu","year":"2018","unstructured":"Liu Y, Safavi T, Dighe A, Koutra D (2018) Graph summarization methods and applications: A survey. ACM Computing Surveys 51(3):62:1-62:34. https:\/\/doi.org\/10.1145\/3186727","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"846_CR127","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s13278-018-0491-4","volume":"8","author":"Y Liu","year":"2018","unstructured":"Liu Y, Safavi T, Shah N, Koutra D (2018) Reducing large graphs to small supergraphs: a unified approach. Soc Netw Anal Min 8(1):17. https:\/\/doi.org\/10.1007\/s13278-018-0491-4","journal-title":"Soc Netw Anal Min"},{"key":"846_CR128","doi-asserted-by":"publisher","unstructured":"Lucchese C, Orlando S, Perego R (2010a) A generative pattern model for mining binary datasets. In: Proceedings of the 2010 ACM Symposium on Applied Computing, SAC\u201910, ACM, pp 1109\u20131110, https:\/\/doi.org\/10.1145\/1774088.1774320","DOI":"10.1145\/1774088.1774320"},{"key":"846_CR129","doi-asserted-by":"publisher","unstructured":"Lucchese C, Orlando S, Perego R (2010b) Mining top-k patterns from binary datasets in presence of noise. In: Proceedings of the 2007 SIAM International Conference on Data Mining, SDM\u201907, SIAM, pp 165\u2013176, https:\/\/doi.org\/10.1137\/1.9781611972801.15","DOI":"10.1137\/1.9781611972801.15"},{"issue":"12","key":"846_CR130","doi-asserted-by":"publisher","first-page":"2900","DOI":"10.1109\/TKDE.2013.181","volume":"26","author":"C Lucchese","year":"2014","unstructured":"Lucchese C, Orlando S, Perego R (2014) A unifying framework for mining approximate top-$$k$$ binary patterns. IEEE Trans Knowl Data Eng 26(12):2900\u20132913. https:\/\/doi.org\/10.1109\/TKDE.2013.181","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"846_CR131","unstructured":"Makhalova T (2021) Contributions to pattern set mining : from complex datasets to significant and useful pattern sets. Phd thesis, Universit\u00e9 de Lorraine, https:\/\/hal.univ-lorraine.fr\/tel-03342124"},{"key":"846_CR132","doi-asserted-by":"crossref","unstructured":"Makhalova T, Trnecka M (2019) From-below boolean matrix factorization algorithm based on MDL. arXiv:1901.09567","DOI":"10.1007\/s11634-019-00383-6"},{"issue":"1","key":"846_CR133","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s11634-019-00383-6","volume":"15","author":"T Makhalova","year":"2021","unstructured":"Makhalova T, Trnecka M (2021) From-below boolean matrix factorization algorithm based on MDL. Adv Data Anal Classif 15(1):37\u201356. https:\/\/doi.org\/10.1007\/s11634-019-00383-6","journal-title":"Adv Data Anal Classif"},{"key":"846_CR134","unstructured":"Makhalova T, Kuznetsov SO, Napoli A (2018a) A first study on what MDL can do for FCA. In: Proceedings of the Fifteen International Conference on Concept Lattices and Their Applications, CLA\u201918, pp 25\u201336"},{"key":"846_CR135","unstructured":"Makhalova T, Kuznetsov SO, Napoli A (2018b) MDL for FCA: Is there a place for background knowledge? In: Proceedings of the 6th International Workshop \u201cWhat can FCA do for Artificial Intelligence?\u201d @ IJCAI\/ECAI\u201918, CEUR Workshop Proceedings, vol 2149, pp 45\u201356, http:\/\/ceur-ws.org\/Vol-2149\/paper5.pdf"},{"key":"846_CR136","doi-asserted-by":"publisher","unstructured":"Makhalova T, Kuznetsov SO, Napoli A (2019a) Numerical pattern mining through compression. In: Proceedings of the Data Compression Conference, DCC\u201919, pp 112\u2013121, https:\/\/doi.org\/10.1109\/DCC.2019.00019","DOI":"10.1109\/DCC.2019.00019"},{"key":"846_CR137","doi-asserted-by":"publisher","unstructured":"Makhalova T, Kuznetsov SO, Napoli A (2019b) On coupling FCA and MDL in pattern mining. In: Proceedings of the international conference on Formal Concept Analysis, FCA\u201919, Springer, pp 332\u2013340, https:\/\/doi.org\/10.1007\/978-3-030-21462-3_23","DOI":"10.1007\/978-3-030-21462-3_23"},{"key":"846_CR138","doi-asserted-by":"crossref","unstructured":"Makhalova T, Kuznetsov SO, Napoli A (2020) Mint: MDL-based approach for mining INTeresting numerical pattern sets. arXiv:2011.14843","DOI":"10.1007\/s10618-021-00799-9"},{"key":"846_CR139","unstructured":"Makhalova T, Kuznetsov SO, Napoli A (2021) Likely-occurring itemsets for pattern mining. In: Proceedings of the 6th International Workshop \u201cWhat can FCA do for Artificial Intelligence?\u201d @ IJCAI\u201921, CEUR Workshop Proceedings, vol 2972, pp 39\u201350, http:\/\/ceur-ws.org\/Vol-2972\/paper4.pdf"},{"issue":"1","key":"846_CR140","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/s10618-021-00799-9","volume":"36","author":"T Makhalova","year":"2022","unstructured":"Makhalova T, Kuznetsov SO, Napoli A (2022) Mint: MDL-based approach for mining INTeresting numerical pattern sets. Data Min Knowl Disc 36(1):108\u2013145. https:\/\/doi.org\/10.1007\/s10618-021-00799-9","journal-title":"Data Min Knowl Disc"},{"key":"846_CR141","doi-asserted-by":"publisher","unstructured":"Mampaey M (2010) Mining non-redundant information-theoretic dependencies between itemsets. In: Proceedings of the 12th International Conference on Data Warehousing and Knowledge Discovery, DaWaK\u201910, Springer, pp 130\u2013141, https:\/\/doi.org\/10.1007\/978-3-642-15105-7_11","DOI":"10.1007\/978-3-642-15105-7_11"},{"key":"846_CR142","doi-asserted-by":"publisher","unstructured":"Mampaey M, Vreeken J (2010) Summarising data by clustering items. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201910, pp 321\u2013336, https:\/\/doi.org\/10.1007\/978-3-642-15883-4_21","DOI":"10.1007\/978-3-642-15883-4_21"},{"issue":"1","key":"846_CR143","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s10618-011-0246-6","volume":"26","author":"M Mampaey","year":"2013","unstructured":"Mampaey M, Vreeken J (2013) Summarizing categorical data by clustering attributes. Data Min Knowl Disc 26(1):130\u2013173. https:\/\/doi.org\/10.1007\/s10618-011-0246-6","journal-title":"Data Min Knowl Disc"},{"key":"846_CR144","doi-asserted-by":"publisher","unstructured":"Mampaey M, Tatti N, Vreeken J (2011) Tell me what i need to know: succinctly summarizing data with itemsets. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201911, ACM, pp 573\u2013581, https:\/\/doi.org\/10.1145\/2020408.2020499","DOI":"10.1145\/2020408.2020499"},{"issue":"4","key":"846_CR145","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/2382577.2382580","volume":"6","author":"M Mampaey","year":"2012","unstructured":"Mampaey M, Vreeken J, Tatti N (2012) Summarizing data succinctly with the most informative itemsets. ACM Transactions on Knowledge Discovery from Data 6(4):16:1-16:42. https:\/\/doi.org\/10.1145\/2382577.2382580","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"846_CR146","unstructured":"Mannila H, Toivonen H, Verkamo AI (1994) Efficient algorithms for discovering association rules. In: Proceedings of the KDD Workshop, Association for the Advancement of Artificial Intelligence, pp 181\u2013192"},{"issue":"1","key":"846_CR147","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1086\/376438","volume":"73","author":"H Mannila","year":"2003","unstructured":"Mannila H, Koivisto M, Perola M, Varilo T, Hennah W, Ekelund J, Lukk M, Peltonen L, Ukkonen E (2003) Minimum description length block finder, a method to identify haplotype blocks and to compare the strength of block boundaries. The American Journal of Human Genetics 73(1):86\u201394. https:\/\/doi.org\/10.1086\/376438","journal-title":"The American Journal of Human Genetics"},{"key":"846_CR148","doi-asserted-by":"publisher","unstructured":"Markham TS, Evans S, Impson J, Steinbrecher E (2009) Implementation of an incremental MDL-based two part compression algorithm for model inference. In: Proceedings of the 2009 Data Compression Conference, DCC\u201909, pp 322\u2013331, https:\/\/doi.org\/10.1109\/DCC.2009.66","DOI":"10.1109\/DCC.2009.66"},{"key":"846_CR149","doi-asserted-by":"publisher","unstructured":"Matsubara Y, Sakurai Y, Faloutsos C (2014) AutoPlait: automatic mining of co-evolving time sequences. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD\u201914, ACM, pp 193\u2013204, https:\/\/doi.org\/10.1145\/2588555.2588556","DOI":"10.1145\/2588555.2588556"},{"key":"846_CR150","doi-asserted-by":"publisher","unstructured":"Miettinen P, Vreeken J (2011) Model order selection for boolean matrix factorization. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD\u201911, ACM, pp 51\u201359, https:\/\/doi.org\/10.1145\/2020408.2020424","DOI":"10.1145\/2020408.2020424"},{"issue":"4","key":"846_CR151","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2601437","volume":"8","author":"P Miettinen","year":"2014","unstructured":"Miettinen P, Vreeken J (2014) MDL4BMF: Minimum description length for boolean matrix factorization. ACM Transactions on Knowledge Discovery from Data 8(4):18:1-18:31. https:\/\/doi.org\/10.1145\/2601437","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"846_CR152","unstructured":"Mitra S, Sastry PS (2019) Summarizing event sequences with serial episodes: A statistical model and an application. arXiv:1904.00516"},{"key":"846_CR153","doi-asserted-by":"publisher","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, SIGMOD\u201908, ACM, pp 419\u2013432, https:\/\/doi.org\/10.1145\/1376616.1376661","DOI":"10.1145\/1376616.1376661"},{"issue":"5","key":"846_CR154","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1007\/s10618-014-0350-5","volume":"28","author":"HV Nguyen","year":"2014","unstructured":"Nguyen HV, M\u00fcller E, Vreeken J, B\u00f6hm K (2014) Unsupervised interaction-preserving discretization of multivariate data. Data Min Knowl Disc 28(5):1366\u20131397. https:\/\/doi.org\/10.1007\/s10618-014-0350-5","journal-title":"Data Min Knowl Disc"},{"key":"846_CR155","unstructured":"Otaki K, Yamamoto A (2015) Edit operations on lattices for MDL-based pattern summarization. In: Proceedings of the International Workshop on Formal Concept Analysis and Applications @ICFCA\u201915"},{"key":"846_CR156","doi-asserted-by":"publisher","unstructured":"Papadimitriou S, Gionis A, Tsaparas P, V\u00e4is\u00e4nen RA, Mannila H, Faloutsos C (2005) Parameter-free spatial data mining using MDL. In: Proceedings of the 5th IEEE International Conference on Data Mining, ICDM\u201905, IEEE Computer Society, pp 346\u2013353, https:\/\/doi.org\/10.1109\/ICDM.2005.117","DOI":"10.1109\/ICDM.2005.117"},{"key":"846_CR157","doi-asserted-by":"publisher","unstructured":"Papadimitriou S, Sun J, Faloutsos C, Yu PS (2008) Hierarchical, parameter-free community discovery. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201908, Springer, pp 170\u2013187, https:\/\/doi.org\/10.1007\/978-3-540-87481-2_12","DOI":"10.1007\/978-3-540-87481-2_12"},{"key":"846_CR158","doi-asserted-by":"publisher","unstructured":"Phan NH, Ienco D, Poncelet P, Teisseire M (2013) Mining representative movement patterns through compression. In: Advances in Knowledge Discovery and Data Mining, Springer, pp 314\u2013326, https:\/\/doi.org\/10.1007\/978-3-642-37453-1_26","DOI":"10.1007\/978-3-642-37453-1_26"},{"key":"846_CR159","doi-asserted-by":"publisher","unstructured":"Plant C, Biedermann S, B\u00f6hm C (2020) Data compression as a comprehensive framework for graph drawing and representation learning. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201920, ACM, pp 1212\u20131222, https:\/\/doi.org\/10.1145\/3394486.3403174","DOI":"10.1145\/3394486.3403174"},{"issue":"1","key":"846_CR160","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-013-0671-5","volume":"38","author":"BA Prakash","year":"2014","unstructured":"Prakash BA, Vreeken J, Faloutsos C (2014) Efficiently spotting the starting points of an epidemic in a large graph. Knowl Inf Syst 38(1):35\u201359. https:\/\/doi.org\/10.1007\/s10115-013-0671-5","journal-title":"Knowl Inf Syst"},{"key":"846_CR161","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.ins.2019.10.050","volume":"512","author":"HM Proen\u00e7a","year":"2020","unstructured":"Proen\u00e7a HM, van Leeuwen M (2020) Interpretable multiclass classification by MDL-based rule lists. Inf Sci 512:1372\u20131393. https:\/\/doi.org\/10.1016\/j.ins.2019.10.050","journal-title":"Inf Sci"},{"key":"846_CR162","doi-asserted-by":"crossref","unstructured":"Proen\u00e7a HM, van Leeuwen M (2020b) Interpretable multiclass classification by MDL-based rule lists. arXiv:1905.00328","DOI":"10.1016\/j.ins.2019.10.050"},{"key":"846_CR163","doi-asserted-by":"crossref","unstructured":"Proen\u00e7a HM, Gr\u00fcnwald PD, B\u00e4ck T, van Leeuwen M (2020) Discovering outstanding subgroup lists for numeric targets using MDL. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201920","DOI":"10.1007\/978-3-030-67658-2_2"},{"key":"846_CR164","doi-asserted-by":"crossref","unstructured":"Proen\u00e7a HM, B\u00e4ck T, van Leeuwen M (2021a) Robust subgroup discovery. arXiv:2103.13686","DOI":"10.1007\/s10618-022-00856-x"},{"key":"846_CR165","doi-asserted-by":"crossref","unstructured":"Proen\u00e7a HM, Gr\u00fcnwald PD, B\u00e4ck T, van Leeuwen M (2021b) Discovering outstanding subgroup lists for numeric targets using MDL. arXiv:2006.09186","DOI":"10.1007\/978-3-030-67658-2_2"},{"issue":"1","key":"846_CR166","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10618-019-00655-x","volume":"34","author":"K Puolam\u00e4ki","year":"2020","unstructured":"Puolam\u00e4ki K, Oikarinen E, Kang B, Lijffijt J, De Bie T (2020) Interactive visual data exploration with subjective feedback: an information-theoretic approach. Data Min Knowl Disc 34(1):21\u201349. https:\/\/doi.org\/10.1007\/s10618-019-00655-x","journal-title":"Data Min Knowl Disc"},{"key":"846_CR167","doi-asserted-by":"publisher","unstructured":"Rakthanmanon T, Keogh EJ, Lonardi S, Evans S (2011) Time series epenthesis: Clustering time series streams requires ignoring some data. In: Proceedings of the 11th IEEE International Conference on Data Mining, ICDM\u201911, IEEE Computer Society, pp 547\u2013556, https:\/\/doi.org\/10.1109\/ICDM.2011.146","DOI":"10.1109\/ICDM.2011.146"},{"issue":"2","key":"846_CR168","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10115-012-0508-7","volume":"33","author":"T Rakthanmanon","year":"2012","unstructured":"Rakthanmanon T, Keogh EJ, Lonardi S, Evans S (2012) MDL-based time series clustering. Knowl Inf Syst 33(2):371\u2013399. https:\/\/doi.org\/10.1007\/s10115-012-0508-7","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"846_CR169","doi-asserted-by":"publisher","first-page":"64:1","DOI":"10.1145\/2508037.2508045","volume":"4","author":"P Rashidi","year":"2013","unstructured":"Rashidi P, Cook DJ (2013) COM: A method for mining and monitoring human activity patterns in home-based health monitoring systems. ACM Transactions on Intelligent Systems and Technology 4(4):64:1-64:20. https:\/\/doi.org\/10.1145\/2508037.2508045","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"5","key":"846_CR170","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. https:\/\/doi.org\/10.1016\/0005-1098(78)90005-5","journal-title":"Automatica"},{"issue":"1","key":"846_CR171","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s42003-021-01805-y","volume":"4","author":"A Rojas","year":"2021","unstructured":"Rojas A, Calatayud J, Kowalewski M, Neuman M, Rosvall M (2021) A multiscale view of the phanerozoic fossil record reveals the three major biotic transitions. Communications Biology 4(1):1\u20138. https:\/\/doi.org\/10.1038\/s42003-021-01805-y","journal-title":"Communications Biology"},{"issue":"18","key":"846_CR172","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. https:\/\/doi.org\/10.1073\/pnas.0611034104","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"846_CR173","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci 105(4):1118\u20131123. https:\/\/doi.org\/10.1073\/pnas.0706851105","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"846_CR174","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0008694","volume":"5","author":"M Rosvall","year":"2010","unstructured":"Rosvall M, Bergstrom CT (2010) Mapping change in large networks. PLoS ONE 5(1):1\u20137. https:\/\/doi.org\/10.1371\/journal.pone.0008694","journal-title":"PLoS ONE"},{"issue":"4","key":"846_CR175","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0018209","volume":"6","author":"M Rosvall","year":"2011","unstructured":"Rosvall M, Bergstrom CT (2011) Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PLoS ONE 6(4):e18209. https:\/\/doi.org\/10.1371\/journal.pone.0018209","journal-title":"PLoS ONE"},{"issue":"1","key":"846_CR176","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1140\/epjst\/e2010-01179-1","volume":"178","author":"M Rosvall","year":"2009","unstructured":"Rosvall M, Axelsson D, Bergstrom CT (2009) The map equation. The European Physical Journal Special Topics 178(1):13\u201323. https:\/\/doi.org\/10.1140\/epjst\/e2010-01179-1","journal-title":"The European Physical Journal Special Topics"},{"key":"846_CR177","doi-asserted-by":"publisher","unstructured":"Sampson O, Berthold MR (2014) Widened KRIMP: Better performance through diverse parallelism. In: Proceedings of the 13th International Symposium on Advances in Intelligent Data Analysis, IDA\u201914, Springer, pp 276\u2013285, https:\/\/doi.org\/10.1007\/978-3-319-12571-8_24","DOI":"10.1007\/978-3-319-12571-8_24"},{"key":"846_CR178","volume-title":"Summarizing dynamic graphs using MDL. Tech. rep.","author":"D Saran","year":"2019","unstructured":"Saran D, Vreeken J (2019) Summarizing dynamic graphs using MDL. Tech. rep. Saarland University, Germany"},{"key":"846_CR179","doi-asserted-by":"publisher","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, KDD\u201915, ACM, pp 1055\u20131064, https:\/\/doi.org\/10.1145\/2783258.2783321","DOI":"10.1145\/2783258.2783321"},{"issue":"3","key":"846_CR180","first-page":"75","volume":"40","author":"N Shah","year":"2017","unstructured":"Shah N, Koutra D, Jin L, Zou T, Gallagher B, Faloutsos C (2017) On summarizing large-scale dynamic graphs. IEEE Data Engineering Bulletin 40(3):75\u201388","journal-title":"IEEE Data Engineering Bulletin"},{"issue":"3","key":"846_CR181","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27(3):379\u2013423. https:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst Tech J"},{"key":"846_CR182","doi-asserted-by":"publisher","unstructured":"Shokoohi-Yekta M, Chen Y, Campana B, Hu B, Zakaria J, Keogh E (2015) Discovery of meaningful rules in time series. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201915, ACM, pp 1085\u20131094, https:\/\/doi.org\/10.1145\/2783258.2783306","DOI":"10.1145\/2783258.2783306"},{"key":"846_CR183","doi-asserted-by":"crossref","unstructured":"Siebes A (2012) Queries for data analysis. In: Proceedings of the 11th International Symposium on Advances in Intelligent Data Analysis, IDA\u201912, Springer, pp 7\u201322","DOI":"10.1007\/978-3-642-34156-4_3"},{"key":"846_CR184","doi-asserted-by":"publisher","unstructured":"Siebes A (2014) MDL in pattern mining: A brief introduction to krimp. In: Proceedings of the international conference on Formal Concept Analysis, FCA\u201914, Springer, pp 37\u201343, https:\/\/doi.org\/10.1007\/978-3-319-07248-7_3","DOI":"10.1007\/978-3-319-07248-7_3"},{"key":"846_CR185","doi-asserted-by":"publisher","unstructured":"Siebes A, Kersten R (2011) A structure function for transaction data. In: Proceedings of the 2011 SIAM International Conference on Data Mining, SDM\u201911, SIAM, pp 558\u2013569, https:\/\/doi.org\/10.1137\/1.9781611972818.48","DOI":"10.1137\/1.9781611972818.48"},{"key":"846_CR186","doi-asserted-by":"publisher","unstructured":"Siebes A, Kersten R (2012) Smoothing categorical data. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201912, Springer, pp 42\u201357, https:\/\/doi.org\/10.1007\/978-3-642-33460-3_8","DOI":"10.1007\/978-3-642-33460-3_8"},{"key":"846_CR187","doi-asserted-by":"crossref","unstructured":"Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: Proceedings of the 2006 SIAM International Conference on Data Mining, SDM\u201906, SIAM","DOI":"10.1137\/1.9781611972764.35"},{"key":"846_CR188","doi-asserted-by":"publisher","unstructured":"Smets K, Vreeken J (2011) The odd one out: Identifying and characterising anomalies. In: Proceedings of the 2011 SIAM International Conference on Data Mining, SDM\u201911, SIAM, pp 804\u2013815, https:\/\/doi.org\/10.1137\/1.9781611972818.69","DOI":"10.1137\/1.9781611972818.69"},{"key":"846_CR189","doi-asserted-by":"crossref","unstructured":"Smets K, Vreeken J (2012) Slim: Directly mining descriptive patterns. In: Proceedings of the 2012 SIAM International Conference on Data Mining, SDM\u201912, SIAM, pp 236\u2013247","DOI":"10.1137\/1.9781611972825.21"},{"key":"846_CR190","doi-asserted-by":"publisher","unstructured":"Soulet A, Ra\u00efssi C, Plantevit M, Cr\u00e9milleux B (2011) Mining dominant patterns in the sky. In: Proceedings of the 11th IEEE International Conference on Data Mining, ICDM\u201911, IEEE Computer Society, pp 655\u2013664, https:\/\/doi.org\/10.1109\/ICDM.2011.100","DOI":"10.1109\/ICDM.2011.100"},{"key":"846_CR191","volume-title":"Information Theory: A Tutorial Introduction","author":"JV Stone","year":"2013","unstructured":"Stone JV (2013) Information Theory: A Tutorial Introduction. Sebtel Press, Sheffield"},{"key":"846_CR192","doi-asserted-by":"publisher","unstructured":"Sun J, Faloutsos C, Papadimitriou S, Yu PS (2007) GraphScope: parameter-free mining of large time-evolving graphs. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD\u201907, ACM, pp 687\u2013696, https:\/\/doi.org\/10.1145\/1281192.1281266","DOI":"10.1145\/1281192.1281266"},{"key":"846_CR193","doi-asserted-by":"crossref","unstructured":"Tanaka Y, Uehara K (2003) Discover motifs in multi-dimensional time-series using the principal component analysis and the MDL principle. In: Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition, MLDM\u201903, Springer, pp 252\u2013265","DOI":"10.1007\/3-540-45065-3_22"},{"issue":"2","key":"846_CR194","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10994-005-5829-2","volume":"58","author":"Y Tanaka","year":"2005","unstructured":"Tanaka Y, Iwamoto K, Uehara K (2005) Discovery of time-series motif from multi-dimensional data based on MDL principle. Mach Learn 58(2):269\u2013300. https:\/\/doi.org\/10.1007\/s10994-005-5829-2","journal-title":"Mach Learn"},{"key":"846_CR195","doi-asserted-by":"publisher","unstructured":"Tatti N (2010) Probably the best itemsets. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD\u201910, ACM, pp 293\u2013302, https:\/\/doi.org\/10.1145\/1835804.1835843","DOI":"10.1145\/1835804.1835843"},{"key":"846_CR196","doi-asserted-by":"publisher","unstructured":"Tatti N, Heikinheimo H (2008) Decomposable families of itemsets. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201908, pp 472\u2013487, https:\/\/doi.org\/10.1007\/978-3-540-87481-2_31","DOI":"10.1007\/978-3-540-87481-2_31"},{"key":"846_CR197","doi-asserted-by":"publisher","unstructured":"Tatti N, Vreeken J (2008) Finding good itemsets by packing data. In: Proceedings of the 8th IEEE International Conference on Data Mining, ICDM\u201908, IEEE Computer Society, pp 588\u2013597, https:\/\/doi.org\/10.1109\/ICDM.2008.39","DOI":"10.1109\/ICDM.2008.39"},{"key":"846_CR198","doi-asserted-by":"publisher","unstructured":"Tatti N, Vreeken J (2012a) Discovering descriptive tile trees. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201912, Springer, pp 9\u201324, https:\/\/doi.org\/10.1007\/978-3-642-33460-3_6","DOI":"10.1007\/978-3-642-33460-3_6"},{"key":"846_CR199","doi-asserted-by":"crossref","unstructured":"Tatti N, Vreeken J (2012b) The long and the short of it: Summarising event sequences with serial episodes. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201912, ACM, pp 462\u2013470","DOI":"10.1145\/2339530.2339606"},{"key":"846_CR200","unstructured":"van Leeuwen M (2010) Patterns that matter. Phd thesis, Universiteit Utrecht"},{"issue":"12","key":"846_CR201","doi-asserted-by":"publisher","first-page":"3190","DOI":"10.1109\/TKDE.2015.2453159","volume":"27","author":"M van Leeuwen","year":"2015","unstructured":"van Leeuwen M, Galbrun E (2015) Association discovery in two-view data. IEEE Trans Knowl Data Eng 27(12):3190\u20133202. https:\/\/doi.org\/10.1109\/TKDE.2015.2453159","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"846_CR202","doi-asserted-by":"publisher","unstructured":"van Leeuwen M, Siebes A (2008) StreamKrimp: Detecting change in data streams. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201908, Springer, pp 672\u2013687, https:\/\/doi.org\/10.1007\/978-3-540-87479-9_62","DOI":"10.1007\/978-3-540-87479-9_62"},{"key":"846_CR203","doi-asserted-by":"publisher","unstructured":"van Leeuwen M, Vreeken J (2014) Mining and using sets of patterns through compression. In: Frequent Pattern Mining, Springer, pp 165\u2013198, https:\/\/doi.org\/10.1007\/978-3-319-07821-2_8","DOI":"10.1007\/978-3-319-07821-2_8"},{"key":"846_CR204","doi-asserted-by":"publisher","unstructured":"van Leeuwen M, Vreeken J, Siebes A (2006) Compression picks item sets that matter. In: Proceedings of the European Conference on Knowledge Discovery in Databases, PKDD\u201906, Springer, pp 585\u2013592, https:\/\/doi.org\/10.1007\/11871637_59","DOI":"10.1007\/11871637_59"},{"key":"846_CR205","doi-asserted-by":"publisher","unstructured":"van Leeuwen M, Bonchi F, Sigurbj\u00f6rnsson B, Siebes A (2009a) Compressing tags to find interesting media groups. In: Proceedings of the 18th ACM conference on Information and knowledge management, CIKM\u201909, ACM, pp 1147\u20131156, https:\/\/doi.org\/10.1145\/1645953.1646099","DOI":"10.1145\/1645953.1646099"},{"issue":"2","key":"846_CR206","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/s10618-009-0137-2","volume":"19","author":"M van Leeuwen","year":"2009","unstructured":"van Leeuwen M, Vreeken J, Siebes A (2009) Identifying the components. Data Min Knowl Disc 19(2):176\u2013193. https:\/\/doi.org\/10.1007\/s10618-009-0137-2","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"846_CR207","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. https:\/\/doi.org\/10.1007\/s10994-015-5539-3","journal-title":"Mach Learn"},{"key":"846_CR208","doi-asserted-by":"crossref","unstructured":"Vanetik N, Litvak M (2017) Query-based summarization using MDL principle. In: Proceedings of the MultiLing 2017 Workshop on Summarization and Summary Evaluation Across Source Types and Genres @ACL\u201917, pp 22\u201331","DOI":"10.18653\/v1\/W17-1004"},{"key":"846_CR209","doi-asserted-by":"publisher","unstructured":"Vanetik N, Litvak M (2018) DRIM: MDL-based approach for fast diverse summarization. In: Proceedings of the 2018 IEEE\/WIC\/ACM International Conference on Web Intelligence, WI\u201918, pp 660\u2013663, https:\/\/doi.org\/10.1109\/WI.2018.00-17","DOI":"10.1109\/WI.2018.00-17"},{"key":"846_CR210","doi-asserted-by":"publisher","unstructured":"Vespier U, Knobbe A, Nijssen S, Vanschoren J (2012) MDL-based analysis of time series at multiple time-scales. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML\/PKDD\u201912, Springer, pp 371\u2013386, https:\/\/doi.org\/10.1007\/978-3-642-33486-3_24","DOI":"10.1007\/978-3-642-33486-3_24"},{"issue":"2","key":"846_CR211","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.1.021025","volume":"1","author":"A Viamontes Esquivel","year":"2011","unstructured":"Viamontes Esquivel A, Rosvall M (2011) Compression of flow can reveal overlapping-module organization in networks. Phys Rev X 1(2):021025. https:\/\/doi.org\/10.1103\/PhysRevX.1.021025","journal-title":"Phys Rev X"},{"key":"846_CR212","unstructured":"Vreeken J (2009) Making pattern mining useful. Phd thesis, Universiteit Utrecht"},{"key":"846_CR213","doi-asserted-by":"publisher","unstructured":"Vreeken J, Siebes A (2008) Filling in the blanks \u2013 krimp minimisation for missing data. In: Proceedings of the 8th IEEE International Conference on Data Mining, ICDM\u201908, IEEE Computer Society, pp 1067\u20131072, https:\/\/doi.org\/10.1109\/ICDM.2008.40","DOI":"10.1109\/ICDM.2008.40"},{"key":"846_CR214","doi-asserted-by":"publisher","unstructured":"Vreeken J, van Leeuwen M, Siebes A (2007a) Characterising the difference. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201907, ACM, pp 765\u2013774, https:\/\/doi.org\/10.1145\/1281192.1281274","DOI":"10.1145\/1281192.1281274"},{"key":"846_CR215","doi-asserted-by":"publisher","unstructured":"Vreeken J, van Leeuwen M, Siebes A (2007b) Preserving privacy through data generation. In: Proceedings of the 7th IEEE International Conference on Data Mining, ICDM\u201907, IEEE Computer Society, pp 685\u2013690, https:\/\/doi.org\/10.1109\/ICDM.2007.25","DOI":"10.1109\/ICDM.2007.25"},{"issue":"1","key":"846_CR216","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 Disc 23(1):169\u2013214","journal-title":"Data Min Knowl Disc"},{"key":"846_CR217","doi-asserted-by":"publisher","unstructured":"Wang P, Wang H, Liu M, Wang W (2010) An algorithmic approach to event summarization. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD\u201910, ACM, pp 183\u2013194, https:\/\/doi.org\/10.1145\/1807167.1807189","DOI":"10.1145\/1807167.1807189"},{"issue":"1","key":"846_CR218","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-007-5006-x","volume":"68","author":"GI Webb","year":"2007","unstructured":"Webb GI (2007) Discovering significant patterns. Mach Learn 68(1):1\u201333. https:\/\/doi.org\/10.1007\/s10994-007-5006-x","journal-title":"Mach Learn"},{"issue":"3","key":"846_CR219","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2601433","volume":"8","author":"GI Webb","year":"2013","unstructured":"Webb GI, Vreeken J (2013) Efficient discovery of the most interesting associations. ACM Transactions on Knowledge Discovery from Data 8(3):15:1-15:31. https:\/\/doi.org\/10.1145\/2601433","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"846_CR220","doi-asserted-by":"publisher","unstructured":"Wiegand B, Klakow D, Vreeken J (2021) Mining easily understandable models from complex event logs. In: Proceedings of the 2021 SIAM International Conference on Data Mining, SDM\u201921, SIAM, pp 244\u2013252, https:\/\/doi.org\/10.1137\/1.9781611976700.28","DOI":"10.1137\/1.9781611976700.28"},{"key":"846_CR221","doi-asserted-by":"crossref","unstructured":"Wiegand B, Klakow D, Vreeken J (2022) Mining interpretable data-to-sequence generators. In: Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI\u201922, Association for the Advancement of Artificial Intelligenc","DOI":"10.1609\/aaai.v36i4.20343"},{"key":"846_CR222","doi-asserted-by":"publisher","unstructured":"Witteveen J, Duivesteijn W, Knobbe A, Gr\u00fcnwald PD (2014) RealKrimp \u2013 finding hyperintervals that compress with MDL for real-valued data. In: Proceedings of the 13th International Symposium on Advances in Intelligent Data Analysis, IDA\u201914, Springer, pp 368\u2013379, https:\/\/doi.org\/10.1007\/978-3-319-12571-8_32","DOI":"10.1007\/978-3-319-12571-8_32"},{"key":"846_CR223","doi-asserted-by":"publisher","unstructured":"Wu D, Gundimeda S, Mou S, Quinn CJ (2020) Modeling piece-wise stationary time series. In: Proceedings of the 2020 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP\u201920, IEEE Computer Society, pp 3817\u20133821, https:\/\/doi.org\/10.1109\/ICASSP40776.2020.9053470","DOI":"10.1109\/ICASSP40776.2020.9053470"},{"key":"846_CR224","doi-asserted-by":"publisher","unstructured":"Yan X, Cheng H, Han J, Xin D (2005) Summarizing itemset patterns: a profile-based approach. In: Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD\u201905, ACM, pp 314\u2013323, https:\/\/doi.org\/10.1145\/1081870.1081907","DOI":"10.1145\/1081870.1081907"},{"key":"846_CR225","doi-asserted-by":"publisher","unstructured":"Yan Y, Cao L, Madden S, Rundensteiner EA (2018) SWIFT: Mining representative patterns from large event streams. Proc VLDB Endow 12(3):265\u2013277. https:\/\/doi.org\/10.14778\/3291264.3291271","DOI":"10.14778\/3291264.3291271"},{"key":"846_CR226","unstructured":"Yang L, Baratchi M, van Leeuwen M (2020) Unsupervised discretization by two-dimensional MDL-based histogram. arXiv:2006.01893"},{"key":"846_CR227","unstructured":"Youngblood GM, Heierman EO, Cook DJ, Holder LB (2005) Automated HPOMDP construction through data-mining techniques in the intelligent environment domain. In: Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, FLAIRS\u201905"},{"key":"846_CR228","doi-asserted-by":"publisher","unstructured":"Yurov M, Ignatov DI (2017) Turning krimp into a triclustering technique on sets of attribute-condition pairs that compress. In: Proceedings of the International Joint Conference on Rough Sets, IJCRS\u201917, Springer, pp 558\u2013569, https:\/\/doi.org\/10.1007\/978-3-319-60840-2_40","DOI":"10.1007\/978-3-319-60840-2_40"},{"key":"846_CR229","doi-asserted-by":"publisher","unstructured":"Zhao P, Zhao Q, Zhang C, Su G, Zhang Q, Rao W (2019) CLEAN: Frequent pattern-based trajectory spatial-temporal compression on road networks. In: Proceedings of the 20th IEEE International Conference on Mobile Data Management, MDM\u201919, IEEE Computer Society, pp 605\u2013610, https:\/\/doi.org\/10.1109\/MDM.2019.00127","DOI":"10.1109\/MDM.2019.00127"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00846-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-022-00846-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00846-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T10:11:24Z","timestamp":1665051084000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-022-00846-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,4]]},"references-count":229,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["846"],"URL":"https:\/\/doi.org\/10.1007\/s10618-022-00846-z","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,4]]},"assertion":[{"value":"10 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}