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. © Springer-Verlag 2003.
CITATION STYLE
Deepa Shenoy, P., Srinivasa, K. G., Mithun, M. P., Venugopal, K. R., & Patnaik, L. M. (2004). Dynamic subspace clustering for very large high-dimensional databases. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2690, 850–854. https://doi.org/10.1007/978-3-540-45080-1_117
Mendeley helps you to discover research relevant for your work.