Kazempour, DaniyalWinter, JohannesKröger, PeerSeidl, Thomas2022-01-272022-01-2720212021http://dx.doi.org/10.1007/s13222-021-00388-6https://dl.gi.de/handle/20.500.12116/38048When using arbitrarily oriented subspace clustering algorithms one obtains a partitioning of a given data set and for each partition its individual subspace. Since clustering is an unsupervised machine learning task, we may not have “ground truth” labels at our disposal or do not wish to rely on them. What is needed in such cases are internal measure which permits a label-less analysis of the obtained subspace clustering. In this work, we propose methods for revising clusters obtained from arbitrarily oriented correlation clustering algorithms. Initial experiments conducted reveal improvements in the clustering results compared to the original clustering outcome. Our proposed approach is simple and can be applied as a post-processing step on arbitrarily oriented correlation clusterings.Correlation clusteringEvaluationHigh-dimensionalInternal measuresUnsupervisedText/Journal Article10.1007/s13222-021-00388-61610-1995