聚类算法Clustering-KMeans/DBSCAN/DenPeak/NormalizeCut/RCC

本文结构安排

• 经典聚类算法：线性聚类 Kmeans
• 经典聚类算法：非线性聚类 DBSCAN、谱聚类
• 新兴聚类算法：DenPeak，RCC

K-means

K-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster.

Given a set of observations $(x_1,x_2,...,x_n)$,where each observation is a d-dimensional real vector,k-means clustering aims to partition the n observations into $k(\in n)$ set $(S_1,S_2,...,S_k)$ so as to minimize the within-cluster sum of variance,the objective is to find:

$$arg\underset{s}{\min }\sum _{i=1}^k\sum _{x\in S_i}||x-{\mu }_i|{|}^2$$

where ${\mu }_i$ is the mean of points in $S_i$.

DBSCAN

Density-based spatial clustering of applications with noise (DBSCAN) is a data clustering algorithm.It
is a density-based clustering algorithm: given a set of points in some space, it groups together points that are closely packed together (points with many nearby neighbors), marking as outliers points that lie alone in low-density regions (whose nearest neighbors are too far away). DBSCAN is one of the most common clustering algorithms and also most cited in scienti c literature.

Consider a set of points in some space to be clustered. For the purpose of DBSCAN clustering, the points are classi ed as core points,density-reachable points and outliers, as follows:

• A point p is a core point if at least minPts points are within distance $\epsilon$ ($\epsilon$