Enhancing density-based data reduction using entropy.
Data reduction algorithms determine a small data subset from a given large data set. In this article, new types of data reduction criteria, based on the concept of entropy, are first presented. These criteria can evaluate the data reduction performance in a sophisticated and comprehensive way. As a result, new data reduction procedures are developed. Using the newly introduced criteria, the proposed data reduction scheme is shown to be efficient and effective. In addition, an outlier-filtering strategy, which is computationally insignificant, is developed. In some instances, this strategy can substantially improve the performance of supervised data analysis. The proposed procedures are compared with related techniques in two types of application: density estimation and classification. Extensive comparative results are included to corroborate the contributions of the proposed algorithms.
Huang
D
D
Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong. dihuang@ee.cityu.edu.hk
Chow
Tommy W S
TW
D000465:Algorithms; D003198:Computer Simulation; D019277:Entropy; D010363:Pattern Recognition, Automated / Q000379:methods*