sklearn.cluster#
Popular unsupervised clustering algorithms.
User guide. See the Clustering and Biclustering sections for further details.
Perform Affinity Propagation Clustering of data.  | 
|
Agglomerative Clustering.  | 
|
Implements the BIRCH clustering algorithm.  | 
|
Bisecting K-Means clustering.  | 
|
Perform DBSCAN clustering from vector array or distance matrix.  | 
|
Agglomerate features.  | 
|
Cluster data using hierarchical density-based clustering.  | 
|
K-Means clustering.  | 
|
Mean shift clustering using a flat kernel.  | 
|
Mini-Batch K-Means clustering.  | 
|
Estimate clustering structure from vector array.  | 
|
Spectral biclustering (Kluger, 2003).  | 
|
Apply clustering to a projection of the normalized Laplacian.  | 
|
Spectral Co-Clustering algorithm (Dhillon, 2001).  | 
|
Perform Affinity Propagation Clustering of data.  | 
|
Perform DBSCAN extraction for an arbitrary epsilon.  | 
|
Automatically extract clusters according to the Xi-steep method.  | 
|
Compute the OPTICS reachability graph.  | 
|
Perform DBSCAN clustering from vector array or distance matrix.  | 
|
Estimate the bandwidth to use with the mean-shift algorithm.  | 
|
Perform K-means clustering algorithm.  | 
|
Init n_clusters seeds according to k-means++.  | 
|
Perform mean shift clustering of data using a flat kernel.  | 
|
Apply clustering to a projection of the normalized Laplacian.  | 
|
Ward clustering based on a Feature matrix.  |