Description

In this assignment you will investigate the performance of different kernel methods for k-means clustering. Recall that in k-means clustering the goal is to minimize the sum of distances of the data points from their nearest centroids. Following the terminology of the book, given the d-dimensional data points P = {x1,…,xn} and k ∈ N, we want to find the partition P = {P1,…,Pk} of P that minimizes the sum of distances of all data points from their corresponding centroids, over all partitions, i.e.
k
argminXX kxj − cik2 ,
P
i=1xj∈Pi
where the centroids ci are formally defined as xj. If the distances are scaled, we are dealing with weighted k-means clustering. In this case the distances are d(x,ci) = wi kx − cik2 and the centroids are defined as c .
Polynomial Kil = (xi · xl + c)d
Gaussian Kil = exp(−kxi − xlk2 /2σ2)
Sigmoid Kil = tanh(cxi · xl + θ)
Note that here the overall sum to be minimized is as given in equation (18) in page 253 of the book.
In this homework we will test the classification performance of k-means clustering technique in the classification of handwritten digits in the MNIST database which can be found in the following link: http: //yann.lecun.com/exdb/mnist/. In this database, there are training and test data with corresponding labels in separate files.
First, on the training data investigate how well you can identify the number of classes by using standard k-means and kernel based k-means algorithms. Then, for k = 10, try to choose the number of iterations until termination and the parameters of your kernel based approaches to obtain a high accuracy of classification on the training data. Support your findings with relevant plots. Report the set of parameters and number of iterations until termination as well as the classification accuracy on the training data. Then, use those k-means classifiers on the test data and report the classification accuracy. Comment on your observations.
1