Detecting clusters in moderate-to-high dimensional data
Authors:
Open Access
- 1 August 2008
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 1 (2) , 1528-1529
Abstract
As a prolific research area in data mining, subspace clustering and related problems induced a vast amount of proposed solutions. However, many publications compare a new proposition -- if at all -- with one or two competitors or even with a so called "naïve" ad hoc solution but fail to clarify the exact problem definition. As a consequence, even if two solutions are thoroughly compared experimentally, it will often remain unclear whether both solutions tackle the same problem or, if they do, whether they agree in certain tacit assumptions and how such assumptions may influence the outcome of an algorithm. In this tutorial, we try to clarify (i) the different problem definitions related to subspace clustering in general, (ii) the specific difficulties encountered in this field of research, (iii) the varying assumptions, heuristics, and intuitions forming the basis of different approaches, and (iv) how several prominent solutions essentially tackle different problems.Keywords
This publication has 11 references indexed in Scilit:
- Robust Clustering in Arbitrarily Oriented Subspaces2008
- Deriving quantitative models for correlation clusters2006
- A Generic Framework for Efficient Subspace Clustering of High-Dimensional Data2006
- Biclustering algorithms for biological data analysis: a surveyIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- Computing Clusters of Correlation Connected objects2004
- Subspace clustering for high dimensional dataACM SIGKDD Explorations Newsletter, 2004
- Finding generalized projected clusters in high dimensional spaces2000
- Fast algorithms for projected clustering1999
- Automatic subspace clustering of high dimensional data for data mining applications1998
- Adaptive Control Processes1961