Abstract

Clustering techniques often define the similarity between instances using distance measures over the various dimensions of the data [12, 14]. Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. Traditional clustering algorithms consider all of the dimensions of an input dataset in an attempt to learn as much as possible about each instance described. In high dimensional data, however, many of the dimensions are often irrelevant. These irrelevant dimensions confuse clustering algorithms by hiding clusters in noisy data. In very high dimensions it is common for all of the instances in a dataset to be nearly equidistant from each other, completely masking the clusters. Subspace clustering algorithms localize the search for relevant dimensions allowing them to find clusters that exist in multiple, possibly overlapping subspaces. This paper presents a survey of the various subspace clustering algorithms. We then compare the two main approaches to subspace clustering using empirical scalability and accuracy tests. 1

Citations

461	Automatic subspace clustering of high dimensional data for data mining applications - Agrawal, Gehrke, et al. - 1998
196	Fast algorithms for projected clustering - Aggarwal, Wolf, et al. - 1999
177	Survey of clustering data mining techniques - Berkhin - 2002
117	PS: Finding generalized projected clusters in high dimensional spaces - CC, Yu
89	Entropy-based subspace clustering for mining numerical data - Cheng, Fu, et al. - 1999
10	A new cell-based clustering method for large, highdimensional data in data mining applications - Chang, Jin - 2002