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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern classification. John Wiley, Chichester (2001)
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)
Weiss, S.M., Kulikowski, C.A.: Computer systems that learn. Morgan Kaufmann Publishers, San Mateo (1991)
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)
Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-basd learning algorithms. Machine Learning 38(3), 257–286 (2000)
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)
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)
Plutowski, M., White, H.: Selecting concise training sets from clean data. IEEE Trans. on Neural Networks 4(2), 305–318 (1993)
Shawe-Taylor, J., Cristianini, N.: Kernel methods for pattern analysis. Cambridge University Press, Cambridge (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruta, D. (2006). Dynamic Data Condensation for Classification. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds) Artificial Intelligence and Soft Computing – ICAISC 2006. ICAISC 2006. Lecture Notes in Computer Science(), vol 4029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785231_70
Download citation
DOI: https://doi.org/10.1007/11785231_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35748-3
Online ISBN: 978-3-540-35750-6
eBook Packages: Computer ScienceComputer Science (R0)