Regularization, robustness and sparsity of probabilistic topic models
2012Journal articleKonstantin Vyacheslavovich Vorontsov, Anna Alexandrovna Potapenko
Computer Research and Modeling
We propose a generalized probabilistic topic model of text corpora which can incorporate heuristics of Bayesian regularization, sampling, frequent parameters update, and robustness in any combinations. Wellknown models PLSA, LDA, CVB0, SWB, and many others can be considered as special cases of the proposed broad family of models. We propose the robust PLSA model and show that it is more sparse and performs better that regularized models like LDA.
0
5