The Minimum Description Length Principle for Pattern Mining: A Survey
From MaRDI portal
Publication:6345974
DOI10.1007/S10618-022-00846-ZarXiv2007.14009WikidataQ114226900 ScholiaQ114226900MaRDI QIDQ6345974FDOQ6345974
Authors: Esther Galbrun 
Publication date: 28 July 2020
Abstract: This is about the Minimum Description Length (MDL) principle applied to pattern mining. The length of this description is kept to the minimum. Mining patterns is a core task in data analysis and, beyond issues of efficient enumeration, the selection of patterns constitutes a major challenge. The 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, as well as of work on the theory behind the MDL and similar principles, we review MDL-based methods for mining various types of data and patterns. Finally, we open a discussion on some issues regarding these methods, and highlight currently active related data analysis problems.
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational aspects of data analysis and big data (68T09) Pattern recognition, speech recognition (68T10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
This page was built for publication: The Minimum Description Length Principle for Pattern Mining: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345974)
