聚类及图像压缩

1、 K-means

k-means叫做k均值算法，算法很简单，先随机选择k个样本作为均值向量，
再计算样本到均值向量之间的距离，距离近的就将其划分的对应簇中，然后不断进行迭代更新，最终就会将样本聚成设定的簇，也就是k个簇。
下面从sklearn的官方文档中找出的案例

import numpy as np
import matplotlib.pyplot as plt

from sklearn.cluster import KMeans
from sklearn.datasets import make_blobs

plt.figure(figsize=(12, 12))

n_samples = 1500
random_state = 170
X, y = make_blobs(n_samples=n_samples, random_state=random_state)

# Incorrect number of clusters
y_pred = KMeans(n_clusters=2, random_state=random_state).fit_predict(X)

plt.subplot(221)
plt.scatter(X[:, 0], X[:, 1], c=y_pred)
plt.title("Incorrect Number of Blobs")

# Anisotropicly distributed data
transformation = [[0.60834549, -0.63667341], [-0.40887718, 0.85253229]]
X_aniso = np.dot(X, transformation)
y_pred = KMeans(n_clusters=3, random_state=random_state).fit_