Conic Scan-and-Cover algorithms for nonparametric topic modeling
| 
63 | 
53 | 
0
Abstract
We propose new algorithms for topic modeling when the number of topics is unknown. Our approach relies on an analysis of the concentration of mass and angular geometry of the topic simplex, a convex polytope constructed by taking the convex hull of vertices representing the latent topics. Our algorithms are shown in practice to have accuracy comparable to a Gibbs sampler in terms of topic estimation, which requires the number of topics be given. Moreover, they are one of the fastest among several state of the art parametric techniques.1 Statistical consistency of our estimator is established under some conditions.
还没有评论，说两句吧！
热门资源
Learning to Predi...
Much of model-based reinforcement learning invo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
The Variational S...
Unlike traditional images which do not offer in...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Rating-Boosted La...
The performance of a recommendation system reli...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
