Dynamic Data Condensation for Classification

  • Dymitr Ruta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4029)


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.


Input Space Condensation Method Class Partition Condensation Level Condensation Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Duda, R.O., Hart, P.E., Stork, D.G.: Pattern classification. John Wiley, Chichester (2001)MATHGoogle Scholar
  2. 2.
    Morgan, M.: Unearthing the customer: data mining is no longer the preserve of mathematical statisticians. Marketeers can also make a real, practical use of it (Revenue-Generating Networks). Telecommunications International (May 2003)Google Scholar
  3. 3.
    Weiss, S.M., Kulikowski, C.A.: Computer systems that learn. Morgan Kaufmann Publishers, San Mateo (1991)Google Scholar
  4. 4.
    Mitra, P., Murthy, T.R., Pal, S.K.: Density-based multiscale data condensation. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(6), 734–747 (2002)CrossRefGoogle Scholar
  5. 5.
    Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-basd learning algorithms. Machine Learning 38(3), 257–286 (2000)MATHCrossRefGoogle Scholar
  6. 6.
    Girolami, M., He, C.: Probability density estimation from optimally condensed data samples. IEEE Trans. on Pattern Analysis and Machine Intelligence 25(10), 1253–1264 (2003)CrossRefGoogle Scholar
  7. 7.
    Leung, Y., Zhang, J.-S., Xu, Z.-B.: Clustering by scale-space filtering. IEEE Trans. on Pattern Analysis and Machine Intelligence 22, 1396–1410 (2000)CrossRefGoogle Scholar
  8. 8.
    Plutowski, M., White, H.: Selecting concise training sets from clean data. IEEE Trans. on Neural Networks 4(2), 305–318 (1993)CrossRefGoogle Scholar
  9. 9.
    Shawe-Taylor, J., Cristianini, N.: Kernel methods for pattern analysis. Cambridge University Press, Cambridge (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dymitr Ruta
    • 1
  1. 1.Chief Technology Office, Research & VenturingBritish Telecommunications Group (BT)IpswichUK

Personalised recommendations