Have, Anna Szynkowiak1; Girolami, Mark A.3; Larsen, Jan4
1 Department of Informatics and Mathematical Modeling, Technical University of Denmark2 Cognitive Systems, Department of Informatics and Mathematical Modeling, Technical University of Denmark3 unknown4 Copenhagen Center for Health Technology, Center, Technical University of Denmark
Methods for spectral clustering have been proposed recently which rely on the eigenvalue decomposition of an affinity matrix. In this work it is proposed that the affinity matrix is created based on the elements of a non-parametric density estimator. This matrix is then decomposed to obtain posterior probabilities of class membership using an appropriate form of nonnegative matrix factorization. The troublesome selection of hyperparameters such as kernel width and number of clusters can be obtained using standard cross-validation methods as is demonstrated on a number of diverse data sets.
I E E E Transactions on Neural Networks, 2006, Vol 17, Issue 1, p. 256-264