Dynamic Subspace Clustering for Very Large High-Dimensional Databases
- Cite this paper as:
- 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 Y., Yin H. (eds) Intelligent Data Engineering and Automated Learning. IDEAL 2003. Lecture Notes in Computer Science, vol 2690. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.