Document clustering via adaptive subspace iteration
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Relation between PLSA and NMF and implications
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Probabilistic latent semantic analysis
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Non-negative matrix factorisation for object class discovery and image auto-annotation
CIVR '08 Proceedings of the 2008 international conference on Content-based image and video retrieval
PQC: personalized query classification
Proceedings of the 18th ACM conference on Information and knowledge management
Larger residuals, less work: active document scheduling for latent dirichlet allocation
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
More influence means less work: fast latent dirichlet allocation by influence scheduling
Proceedings of the 20th ACM international conference on Information and knowledge management
Non-negative multiple matrix factorization
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.05 |
In this paper, we show that PLSI and NMF optimize the same objective function, although PLSI and NMF are different algorithms as verified by experiments. In addition, we also propose a new hybrid method that runs PLSI and NMF alternatively to achieve better solutions.