ACM Home Page
Please provide us with feedback. Feedback
On an equivalence between PLSI and LDA
Full text PdfPdf (94 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval table of contents
Toronto, Canada
POSTER SESSION: Posters table of contents
Pages: 433 - 434  
Year of Publication: 2003
ISBN:1-58113-646-3
Authors
Mark Girolami  University of Paisley, UK
Ata Kabán  University of Birmingham, UK
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 110,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/860435.860537
What is a DOI?

ABSTRACT

Latent Dirichlet Allocation (LDA) is a fully generative approach to language modelling which overcomes the inconsistent generative semantics of Probabilistic Latent Semantic Indexing (PLSI). This paper shows that PLSI is a maximum a posteriori estimated LDA model under a uniform Dirichlet prior, therefore the perceived shortcomings of PLSI can be resolved and elucidated within the LDA framework.



CITED BY  6

Collaborative Colleagues:
Mark Girolami: colleagues
Ata Kabán: colleagues