Abstract
Clustering high dimensional data is an emerging research field. Subspace clustering or projected clustering group similar objects in subspaces, i.e. projections, of the full space. In the past decade, several clustering paradigms have been developed in parallel, without thorough evaluation and comparison between these paradigms on a common basis.
Conclusive evaluation and comparison is challenged by three major issues. First, there is no ground truth that describes the "true" clusters in real world data. Second, a large variety of evaluation measures have been used that reflect different aspects of the clustering result. Finally, in typical publications authors have limited their analysis to their favored paradigm only, while paying other paradigms little or no attention.
In this paper, we take a systematic approach to evaluate the major paradigms in a common framework. We study representative clustering algorithms to characterize the different aspects of each paradigm and give a detailed comparison of their properties. We provide a benchmark set of results on a large variety of real world and synthetic data sets. Using different evaluation measures, we broaden the scope of the experimental analysis and create a common baseline for future developments and comparable evaluations in the field. For repeatability, all implementations, data sets and evaluation measures are available on our website.
Originalsprog | Engelsk |
---|---|
Tidsskrift | VLDB Journal |
Udgave nummer | 1 |
Sider (fra-til) | 1270-1281 |
ISSN | 1066-8888 |
Status | Udgivet - 2009 |
Begivenhed | International Conference on Very Large Data Bases (VLDB '09) - Lyon, Frankrig Varighed: 19 maj 2010 → … Konferencens nummer: 35 |
Konference
Konference | International Conference on Very Large Data Bases (VLDB '09) |
---|---|
Nummer | 35 |
Land/Område | Frankrig |
By | Lyon |
Periode | 19/05/2010 → … |
Bibliografisk note
Serie: Proceedings of the VLDB Endowment, VLDB, 1, 2, 2150-8097Volumne: 2