The Community for Technology Leaders
Green Image
Discretization is a crucial preprocessing technique used for a variety of data warehousing and mining tasks. In this paper, we present a novel PCA-based unsupervised algorithm for the discretization of continuous attributes in multivariate data sets. The algorithm leverages the underlying correlation structure in the data set to obtain the discrete intervals and ensures that the inherent correlations are preserved. Previous efforts on this problem are largely supervised and consider only piecewise correlation among attributes. We consider the correlation among continuous attributes and, at the same time, also take into account the interactions between continuous and categorical attributes. Our approach also extends easily to data sets containing missing values. We demonstrate the efficacy of the approach on real data sets and as a preprocessing step for both classification and frequent itemset mining tasks. We show that the intervals are meaningful and can uncover hidden patterns in data. We also show that large compression factors can be obtained on the discretized data sets. The approach is task independent, i.e., the same discretized data set can be used for different data mining tasks. Thus, the data sets can be discretized, compressed, and stored once and can be used again and again.
Index Terms- Data preprocessing, principal component analysis, data mining/summarization, missing data, data compression.

S. Mehta, S. Parthasarathy and H. Yang, "Toward Unsupervised Correlation Preserving Discretization," in IEEE Transactions on Knowledge & Data Engineering, vol. 17, no. , pp. 1174-1185, 2005.
80 ms
(Ver 3.3 (11022016))