Multivariate discretization of continuous variables for set mining
Stephen D. Bay · 2000
Many algorithms in data mining can be formulated as a set mining problem where the goal is to nd conjunctions (or disjunctions) of terms that meet user speci ed constraints.Set mining techniques have been largely designed for categorical or discrete data where variables can only take o n a xed numb e r o f v alues.However, many data sets 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 the class variable).We argue that this is a sub-optimal approach for knowledge discovery as univariate discretization can destroy hidden patterns in data.Discretization should consider the eects on all variables in the analysis and that two regions X and Y should only be in the same cell after discretization if the instances in those regions have similar multivariate distributions (Fx Fy) across all variables and combinations of variables.We present a b o ttom up merging algorithm to discretize continuous variables based on this rule.Our experiments indicate that the approach is feasible, that it does not destroy hidden patterns and that it generates meaningful intervals.