Dynamic data condensation for classification

Authors: Ruta, D.

Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume: 4029 LNAI

Pages: 672-681

eISSN: 1611-3349

ISBN: 9783540357483

ISSN: 0302-9743

DOI: 10.1007/11785231_70

Abstract:

Despite increasing amounts of data and rapidly increasing computational power current state-of-the-art pattern recognition models still can not handle massive and noisy corporate data warehouses, that have become the reality of today's businesses. Moreover, real-time and adaptive systems often require frequent model retraining which further hinders their use. The necessity is therefore to build the classification model on a much smaller representative subset of the original dataset. Various condensation methods ranging from data sampling up to density retention models attempt to capture the summarised data structure, yet they either do not account for labelled data or degrade the classification performance of the model trained on the condensed dataset, The proposed family of models called Dynamic Data Condensation (DDC) combine dynamic condensation, data editing and noise filtering in an attempt to maximally reduce labelled dataset yet with no harm on the performance of a classifier trained on the reduced set. The condensation is achieved by data merging and repositioning imposed by an electrostatic-type field applied to the data which attracts data from the same class but repels data from different classes, thereby trying to improve class separability. Initial experiments demonstrate that DDC outperforms competitive data condensation methods in terms of both data reduction and the classification performance, and is therefore considered better preprocessing step for classification. © Springer-Verlag Berlin Heidelberg 2006.

Source: Scopus