Nonlinear component analysis as a kernel eigenvalue problem
Neural Computation
Automatic Analysis of Facial Expressions: The State of the Art
IEEE Transactions on Pattern Analysis and Machine Intelligence
Normalized Cuts and Image Segmentation
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Efficient svm training using low-rank kernel representations
The Journal of Machine Learning Research
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Dimensionality Reduction for Supervised Learning with Reproducing Kernel Hilbert Spaces
The Journal of Machine Learning Research
Kernel k-means: spectral clustering and normalized cuts
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
K-means clustering via principal component analysis
ICML '04 Proceedings of the twenty-first international conference on Machine learning
A Unifying Approach to Hard and Probabilistic Clustering
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
The uniqueness of a good optimum for K-means
ICML '06 Proceedings of the 23rd international conference on Machine learning
A duality view of spectral methods for dimensionality reduction
ICML '06 Proceedings of the 23rd international conference on Machine learning
An introduction to nonlinear dimensionality reduction by maximum variance unfolding
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Measuring statistical dependence with hilbert-schmidt norms
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Mercer kernel-based clustering in feature space
IEEE Transactions on Neural Networks
Learning subspace kernels for classification
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Semi-supervised Discriminant Analysis Based on Dependence Estimation
ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications
Discriminant regression analysis to find homogeneous structures
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Generalized clustering via kernel embeddings
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Incorporating the loss function into discriminative clustering of structured outputs
IEEE Transactions on Neural Networks
Solution of the propeller conjecture in R3
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Maximum volume clustering: a new discriminative clustering approach
The Journal of Machine Learning Research
| Hi-index | 0.00 |
We propose a family of clustering algorithms based on the maximization of dependence between the input variables and their cluster labels, as expressed by the Hilbert-Schmidt Independence Criterion (HSIC). Under this framework, we unify the geometric, spectral, and statistical dependence views of clustering, and subsume many existing algorithms as special cases (e.g. k-means and spectral clustering). Distinctive to our framework is that kernels can also be applied on the labels, which can endow them with particular structures. We also obtain a perturbation bound on the change in k-means clustering.