In this example we compare the various initialization strategies for K-means in terms of runtime and quality of the results.

This example is meant to illustrate situations where k-means will produce unintuitive and possibly unexpected clusters. In the first three plots, the input

This example shows the effect of imposing a connectivity graph to capture local structure in the data. The graph is simply the graph of 20

In this example, an image with connected circles is generated and spectral clustering is used to separate the circles. In these settings, the

We want to compare the performance of the MiniBatchKMeans and KMeans: the MiniBatchKMeans is faster, but gives slightly different

Face, a 1024 x 768 size image of a raccoon face, is used here to illustrate how k-means is used for vector quantization.

Compute the segmentation of a 2D image with Ward hierarchical clustering. The clustering is spatially constrained in

Example builds a swiss roll dataset and runs hierarchical clustering on their position. For more information, see

Reference: Brendan J. Frey and Delbert Dueck, ?Clustering by Passing Messages Between Data Points?, Science Feb. 2007

Performs a pixel-wise Vector Quantization (VQ) of an image of the summer palace (China), reducing the number of colors required to show the image from 96,615