The SpectACl of Nonconvex Clustering: A Spectral Approach to Density-Based Clustering

no code implementations • 1 Jul 2019 • Sibylle Hess, Wouter Duivesteijn, Philipp Honysz, Katharina Morik

When it comes to clustering nonconvex shapes, two paradigms are used to find the most suitable clustering: minimum cut and maximum density.

Clustering Clustering Algorithms Evaluation