Kernelized Infomax Clustering

We propose a simple information-theoretic clustering approach based on maximizing the mutual information $I(\sfx,y)$ between the unknown cluster labels $y$ and the training patterns $\sfx$ with respect to parameters of specifically constrained encoding distributions. The constraints are chosen such that patterns are likely to be clustered similarly if they lie close to specific (unknown) vectors in the feature space. The method may be conveniently applied to learning the optimal affinity matrix, which corresponds to learning parameters of the kernelized encoder. The procedure does not require computations of eigenvalues or inverses of the Gram matrices, which makes it potentially attractive for clustering large data sets.


Year:
2005
Publisher:
IDIAP
Keywords:
Laboratories:




 Record created 2006-03-10, last modified 2018-01-27

External links:
Download fulltextURL
Download fulltextn/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)