Semester of Graduation
First Major Professor
Master of Science (MS)
Kernel K-means extends the standard K-means clustering method to identify non-spherical clusters by performing the algorithm in a higher dimensional feature space. Typically, this extension is implemented using a method based on Lloyd's heuristic. A method based on Hartigan and Wong's heuristic is presented here, which improves the run time required to reach the final clustering. Additionally, methods for selecting the number of clusters and the tuning parameter for the Gaussian kernel are discussed. An adaptation of the K-means++ initialization method is also presented and discussed. Each of the methods is evaluated and compared on fourteen synthetic data sets, displaying the advantages of the proposed clustering method, along with limitations of the adapted parameter selection methods.
Embargo Period (admin only)
Berlinski, Joshua, "An efficient algorithm for kernel K means" (2021). Creative Components. 710.