Scikit Source Code Reading(2015.05.31)

Today’s Job

Today’s job is main about the source reading of plot_color_quantization.py and k_means_.py under scikit-learn-0.15.2\sklearn\cluster in scikit-learn-0.15.2.

Gains

1. pairwise_distances_argmin:
   Compute minimum distances between one point and a set of points.
2. shuffle:
   Shuffle arrays or sparse matrices in a consistent way
3. Lloyd’s algorithm and Vorlonoi Diagram
4. check_random_state(seed):
   Turn seed into a np.random.RandomState instance
5. inertia:
   Sum of distances of samples to their closest cluster center.
6. labels assignment is also called the E-step of EM
   computation of the means is also called the M-step of EM
7. _tolerance(X, tol):
   Return a tolerance which is independent of the dataset

Quesions to be solved

1. def _k_init(X, n_clusters, x_squared_norms, random_state, n_local_trials=None):
   “”“Init n_clusters seeds according to k-means++
   Selects initial cluster centers for k-mean clustering in a smart way
   to speed up convergence. see: Arthur, D. and Vassilvitskii, S.
   “k-means++: the advantages of careful seeding”. ACM-SIAM symposium
   on Discrete algorithms. 2007

   Version ported from http://www.stanford.edu/~darthur/kMeansppTest.zip,
   which is the implementation used in the aforementioned paper.

Grid Search