A Framework for Evaluation and Exploration of Clustering Algorithms in Subspaces of High Dimensional Databases

  • Author: Emmanuel Müller, Ira Assent, Stephan Günnemann, Patrick Gerwert, Matthias Hannen, Timm Jansen and Thomas Seidl
  • Source: Proceedings of the 14th GI Conference on Database Systems for Business, Technology, and the Web (BTW 2011), Kaiserslautern, Germany
  • In high dimensional databases, traditional full space clustering methods are known to fail due to the curse of dimensionality. Thus, in recent years, subspace clustering and projected clustering approaches were proposed for clustering in high dimensional spaces. As the area is rather young, few comparative studies on the advantages and disadvantages of the different algorithms exist. Part of the underlying problem is the lack of available open source implementations that could be used by researchers to understand, compare, and extend subspace and projected clustering algorithms. In this work, we discuss the requirements for open source evaluation software and propose OpenSubspace that meets these requirements. OpenSubspace integrates state-of-the-art performance measures and visualization techniques to foster research in clustering in high dimensional databases.