.png){kind=icon}
Return
Mint: MDL-based approach for Mining INTeresting Numerical Pattern Sets
.png){kind=icon}
OA
AI
DOI：10.1007/s10618-021-00799-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
AbstractPattern 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 proposeMint, 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. InMintwe 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.Mintis not alone in the category of numerical pattern miners based on MDL. In the experiments presented in the paper we show thatMintoutperforms competitors among which IPD,RealKrimp, andSlim.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available