Clustering – Basic concepts and methods

We review clustering as an analysis tool and the underlying concepts from an introductory perspective. What is clustering and how can clusterings be realised programmatically? How can data be represented and prepared for a clustering task? And how can clustering results be validated? Connectivity-based versus prototype-based approaches are reflected in the context of several popular methods: single-linkage, spectral embedding, k-means, and Gaussian mixtures are discussed as well as the density-based protocols (H)DBSCAN, Jarvis-Patrick, CommonNN, and density-peaks.

READ FULL TEXT

page 35

page 39

research
10/11/2020

Local Connectivity in Centroid Clustering

Clustering is a fundamental task in unsupervised learning, one that targ...
research
06/15/2023

A Survey of Some Density Based Clustering Techniques

Density Based Clustering are a type of Clustering methods using in data ...
research
04/30/2011

Methods of Hierarchical Clustering

We survey agglomerative hierarchical clustering algorithms and discuss e...
research
08/27/2018

Field Formulation of Parzen Data Analysis

The Parzen window density is a well-known technique, associating Gaussia...
research
01/13/2022

Context binning, model clustering and adaptivity for data compression of genetic data

Rapid growth of genetic databases means huge savings from improvements i...
research
01/26/2023

Re-embedding data to strengthen recovery guarantees of clustering

We propose a clustering method that involves chaining four known techniq...
research
03/10/2023

Clustering with minimum spanning trees: How good can it be?

Minimum spanning trees (MSTs) provide a convenient representation of dat...

Please sign up or login with your details

Forgot password? Click here to reset