Dynamic subspace clustering for very large high-dimensional databases

Shenoy, Deepa P and Srinivasa, KG and Mithun, MP and Venugopal, KR and Patnaik, LM (2003) Dynamic subspace clustering for very large high-dimensional databases. In: Lecture Notes in Computer Science, 2690 . pp. 850-854.

PDF Dynamic_Subspace.pdf - Published Version Restricted to Registered users only Download (152kB) | Request a copy

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.

Item Type:	Editorials/Short Communications
Publication:	Lecture Notes in Computer Science
Publisher:	Springer
Additional Information:	Copyright of this article belongs to Springer.
Department/Centre:	Division of Mechanical Sciences > Chemical Engineering
Date Deposited:	19 Aug 2011 07:09
Last Modified:	17 Oct 2018 11:29
URI:	http://eprints.iisc.ac.in/id/eprint/40022

Actions (login required)

View Item