user- Anna Szymkowiak Have, Mark A. Girolami, Jan Larsen Abstract: Methods for spectral clustering have been proposed recently which rely on the eigenvalue d...Anna Szymkowiak Have, Mark A. Girolami, Jan Larsen Abstract: 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.
- ICML '02: Proceedings of the Nineteenth International Conference on Machine Learning, page 315--322. San Francisco, CA, USA, Morgan Kaufmann Publishers Inc., (2002)
- UTCS Technical Report #TR-04-25. University of Texas, Austin, (2005)
- KDD '05: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, page 629--634. New York, NY, USA, ACM Press, (2005)
- Neural Process. Lett. 18(3):155--162 (2003)
