Locally adaptive multiple kernel k-means algorithm based on shared nearest neighbors

Most of multiple kernel clustering algorithms aim to find the optimal kernel combination and have to calculate kernel weights iteratively. For the kernel methods, the scale parameter of Gaussian kernel is usually searched in a number of candidate values of the parameter and the best is selected. In this paper, a novel locally adaptive multiple kernel k-means algorithm is proposed based on shared nearest neighbors. Our similarity measure meets the requirements of the clustering hypothesis, which can describe the relations between data points more reasonably by taking local and global structures into consideration. We assign to each data point a local scale parameter and combine the parameter with shared nearest neighbors to construct kernel matrix. According to the local distribution, the local scale parameter of Gaussian kernel is generated adaptively. Experiments show that the proposed algorithm can effectively deal with the clustering problem of data sets with complex structure or multiple scales.