Correlation Preserving Discretization

Sameep Mehta, Srinivasan Parthasarathy, Hui Yang

Abstract

Discretization is a crucial preprocessing primitive for a variety of data warehousing and mining tasks. In this article we present a novel PCA-based unsupervised algorithm for the discretization of continuous attributes in multivariate datasets. The algorithm leverages the underlying correlation structure in the dataset to obtain the discrete intervals, and ensures that the inherent correlations are preserved. The approach also extends easily to datasets containing missing values. We demonstrate the efficacy of the approach on real datasets and as a preprocessing step for both classification and frequent item set mining tasks. We also show that the intervals are meaningful and can uncover hidden patterns in data.
BibTeX
@inproceedings{mehta2004correlation,
  author = {Sameep Mehta and Srinivasan Parthasarathy and Hui Yang},
  title = {{Correlation Preserving Discretization}},
  booktitle = {ICDM},
  year = {2004},
  doi = {10.1109/icdm.2004.10007},
}

Loading related content...

Figure