Abstract
Emerging high-dimensional data mining applications needs to find interesting clusters embeded in arbitrarily aligned subspaces of lower dimensionality. It is difficult to cluster high-dimensional data objects, when they are sparse and skewed. Updations are quite common in dynamic databases and they are usually processed in batch mode. In very large dynamic databases, it is necessary to perform incremental cluster analysis only to the updations. We present a incremental clustering algorithm for subspace clustering in very high dimensions, which handles both insertion and deletions of datapoints to the backend databases.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, C.C., Yu, P.S.: Redefining Clustering For High Dimensional Applications. IEEE Transactions on Knwoledge and Data Engineering 14(2), 210–224 (2002)
Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1998)
Shenoy, P.D., Srinivasa, K.G., Venugopal, K.R., Patnaik, L.M.: An Evolutionary Approach for Association Rule Mining on Dynamic Databases. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS (LNAI), vol. 2637, pp. 271–282. Springer, Heidelberg (2003)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Academic Press, London (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shenoy, P.D., Srinivasa, K.G., Mithun, M.P., Venugopal, K.R., Patnaik, L.M. (2003). Dynamic Subspace Clustering for Very Large High-Dimensional Databases. In: Liu, J., Cheung, Ym., Yin, H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45080-1_117
Download citation
DOI: https://doi.org/10.1007/978-3-540-45080-1_117
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40550-4
Online ISBN: 978-3-540-45080-1
eBook Packages: Springer Book Archive