Pachinko allocation
 | This article relies too much on references to primary sources. (September 2010) (Learn how and when to remove this template message) |
In machine learning and natural language processing, the pachinko allocation model (PAM) is a topic model. Topic models are a suite of algorithms to uncover the hidden thematic structure of a collection of documents. [1] The algorithm improves upon earlier topic models such as latent Dirichlet allocation (LDA) by modeling correlations between topics in addition to the word correlations which constitute topics. PAM provides more flexibility and greater expressive power than latent Dirichlet allocation.[2] While first described and implemented in the context of natural language processing, the algorithm may have applications in other fields such as bioinformatics. The model is named for pachinko machines—a game popular in Japan, in which metal balls bounce down around a complex collection of pins until they land in various bins at the bottom.[3]
History[edit]
Pachinko allocation was first described by Wei Li and Andrew McCallum in 2006.[3] The idea was extended with hierarchical Pachinko allocation by Li, McCallum, and David Mimno in 2007.[4] In 2007, McCallum and his colleagues proposed a nonparametric Bayesian prior for PAM based on a variant of the hierarchical Dirichlet process (HDP).[2] The algorithm has been implemented in the MALLET software package published by McCallum's group at the University of Massachusetts Amherst.
Model[edit]
![[icon]](https://en.wikipedia.org/wiki/File:Wiki_letter_w_cropped.svg){kind=small} | This section needs expansion. You can help by adding to it. (July 2017) |
PAM connects words in V and topics in T with an arbitrary directed acyclic graph (DAG), where topic nodes occupy the interior levels and the leaves are words.
The probability of generating a whole corpus is the product of the probabilities for every document:
See also[edit]
- Probabilistic latent semantic indexing (PLSI), an early topic model from Thomas Hofmann in 1999.[5]
- Latent Dirichlet allocation, a generalization of PLSI developed by David Blei, Andrew Ng, and Michael Jordan in 2002, allowing documents to have a mixture of topics.[6]
- MALLET, an open-source Java library that implements Pachinko allocation.
References[edit]
- ^ Blei, David. "Topic modeling". Retrieved 4 October 2012.
- ^ a b Li, Wei; Blei, David; McCallum, Andrew (2007). "Nonparametric Bayes Pachinko Allocation" (PDF).
- ^ a b Li, Wei; McCallum, Andrew (2006). "Pachinko Allocation: DAG-Structured Mixture Models of Topic Correlations" (PDF). Proceedings of the 23rd International Conference on Machine Learning.
- ^ Mimno, David; Li, Wei; McCallum, Andrew (2007). "Mixtures of Hierarchical Topics with Pachinko Allocation" (PDF). Proceedings of the 24th International Conference on Machine Learning.
- ^ Hofmann, Thomas (1999). "Probabilistic Latent Semantic Indexing" (PDF). Proceedings of the Twenty-Second Annual International SIGIR Conference on Research and Development in Information Retrieval. Archived from the original (PDF) on 2010-12-14.
- ^ Blei, David M.; Ng, Andrew Y.; Jordan, Michael I; Lafferty, John (January 2003). "Latent Dirichlet allocation". Journal of Machine Learning Research. 3: pp. 993–1022. doi:10.1162/jmlr.2003.3.4-5.993.
External links[edit]
- Mixtures of Hierarchical Topics with Pachinko Allocation, a video recording of David Mimno presenting HPAM in 2007.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
