“Infinite LDA” – Implementing the HDP with minimum code complexity

  • Heinrich G
N/ACitations
Citations of this article
116Readers
Mendeley users who have this article in their library.

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).

Cite

CITATION STYLE

APA

Heinrich, G. (2011). “Infinite LDA” – Implementing the HDP with minimum code complexity. Arbylon.Net, 1–20. Retrieved from http://arbylon.net/publications/ilda.pdf

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free