plot_kmeans_digits.py

"""
===========================================================
A demo of K-Means clustering on the handwritten digits data
===========================================================

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

As the ground truth is known here, we also apply different cluster
quality metrics to judge the goodness of fit of the cluster labels to the
ground truth.

Cluster quality metrics evaluated (see :ref:`clustering_evaluation` for
definitions and discussions of the metrics):

=========== ========================================================
Shorthand    full name
=========== ========================================================
homo         homogeneity score
compl        completeness score
v-meas       V measure
ARI          adjusted Rand index
AMI          adjusted mutual information
silhouette   silhouette coefficient
=========== ========================================================

"""
print(__doc__)

from time import time
import numpy as np
import matplotlib.pyplot as plt

from sklearn import metrics
from sklearn.cluster import KMeans
from sklearn.datasets import load_digits
from sklearn.decomposition import PCA
from sklearn.preprocessing import scale
import sys
import json


np.random.seed(42)


print(sys.argv)
ENV = int(sys.argv[1]) if len(sys.argv) >= 2 else 0
n_classes_ = int(sys.argv[4]) if len(sys.argv) >= 5 else 3
n_labels_ = int(sys.argv[5]) if len(sys.argv) >= 6 else 2
class_edge_colors = [ 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red', 'orange', 'blue', 'red' ]
n_components_ = int(sys.argv[6]) if len(sys.argv) >= 7 else 2
input_to_be_predicted = None
input_to_be_predicted_labels = None

if ENV == 0:
    digits = load_digits()
    data = scale(digits.data)

    n_samples, n_features = data.shape
    n_digits = len(np.unique(digits.target))
    labels = digits.target

    sample_size = 300
else:
    data = np.array( json.load( open( sys.argv[2] ) ) )
    #y = np.zeros( len(X) )
    input_to_be_predicted = np.array( json.load( open( sys.argv[3] ) ) )
    
    input_to_be_predicted_labels = np.array( json.load( open( sys.argv[14] ) ) ) if len(sys.argv) >= 15 else None

    n_samples = len(data)
    n_features = len(data[0])
    n_digits = n_classes_
    

print("n_digits: %d, \t n_samples %d, \t n_features %d"
      % (n_digits, n_samples, n_features))


"""      
print(82 * '_')
print('init\t\ttime\tinertia\thomo\tcompl\tv-meas\tARI\tAMI\tsilhouette')


def bench_k_means(estimator, name, data):
    t0 = time()
    estimator.fit(data)
    print('%-9s\t%.2fs\t%i\t%.3f\t%.3f\t%.3f\t%.3f\t%.3f\t%.3f'
          % (name, (time() - t0), estimator.inertia_,
             metrics.homogeneity_score(labels, estimator.labels_),
             metrics.completeness_score(labels, estimator.labels_),
             metrics.v_measure_score(labels, estimator.labels_),
             metrics.adjusted_rand_score(labels, estimator.labels_),
             metrics.adjusted_mutual_info_score(labels,  estimator.labels_),
             metrics.silhouette_score(data, estimator.labels_,
                                      metric='euclidean',
                                      sample_size=sample_size)))

bench_k_means(KMeans(init='k-means++', n_clusters=n_digits, n_init=10),
              name="k-means++", data=data)

bench_k_means(KMeans(init='random', n_clusters=n_digits, n_init=10),
              name="random", data=data)

# in this case the seeding of the centers is deterministic, hence we run the
# kmeans algorithm only once with n_init=1
pca = PCA(n_components=n_digits).fit(data)
bench_k_means(KMeans(init=pca.components_, n_clusters=n_digits, n_init=1),
              name="PCA-based",
              data=data)
print(82 * '_')
"""


# #############################################################################
# Visualize the results on PCA-reduced data

reduced_data = PCA(n_components=2).fit_transform(data)
kmeans = KMeans(init='k-means++', n_clusters=n_digits, n_init=10)
kmeans.fit(reduced_data)

# Step size of the mesh. Decrease to increase the quality of the VQ.
h = .02     # point in the mesh [x_min, x_max]x[y_min, y_max].

# Plot the decision boundary. For that, we will assign a color to each
x_min, x_max = reduced_data[:, 0].min() - 1, reduced_data[:, 0].max() + 1
y_min, y_max = reduced_data[:, 1].min() - 1, reduced_data[:, 1].max() + 1
xx, yy = np.meshgrid(np.arange(x_min, x_max, h), np.arange(y_min, y_max, h))


#
if not input_to_be_predicted.any() == None:
    print("predict result")
    input_to_be_predicted = PCA(n_components=2).fit_transform(input_to_be_predicted)
    res = kmeans.predict( input_to_be_predicted )
    print( res )

    print("target")
    print( input_to_be_predicted_labels )
    
    from cross_entropy import cross_entropy
    print("cross_entropy")
    print( cross_entropy(res, input_to_be_predicted_labels) )

    
# Obtain labels for each point in mesh. Use last trained model.
Z = kmeans.predict(np.c_[xx.ravel(), yy.ravel()])

# Put the result into a color plot
Z = Z.reshape(xx.shape)
plt.figure(1)
plt.clf()
plt.imshow(Z, interpolation='nearest',
           extent=(xx.min(), xx.max(), yy.min(), yy.max()),
           cmap=plt.cm.Paired,
           aspect='auto', origin='lower')

plt.plot(reduced_data[:, 0], reduced_data[:, 1], 'k.', markersize=2)
# Plot the centroids as a white X
centroids = kmeans.cluster_centers_
plt.scatter(centroids[:, 0], centroids[:, 1],
            marker='x', s=169, linewidths=3,
            color='w', zorder=10)
plt.title('K-means clustering on the digits dataset (PCA-reduced data)\n'
          'Centroids are marked with white cross')
plt.xlim(x_min, x_max)
plt.ylim(y_min, y_max)
plt.xticks(())
plt.yticks(())
plt.show()