K-Means, coverings, and Voronoi diagrams
This is the 4th of a series of posts on cluster-algorithms and ideas in data analysis. The $k$-Means algorithm computes a Voronoi partition of the data set such that each landmark is given by the centroid of the corresponding cell….
Mapper – A discrete generalization of the Reeb graph
This is the third of a series of posts on cluster-algorithms and ideas in data analysis. Mapper is a construction that uses a given cluster-algorithm to associate a simplicial complex to a reference map on a given data set. It…
Density-based clustering in spatial data (2)
This is the second of a series of posts on cluster-algorithms and ideas in data analysis (and related fields). Ordering points to identify the clustering structure (OPTICS) is a data clustering algorithm presented by Mihael Ankerst, Markus M. Breunig, Hans-Peter…
Density-based clustering in spatial data (1)
This is the first of a series of posts on cluster-algorithms and ideas in data analysis (and related fields). Density-based spatial clustering of applications with noise (DBSCAN) is a data clustering algorithm proposed by Martin Ester, Hans-Peter Kriegel, Jörg Sander…