Mint: MDL-based approach for mining interesting numerical pattern sets

DOI10.1007/S10618-021-00799-9MaRDI QIDQ832644zbMATH OpenOpenAlexFDO

Authors Tatiana Makhalova, Sergei O. Kuznetsov, Amedeo Napoli

Publication date 25 March 2022

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2011.14843

zbMATH Keywords

numerical datahyper-rectanglesminimum description-length principlenumerical pattern miningplug-in codes

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09) Pattern recognition, speech recognition (68T10)

Abstract: Pattern mining is well established in data mining research, especially for mining binary datasets. Surprisingly, there is much less work about numerical pattern mining and this research area remains under-explored. In this paper, we propose Mint, an efficient MDL-based algorithm for mining numerical datasets. The MDL principle is a robust and reliable framework widely used in pattern mining, and as well in subgroup discovery. In Mint we reuse MDL for discovering useful patterns and returning a set of non-redundant overlapping patterns with well-defined boundaries and covering meaningful groups of objects. Mint is not alone in the category of numerical pattern miners based on MDL. In the experiments presented in the paper we show that Mint outperforms competitors among which Slim and RealKrimp.

Recommendations

• Mining and using sets of patterns through compression
• The minimum description length principle for pattern mining: a survey
• Krimp: mining itemsets that compress
• MDL in Pattern Mining A Brief Introduction to Krimp
• Interesting patterns

Cites work

• A universal prior for integers and estimation by minimum description length
• Biclustering numerical data in formal concept analysis
• Density estimation by stochastic complexity
• From-below Boolean matrix factorization algorithm based on MDL
• Interesting patterns
• Introduction to Information Retrieval
• Krimp: mining itemsets that compress
• MODL: a Bayes optimal discretization method for continuous attributes
• Unsupervised interaction-preserving discretization of multivariate data

Cited in

(4)

• Mining and using sets of patterns through compression
• The minimum description length principle for pattern mining: a survey
• MDL in Pattern Mining A Brief Introduction to Krimp
• Robust subgroup discovery. Discovering subgroup lists using MDL

Describes a project that uses

Uses Software

• UCI
• MODL
• MDL4BMF
• Krimp

This page was built for publication: Mint: MDL-based approach for mining interesting numerical pattern sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832644)