Müller, EmmanuelAssent, IraGünnemann, StephanGerwert, PatrickHannen, MatthiasJansen, TimmSeidl, ThomasHärder, TheoLehner, WolfgangMitschang, BernhardSchöning, HaraldSchwarz, Holger2019-01-172019-01-172011978-3-88579-274-1https://dl.gi.de/handle/20.500.12116/19588In 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 the OpenSubspace framework that meets these requirements. OpenSubspace integrates state-of-the-art performance measures and visualization techniques to foster clustering research in high dimensional databases.enA framework for evaluation and exploration of clustering algorithms in subspaces of high dimensional databasesText/Conference Paper1617-5468