Infinite LDA ” – Implementing the HDP with minimum code complexity
arbylonnet (2011)
Available from arbylon.net
or
Abstract
Shows how the hierarchical Dirichlet process (HDP) may be imple- mented in a simple way, following the idea that the HDP is an extension to its parametric counterpart, latent Dirichlet allocation (LDA).
Available from arbylon.net
Page 1
Page 2
Page 3
Readership Statistics
43 Readers on Mendeley
by Discipline
2% Medicine
by Academic Status
42% Ph.D. Student
16% Student (Master)
12% Researcher (at a non-Academic Institution)
by Country
21% United States
16% Japan
12% China
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
