Feature Selection and Kernel Learning for Local Learning-Based Clustering

Authors:
Hong Zeng;Yiu-ming Cheung
Affiliations:
Southeast University, Nanjing and Hong Kong Baptist University, Hong Kong;Hong Kong Baptist University, Hong Kong
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2011

Citing 0
Cited 4

G-Optimal Feature Selection with Laplacian regularization

Neurocomputing
An extension to Rough c-means clustering based on decision-theoretic Rough Sets model

International Journal of Approximate Reasoning
Feature selection and multi-kernel learning for sparse representation on a manifold

Neural Networks
Learning a mixture model for clustering with the completed likelihood minimum message length criterion

Pattern Recognition

Quantified Score

Hi-index	0.14

Visualization

Abstract

The performance of the most clustering algorithms highly relies on the representation of data in the input space or the Hilbert space of kernel methods. This paper is to obtain an appropriate data representation through feature selection or kernel learning within the framework of the Local Learning-Based Clustering (LLC) (Wu and Schölkopf 2006) method, which can outperform the global learning-based ones when dealing with the high-dimensional data lying on manifold. Specifically, we associate a weight to each feature or kernel and incorporate it into the built-in regularization of the LLC algorithm to take into account the relevance of each feature or kernel for the clustering. Accordingly, the weights are estimated iteratively in the clustering process. We show that the resulting weighted regularization with an additional constraint on the weights is equivalent to a known sparse-promoting penalty. Hence, the weights of those irrelevant features or kernels can be shrunk toward zero. Extensive experiments show the efficacy of the proposed methods on the benchmark data sets.