DocumentCode :
595190
Title :
On the relation between K-means and PLSA
Author :
Chaudhuri, A.R. ; Murty, M. Narasimha
Author_Institution :
Dept. of EE (SSA), Indian Inst. of Sci., Bangalore, India
fYear :
2012
fDate :
11-15 Nov. 2012
Firstpage :
2298
Lastpage :
2301
Abstract :
Non-negative matrix factorization [5](NMF) is a well known tool for unsupervised machine learning. It can be viewed as a generalization of the K-means clustering, Expectation Maximization based clustering and aspect modeling by Probabilistic Latent Semantic Analysis (PLSA). Specifically PLSA is related to NMF with KL-divergence objective function. Further it is shown that K-means clustering is a special case of NMF with matrix L2 norm based error function. In this paper our objective is to analyze the relation between K-means clustering and PLSA by examining the KL-divergence function and matrix L2 norm based error function.
Keywords :
error analysis; expectation-maximisation algorithm; matrix algebra; matrix decomposition; pattern clustering; probability; K-means clustering; KL-divergence objective function; NMF; PLSA; aspect modeling; expectation maximization-based clustering; matrix L2 norm-based error function; nonnegative matrix factorization; probabilistic latent semantic analysis; unsupervised machine learning; Entropy; Equations; Linear programming; Machine learning; Manganese; Probabilistic logic; Semantics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pattern Recognition (ICPR), 2012 21st International Conference on
Conference_Location :
Tsukuba
ISSN :
1051-4651
Print_ISBN :
978-1-4673-2216-4
Type :
conf
Filename :
6460624
Link To Document :
بازگشت