##
**Multivariate discretization for set mining.**
*(English)*
Zbl 0987.68633

Summary: Many algorithms in data mining can be formulated as a set-mining problem where the goal is to find conjunctions (or disjunctions) of terms that meet user-specified constraints. Set-mining techniques have been largely designed for categorical or discrete data where variables can only take on a fixed number of values. However, many datasets also contain continuous variables and a common method of dealing with these is to discretize them by breaking them into ranges. Most discretization methods are univariate and consider only a single feature at a time (sometimes in conjunction with a class variable). We argue that this is a suboptimal approach for knowledge discovery as univariate discretization can destroy hidden patterns in data. Discretization should consider the effects on all variables in the analysis and that two regions \(X\) and \(Y\) should only be in the same interval after discretization if the instances in those regions have similar multivariate distributions \((F_x\sim F_y)\) across all variables and combinations of variables. We present a bottom-up merging algorithm to discretize continuous variables based on this rule. Our experiments indicate that the approach is feasible, that it will not destroy hidden patterns and that it will generate meaningful intervals.

### MSC:

68U99 | Computing methodologies and applications |

68T05 | Learning and adaptive systems in artificial intelligence |

68P20 | Information storage and retrieval of data |