Full Citation

Title: Density-Based Multiscale Data Condensation

Citation Type: Journal Article

Publication Year: 2002

ISBN:

ISSN:

DOI:

NSFID:

PMCID:

PMID:

Abstract: 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.

Url: https://ieeexplore.ieee.org/document/1008381

User Submitted?: No

Authors: Mitra, Pabitra; Murthy, C.A.; Pal, Sankar, K

Periodical (Full): IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE

Issue: 6

Volume: 24

Pages: 734-747

Data Collections: IPUMS USA

Topics: Methodology and Data Collection, Other

Countries: