Issue No. 06 - June (2002 vol. 24)
<p>A problem gaining interest in pattern recognition applied to data mining is that of selecting a small representative subset from a very large data set. In this article, a nonparametric data reduction scheme is suggested. It attempts to represent the density underlying the data. The algorithm selects representative points in a multiscale fashion which is novel from existing density-based approaches. The accuracy of representation by the condensed set is measured in terms of the error in density estimates of the original and reduced sets. Experimental studies on several real life data sets show that the multiscale approach is superior to several related condensation methods both in terms of condensation ratio and estimation error. The condensed set obtained was also experimentally shown to be effective for some important data mining tasks like classification, clustering, and rule generation on large data sets. Moreover, it is empirically found that the algorithm is efficient in terms of sample complexity.</p>
Data mining, multiscale condensation, scalability, density estimation, convergence in probability, instance learning.
Pabitra Mitra, C.A. Murthy, Sankar K. Pal, "Density-Based Multiscale Data Condensation", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 24, no. , pp. 734-747, June 2002, doi:10.1109/TPAMI.2002.1008381