Latent Dirichlet allocation

Short description: Probability model

In natural language processing, latent Dirichlet allocation (LDA) is a Bayesian network (and, therefore, a generative statistical model) for modeling automatically extracted topics in textual corpora. The LDA is an example of a Bayesian topic model. In this, observations (e.g., words) are collected into documents, and each word's presence is attributable to one of the document's topics. Each document will contain a small number of topics.

History

In the context of population genetics, LDA was proposed by J. K. Pritchard, M. Stephens and P. Donnelly in 2000.

LDA was applied in machine learning by David Blei, Andrew Ng and Michael I. Jordan in 2003.

Overview

Evolutionary biology and bio-medicine

In evolutionary biology and bio-medicine, the model is used to detect the presence of structured genetic variation in a group of individuals. The model assumes that alleles carried by individuals under study have origin in various extant or past populations. The model and various inference algorithms allow scientists to estimate the allele frequencies in those source populations and the origin of alleles carried by individuals under study. The source populations can be interpreted ex-post in terms of various evolutionary scenarios. In association studies, detecting the presence of genetic structure is considered a necessary preliminary step to avoid confounding.

Clinical psychology, mental health, and social science

In clinical psychology research, LDA has been used to identify common themes of self-images experienced by young people in social situations. Other social scientists have used LDA to examine large sets of topical data from discussions on social media (e.g., tweets about prescription drugs).

Musicology

In the context of computational musicology, LDA has been used to discover tonal structures in different corpora.

Machine learning

One application of LDA in machine learning - specifically, topic discovery, a subproblem in natural language processing – is to discover topics in a collection of documents, and then automatically classify any individual document within the collection in terms of how "relevant" it is to each of the discovered topics. A topic is considered to be a set of terms (i.e., individual words or phrases) that, taken together, suggest a shared theme.

For example, in a document collection related to pet animals, the terms dog, spaniel, beagle, golden retriever, puppy, bark, and woof would suggest a DOG_related theme, while the terms cat, siamese, Maine coon, tabby, manx, meow, purr, and kitten would suggest a CAT_related theme. There may be many more topics in the collection – e.g., related to diet, grooming, healthcare, behavior, etc. that we do not discuss for simplicity's sake. (Very common, so called stop words in a language – e.g., "the", "an", "that", "are", "is", etc., – would not discriminate between topics and are usually filtered out by pre-processing before LDA is performed. Pre-processing also converts terms to their "root" lexical forms – e.g., "barks", "barking", and "barked" would be converted to "bark".)

If the document collection is sufficiently large, LDA will discover such sets of terms (i.e., topics) based upon the co-occurrence of individual terms, though the task of assigning a meaningful label to an individual topic (i.e., that all the terms are DOG_related) is up to the user, and often requires specialized knowledge (e.g., for collection of technical documents). The LDA approach assumes that:

1. The semantic content of a document is composed by combining one or more terms from one or more topics.
2. Certain terms are ambiguous, belonging to more than one topic, with different probability. (For example, the term training can apply to both dogs and cats, but are more likely to refer to dogs, which are used as work animals or participate in obedience or skill competitions.) However, in a document, the accompanying presence of specific neighboring terms (which belong to only one topic) will disambiguate their usage.
3. Most documents will contain only a relatively small number of topics. In the collection, e.g., individual topics will occur with differing frequencies. That is, they have a probability distribution, so that a given document is more likely to contain some topics than others.
4. Within a topic, certain terms will be used much more frequently than others. In other words, the terms within a topic will also have their own probability distribution.

When LDA machine learning is employed, both sets of probabilities are computed during the training phase, using Bayesian methods and an Expectation Maximization algorithm.

LDA is a generalization of older approach of probabilistic latent semantic analysis (pLSA), The pLSA model is equivalent to LDA under a uniform Dirichlet prior distribution. pLSA relies on only the first two assumptions above and does not care about the remainder. While both methods are similar in principle and require the user to specify the number of topics to be discovered before the start of training (as with K-means clustering) LDA has the following advantages over pLSA:

• LDA yields better disambiguation of words and a more precise assignment of documents to topics.
• Computing probabilities allows a "generative" process by which a collection of new “synthetic documents” can be generated that would closely reflect the statistical characteristics of the original collection.
• Unlike LDA, pLSA is vulnerable to overfitting especially when the size of corpus increases.
• The LDA algorithm is more readily amenable to scaling up for large data sets using the MapReduce approach on a computing cluster.

Model

Plate notation representing the LDA model

With plate notation, which is often used to represent probabilistic graphical models (PGMs), the dependencies among the many variables can be captured concisely. The boxes are "plates" representing replicates, which are repeated entities. The outer plate represents documents, while the inner plate represents the repeated word positions in a given document; each position is associated with a choice of topic and word. The variable names are defined as follows:

M denotes the number of documents

N is number of words in a given document (document i has [math]\displaystyle{ N_i }[/math] words)

α is the parameter of the Dirichlet prior on the per-document topic distributions

β is the parameter of the Dirichlet prior on the per-topic word distribution

[math]\displaystyle{ \theta_i }[/math] is the topic distribution for document i

[math]\displaystyle{ \varphi_k }[/math] is the word distribution for topic k

[math]\displaystyle{ z_{ij} }[/math] is the topic for the j-th word in document i

[math]\displaystyle{ w_{ij} }[/math] is the specific word.

Plate notation for LDA with Dirichlet-distributed topic-word distributions

The fact that W is grayed out means that words [math]\displaystyle{ w_{ij} }[/math] are the only observable variables, and the other variables are latent variables. As proposed in the original paper, a sparse Dirichlet prior can be used to model the topic-word distribution, following the intuition that the probability distribution over words in a topic is skewed, so that only a small set of words have high probability. The resulting model is the most widely applied variant of LDA today. The plate notation for this model is shown on the right, where [math]\displaystyle{ K }[/math] denotes the number of topics and [math]\displaystyle{ \varphi_1, \dots, \varphi_K }[/math] are [math]\displaystyle{ V }[/math]-dimensional vectors storing the parameters of the Dirichlet-distributed topic-word distributions ([math]\displaystyle{ V }[/math] is the number of words in the vocabulary).

It is helpful to think of the entities represented by [math]\displaystyle{ \theta }[/math] and [math]\displaystyle{ \varphi }[/math] as matrices created by decomposing the original document-word matrix that represents the corpus of documents being modeled. In this view, [math]\displaystyle{ \theta }[/math] consists of rows defined by documents and columns defined by topics, while [math]\displaystyle{ \varphi }[/math] consists of rows defined by topics and columns defined by words. Thus, [math]\displaystyle{ \varphi_1, \dots, \varphi_K }[/math] refers to a set of rows, or vectors, each of which is a distribution over words, and [math]\displaystyle{ \theta_1, \dots, \theta_M }[/math]refers to a set of rows, each of which is a distribution over topics.

Generative process

To actually infer the topics in a corpus, we imagine a generative process whereby the documents are created, so that we may infer, or reverse engineer, it. We imagine the generative process as follows. Documents are represented as random mixtures over latent topics, where each topic is characterized by a distribution over all the words. LDA assumes the following generative process for a corpus [math]\displaystyle{ D }[/math] consisting of [math]\displaystyle{ M }[/math] documents each of length [math]\displaystyle{ N_i }[/math]:

1. Choose [math]\displaystyle{ \theta_i \sim \operatorname{Dir}(\alpha) }[/math], where [math]\displaystyle{ i \in \{ 1,\dots,M \} }[/math] and [math]\displaystyle{ \mathrm{Dir}(\alpha) }[/math] is a Dirichlet distribution with a symmetric parameter [math]\displaystyle{ \alpha }[/math] which typically is sparse ([math]\displaystyle{ \alpha \lt 1 }[/math])

2. Choose [math]\displaystyle{ \varphi_k \sim \operatorname{Dir}(\beta) }[/math], where [math]\displaystyle{ k \in \{ 1,\dots,K \} }[/math] and [math]\displaystyle{ \beta }[/math] typically is sparse

3. For each of the word positions [math]\displaystyle{ i, j }[/math], where [math]\displaystyle{ i \in \{ 1,\dots,M \} }[/math], and [math]\displaystyle{ j \in \{ 1,\dots,N_i \} }[/math]

(a) Choose a topic [math]\displaystyle{ z_{i,j} \sim\operatorname{Multinomial}(\theta_i). }[/math]

(b) Choose a word [math]\displaystyle{ w_{i,j} \sim\operatorname{Multinomial}( \varphi_{z_{i,j}}). }[/math]

(Note that multinomial distribution here refers to the multinomial with only one trial, which is also known as the categorical distribution.)

The lengths [math]\displaystyle{ N_i }[/math] are treated as independent of all the other data generating variables ([math]\displaystyle{ w }[/math] and [math]\displaystyle{ z }[/math]). The subscript is often dropped, as in the plate diagrams shown here.

Definition

A formal description of LDA is as follows:

Definition of variables in the model

Variable	Type	Meaning
[math]\displaystyle{ K }[/math]	integer	number of topics (e.g. 50)
[math]\displaystyle{ V }[/math]	integer	number of words in the vocabulary (e.g. 50,000 or 1,000,000)
[math]\displaystyle{ M }[/math]	integer	number of documents
[math]\displaystyle{ N_{d=1 \dots M} }[/math]	integer	number of words in document d
[math]\displaystyle{ N }[/math]	integer	total number of words in all documents; sum of all [math]\displaystyle{ N_d }[/math] values, i.e. [math]\displaystyle{ N = \sum_{d=1}^{M} N_d }[/math]
[math]\displaystyle{ \alpha_{k=1 \dots K} }[/math]	positive real	prior weight of topic k in a document; usually the same for all topics; normally a number less than 1, e.g. 0.1, to prefer sparse topic distributions, i.e. few topics per document
[math]\displaystyle{ \boldsymbol\alpha }[/math]	K-dimensional vector of positive reals	collection of all [math]\displaystyle{ \alpha_k }[/math] values, viewed as a single vector
[math]\displaystyle{ \beta_{w=1 \dots V} }[/math]	positive real	prior weight of word w in a topic; usually the same for all words; normally a number much less than 1, e.g. 0.001, to strongly prefer sparse word distributions, i.e. few words per topic
[math]\displaystyle{ \boldsymbol\beta }[/math]	V-dimensional vector of positive reals	collection of all [math]\displaystyle{ \beta_w }[/math] values, viewed as a single vector
[math]\displaystyle{ \varphi_{k=1 \dots K,w=1 \dots V} }[/math]	probability (real number between 0 and 1)	probability of word w occurring in topic k
[math]\displaystyle{ \boldsymbol\varphi_{k=1 \dots K} }[/math]	V-dimensional vector of probabilities, which must sum to 1	distribution of words in topic k
[math]\displaystyle{ \theta_{d=1 \dots M,k=1 \dots K} }[/math]	probability (real number between 0 and 1)	probability of topic k occurring in document d
[math]\displaystyle{ \boldsymbol\theta_{d=1 \dots M} }[/math]	K-dimensional vector of probabilities, which must sum to 1	distribution of topics in document d
[math]\displaystyle{ z_{d=1 \dots M,w=1 \dots N_d} }[/math]	integer between 1 and K	identity of topic of word w in document d
[math]\displaystyle{ \mathbf{Z} }[/math]	N-dimensional vector of integers between 1 and K	identity of topic of all words in all documents
[math]\displaystyle{ w_{d=1 \dots M,w=1 \dots N_d} }[/math]	integer between 1 and V	identity of word w in document d
[math]\displaystyle{ \mathbf{W} }[/math]	N-dimensional vector of integers between 1 and V	identity of all words in all documents

We can then mathematically describe the random variables as follows:

[math]\displaystyle{ \begin{align} \boldsymbol\varphi_{k=1 \dots K} &\sim \operatorname{Dirichlet}_V(\boldsymbol\beta) \\ \boldsymbol\theta_{d=1 \dots M} &\sim \operatorname{Dirichlet}_K(\boldsymbol\alpha) \\ z_{d=1 \dots M,w=1 \dots N_d} &\sim \operatorname{Categorical}_K(\boldsymbol\theta_d) \\ w_{d=1 \dots M,w=1 \dots N_d} &\sim \operatorname{Categorical}_V(\boldsymbol\varphi_{z_{dw}}) \end{align} }[/math]

Inference

Learning the various distributions (the set of topics, their associated word probabilities, the topic of each word, and the particular topic mixture of each document) is a problem of statistical inference.

Monte Carlo simulation

The original paper by Pritchard et al. used approximation of the posterior distribution by Monte Carlo simulation. Alternative proposal of inference techniques include Gibbs sampling.

Variational Bayes

The original ML paper used a variational Bayes approximation of the posterior distribution.

Likelihood maximization

A direct optimization of the likelihood with a block relaxation algorithm proves to be a fast alternative to MCMC.

Unknown number of populations/topics

In practice, the optimal number of populations or topics is not known beforehand. It can be estimated by approximation of the posterior distribution with reversible-jump Markov chain Monte Carlo.

Alternative approaches

Alternative approaches include expectation propagation.

Recent research has been focused on speeding up the inference of latent Dirichlet allocation to support the capture of a massive number of topics in a large number of documents. The update equation of the collapsed Gibbs sampler mentioned in the earlier section has a natural sparsity within it that can be taken advantage of. Intuitively, since each document only contains a subset of topics [math]\displaystyle{ K_d }[/math], and a word also only appears in a subset of topics [math]\displaystyle{ K_w }[/math], the above update equation could be rewritten to take advantage of this sparsity.

[math]\displaystyle{ p(Z_{d,n} = k) \propto \frac{\alpha\beta}{C_k^{\neg n} + V\beta} + \frac{C_k^d \beta}{C_k^{\neg n} + V\beta} + \frac{C_k^w(\alpha + C_k^d)}{C_k^{\neg n} + V\beta} }[/math]

In this equation, we have three terms, out of which two are sparse, and the other is small. We call these terms [math]\displaystyle{ a, b }[/math] and [math]\displaystyle{ c }[/math] respectively. Now, if we normalize each term by summing over all the topics, we get:

[math]\displaystyle{ A = \sum_{k=1}^K \frac{\alpha\beta}{C_k^{\neg n} + V\beta} }[/math]

[math]\displaystyle{ B = \sum_{k=1}^K \frac{C_k^d \beta}{C_k^{\neg n} + V\beta} }[/math]

[math]\displaystyle{ C = \sum_{k=1}^K \frac{C_k^w(\alpha + C_k^d)}{C_k^{\neg n} + V\beta} }[/math]

Here, we can see that [math]\displaystyle{ B }[/math] is a summation of the topics that appear in document [math]\displaystyle{ d }[/math], and [math]\displaystyle{ C }[/math] is also a sparse summation of the topics that a word [math]\displaystyle{ w }[/math] is assigned to across the whole corpus. [math]\displaystyle{ A }[/math] on the other hand, is dense but because of the small values of [math]\displaystyle{ \alpha }[/math] & [math]\displaystyle{ \beta }[/math], the value is very small compared to the two other terms.

Now, while sampling a topic, if we sample a random variable uniformly from [math]\displaystyle{ s \sim U(s|\mid A+B+C) }[/math], we can check which bucket our sample lands in. Since [math]\displaystyle{ A }[/math] is small, we are very unlikely to fall into this bucket; however, if we do fall into this bucket, sampling a topic takes [math]\displaystyle{ O(K) }[/math] time (same as the original Collapsed Gibbs Sampler). However, if we fall into the other two buckets, we only need to check a subset of topics if we keep a record of the sparse topics. A topic can be sampled from the [math]\displaystyle{ B }[/math] bucket in [math]\displaystyle{ O(K_d) }[/math] time, and a topic can be sampled from the [math]\displaystyle{ C }[/math] bucket in [math]\displaystyle{ O(K_w) }[/math] time where [math]\displaystyle{ K_d }[/math] and [math]\displaystyle{ K_w }[/math] denotes the number of topics assigned to the current document and current word type respectively.

Notice that after sampling each topic, updating these buckets is all basic [math]\displaystyle{ O(1) }[/math] arithmetic operations.

Aspects of computational details

Following is the derivation of the equations for collapsed Gibbs sampling, which means [math]\displaystyle{ \varphi }[/math]s and [math]\displaystyle{ \theta }[/math]s will be integrated out. For simplicity, in this derivation the documents are all assumed to have the same length [math]\displaystyle{ N_{} }[/math]. The derivation is equally valid if the document lengths vary.

According to the model, the total probability of the model is:

[math]\displaystyle{ P(\boldsymbol{W}, \boldsymbol{Z}, \boldsymbol{\theta}, \boldsymbol{\varphi};\alpha,\beta) = \prod_{i=1}^K P(\varphi_i;\beta) \prod_{j=1}^M P(\theta_j;\alpha) \prod_{t=1}^N P(Z_{j,t}\mid\theta_j)P(W_{j,t}\mid\varphi_{Z_{j,t}}) , }[/math]

where the bold-font variables denote the vector version of the variables. First, [math]\displaystyle{ \boldsymbol{\varphi} }[/math] and [math]\displaystyle{ \boldsymbol{\theta} }[/math] need to be integrated out.

[math]\displaystyle{ \begin{align} & P(\boldsymbol{Z}, \boldsymbol{W};\alpha,\beta) = \int_{\boldsymbol{\theta}} \int_{\boldsymbol{\varphi}} P(\boldsymbol{W}, \boldsymbol{Z}, \boldsymbol{\theta}, \boldsymbol{\varphi};\alpha,\beta) \, d\boldsymbol{\varphi} \, d\boldsymbol{\theta} \\ = {} & \int_{\boldsymbol{\varphi}} \prod_{i=1}^K P(\varphi_i;\beta) \prod_{j=1}^M \prod_{t=1}^N P(W_{j,t}\mid\varphi_{Z_{j,t}}) \, d\boldsymbol{\varphi} \int_{\boldsymbol{\theta}} \prod_{j=1}^M P(\theta_j;\alpha) \prod_{t=1}^N P(Z_{j,t}\mid\theta_j) \, d\boldsymbol{\theta}. \end{align} }[/math]

All the [math]\displaystyle{ \theta }[/math]s are independent to each other and the same to all the [math]\displaystyle{ \varphi }[/math]s. So we can treat each [math]\displaystyle{ \theta }[/math] and each [math]\displaystyle{ \varphi }[/math] separately. We now focus only on the [math]\displaystyle{ \theta }[/math] part.

[math]\displaystyle{ \int_{\boldsymbol{\theta}} \prod_{j=1}^M P(\theta_j;\alpha) \prod_{t=1}^N P(Z_{j,t}\mid\theta_j) \,d\boldsymbol{\theta} = \prod_{j=1}^M \int_{\theta_j} P(\theta_j;\alpha) \prod_{t=1}^N P(Z_{j,t}\mid\theta_j) \, d\theta_j. }[/math]

We can further focus on only one [math]\displaystyle{ \theta }[/math] as the following:

[math]\displaystyle{ \int_{\theta_j} P(\theta_j;\alpha) \prod_{t=1}^N P(Z_{j,t}\mid\theta_j) \, d\theta_j . }[/math]

Actually, it is the hidden part of the model for the [math]\displaystyle{ j^{th} }[/math] document. Now we replace the probabilities in the above equation by the true distribution expression to write out the explicit equation.

[math]\displaystyle{ \int_{\theta_j} P(\theta_j;\alpha) \prod_{t=1}^N P(Z_{j,t}\mid\theta_j) \, d\theta_j = \int_{\theta_j} \frac{\Gamma\left (\sum_{i=1}^K \alpha_i \right)}{\prod_{i=1}^K \Gamma(\alpha_i)} \prod_{i=1}^K \theta_{j,i}^{\alpha_i - 1} \prod_{t=1}^N P(Z_{j,t}\mid\theta_j) \, d\theta_j. }[/math]

Let [math]\displaystyle{ n_{j,r}^i }[/math] be the number of word tokens in the [math]\displaystyle{ j^{th} }[/math] document with the same word symbol (the [math]\displaystyle{ r^{th} }[/math] word in the vocabulary) assigned to the [math]\displaystyle{ i^{th} }[/math] topic. So, [math]\displaystyle{ n_{j,r}^i }[/math] is three dimensional. If any of the three dimensions is not limited to a specific value, we use a parenthesized point [math]\displaystyle{ (\cdot) }[/math] to denote. For example, [math]\displaystyle{ n_{j,(\cdot)}^i }[/math] denotes the number of word tokens in the [math]\displaystyle{ j^{th} }[/math] document assigned to the [math]\displaystyle{ i^{th} }[/math] topic. Thus, the right most part of the above equation can be rewritten as:

[math]\displaystyle{ \prod_{t=1}^N P(Z_{j,t}\mid\theta_j) = \prod_{i=1}^K \theta_{j,i}^{n_{j,(\cdot)}^i} . }[/math]

So the [math]\displaystyle{ \theta_j }[/math] integration formula can be changed to:

[math]\displaystyle{ \int_{\theta_j} \frac{\Gamma\left (\sum_{i=1}^K \alpha_i \right)}{\prod_{i=1}^K \Gamma(\alpha_i)} \prod_{i=1}^K \theta_{j,i}^{\alpha_i - 1} \prod_{i=1}^K \theta_{j,i}^{n_{j,(\cdot)}^i} \, d\theta_j = \int_{\theta_j} \frac{\Gamma\left (\sum_{i=1}^K \alpha_i \right)}{\prod_{i=1}^K \Gamma(\alpha_i)} \prod_{i=1}^K \theta_{j,i}^{n_{j,(\cdot)}^i+\alpha_i - 1} \, d\theta_j. }[/math]

The equation inside the integration has the same form as the Dirichlet distribution. According to the Dirichlet distribution,

[math]\displaystyle{ \int_{\theta_j} \frac{\Gamma\left (\sum_{i=1}^K n_{j,(\cdot)}^i+\alpha_i \right)}{\prod_{i=1}^K \Gamma(n_{j,(\cdot)}^i+\alpha_i)} \prod_{i=1}^K \theta_{j,i}^{n_{j,(\cdot)}^i+\alpha_i - 1} \, d\theta_j =1 . }[/math]

Thus,

[math]\displaystyle{ \begin{align} & \int_{\theta_j} P(\theta_j;\alpha) \prod_{t=1}^N P(Z_{j,t}\mid\theta_j) \, d\theta_j = \int_{\theta_j} \frac{\Gamma\left (\sum_{i=1}^K \alpha_i \right)}{\prod_{i=1}^K \Gamma(\alpha_i)} \prod_{i=1}^K \theta_{j,i}^{n_{j,(\cdot)}^i+\alpha_i - 1} \, d\theta_j \\ [8pt] = {} & \frac{\Gamma\left (\sum_{i=1}^K \alpha_i \right )}{\prod_{i=1}^K \Gamma(\alpha_i)}\frac{\prod_{i=1}^K \Gamma(n_{j,(\cdot)}^i+\alpha_i)}{\Gamma\left (\sum_{i=1}^K n_{j,(\cdot)}^i+\alpha_i \right )} \int_{\theta_j} \frac{\Gamma\left (\sum_{i=1}^K n_{j,(\cdot)}^i+\alpha_i \right)}{\prod_{i=1}^K \Gamma(n_{j,(\cdot)}^i+\alpha_i)} \prod_{i=1}^K \theta_{j,i}^{n_{j,(\cdot)}^i+\alpha_i - 1} \, d\theta_j \\ [8pt] = {} & \frac{\Gamma\left(\sum_{i=1}^K \alpha_i \right)}{\prod_{i=1}^K \Gamma(\alpha_i)}\frac{\prod_{i=1}^K \Gamma(n_{j,(\cdot)}^i+\alpha_i)}{\Gamma\left (\sum_{i=1}^K n_{j,(\cdot)}^i+\alpha_i \right)}. \end{align} }[/math]

Now we turn our attention to the [math]\displaystyle{ \boldsymbol{\varphi} }[/math] part. Actually, the derivation of the [math]\displaystyle{ \boldsymbol{\varphi} }[/math] part is very similar to the [math]\displaystyle{ \boldsymbol{\theta} }[/math] part. Here we only list the steps of the derivation:

[math]\displaystyle{ \begin{align} & \int_{\boldsymbol{\varphi}} \prod_{i=1}^K P(\varphi_i;\beta) \prod_{j=1}^M \prod_{t=1}^N P(W_{j,t}\mid\varphi_{Z_{j,t}}) \, d\boldsymbol{\varphi} \\[8pt] = {} & \prod_{i=1}^K \int_{\varphi_i} P(\varphi_i;\beta) \prod_{j=1}^M \prod_{t=1}^N P(W_{j,t}\mid \varphi_{Z_{j,t}}) \, d\varphi_i\\ [8pt] = {} & \prod_{i=1}^K \int_{\varphi_i} \frac{\Gamma\left(\sum_{r=1}^V \beta_r \right)}{\prod_{r=1}^V \Gamma(\beta_r)} \prod_{r=1}^V \varphi_{i,r}^{\beta_r - 1} \prod_{r=1}^V \varphi_{i,r}^{n_{(\cdot),r}^i} \, d\varphi_i \\ [8pt] = {} & \prod_{i=1}^K \int_{\varphi_i} \frac{\Gamma\left(\sum_{r=1}^V \beta_r \right)}{\prod_{r=1}^V \Gamma(\beta_r)} \prod_{r=1}^V \varphi_{i,r}^{n_{(\cdot),r}^i+\beta_r - 1} \, d\varphi_i \\ [8pt] = {} & \prod_{i=1}^K \frac{\Gamma\left(\sum_{r=1}^V \beta_r \right)}{\prod_{r=1}^V \Gamma(\beta_r)}\frac{\prod_{r=1}^V \Gamma(n_{(\cdot),r}^i+\beta_r)}{\Gamma\left(\sum_{r=1}^V n_{(\cdot),r}^i+\beta_r \right)}. \end{align} }[/math]

For clarity, here we write down the final equation with both [math]\displaystyle{ \boldsymbol{\phi} }[/math] and [math]\displaystyle{ \boldsymbol{\theta} }[/math] integrated out:

[math]\displaystyle{ P(\boldsymbol{Z}, \boldsymbol{W};\alpha,\beta) = \prod_{j=1}^M \frac{\Gamma\left(\sum_{i=1}^K \alpha_i \right )}{\prod_{i=1}^K \Gamma(\alpha_i)}\frac{\prod_{i=1}^K \Gamma(n_{j,(\cdot)}^i+\alpha_i)}{\Gamma\left (\sum_{i=1}^K n_{j,(\cdot)}^i+\alpha_i \right)} \times \prod_{i=1}^K \frac{\Gamma\left (\sum_{r=1}^V \beta_r \right )}{\prod_{r=1}^V \Gamma(\beta_r)}\frac{\prod_{r=1}^V \Gamma(n_{(\cdot),r}^i+\beta_r)}{\Gamma\left (\sum_{r=1}^V n_{(\cdot),r}^i+\beta_r \right)}. }[/math]

The goal of Gibbs Sampling here is to approximate the distribution of [math]\displaystyle{ P(\boldsymbol{Z}\mid\boldsymbol{W};\alpha,\beta) }[/math]. Since [math]\displaystyle{ P(\boldsymbol{W};\alpha,\beta) }[/math] is invariable for any of Z, Gibbs Sampling equations can be derived from [math]\displaystyle{ P(\boldsymbol{Z}, \boldsymbol{W};\alpha,\beta) }[/math] directly. The key point is to derive the following conditional probability:

[math]\displaystyle{ P(Z_{(m,n)}\mid\boldsymbol{Z_{-(m,n)}}, \boldsymbol{W};\alpha,\beta)=\frac{P(Z_{(m,n)}, \boldsymbol{Z_{-(m,n)}},\boldsymbol{W};\alpha,\beta)} {P(\boldsymbol{Z_{-(m,n)}}, \boldsymbol{W};\alpha,\beta)} , }[/math]

where [math]\displaystyle{ Z_{(m,n)} }[/math] denotes the [math]\displaystyle{ Z }[/math] hidden variable of the [math]\displaystyle{ n^{th} }[/math] word token in the [math]\displaystyle{ m^{th} }[/math] document. And further we assume that the word symbol of it is the [math]\displaystyle{ v^{th} }[/math] word in the vocabulary. [math]\displaystyle{ \boldsymbol{Z_{-(m,n)}} }[/math] denotes all the [math]\displaystyle{ Z }[/math]s but [math]\displaystyle{ Z_{(m,n)} }[/math]. Note that Gibbs Sampling needs only to sample a value for [math]\displaystyle{ Z_{(m,n)} }[/math], according to the above probability, we do not need the exact value of

[math]\displaystyle{ P \left (Z_{m,n}\mid\boldsymbol{Z_{-(m,n)}}, \boldsymbol{W};\alpha,\beta \right ) }[/math]

but the ratios among the probabilities that [math]\displaystyle{ Z_{(m,n)} }[/math] can take value. So, the above equation can be simplified as:

[math]\displaystyle{ \begin{align} P (&Z_{(m,n)}=v\mid \boldsymbol{Z_{-(m,n)}}, \boldsymbol{W};\alpha,\beta ) \\ [8pt] &\propto P (Z_{(m,n)}=v,\boldsymbol{Z_{-(m,n)}},\boldsymbol{W};\alpha,\beta ) \\ [8pt] &= \left(\frac{\Gamma\left(\sum_{i=1}^K \alpha_i \right)}{\prod_{i=1}^K \Gamma(\alpha_i)}\right)^M \prod_{j\neq m} \frac{\prod_{i=1}^K \Gamma \left (n_{j,(\cdot)}^i+\alpha_i \right )}{\Gamma\left (\sum_{i=1}^K n_{j,(\cdot)}^i+\alpha_i \right)} \left( \frac{\Gamma\left (\sum_{r=1}^V \beta_r \right)}{\prod_{r=1}^V \Gamma(\beta_r)}\right)^K \prod_{i=1}^K \prod_{r\neq v} \Gamma \left (n_{(\cdot),r}^i+\beta_r \right )\frac{\prod_{i=1}^K \Gamma \left (n_{m,(\cdot)}^i+\alpha_i \right )}{\Gamma\left (\sum_{i=1}^K n_{m,(\cdot)}^i+\alpha_i \right )} \prod_{i=1}^K \frac{ \Gamma \left (n_{(\cdot),v}^i+\beta_v \right )} {\Gamma \left (\sum_{r=1}^V n_{(\cdot),r}^i+\beta_r \right )} \\ [8pt] &\propto \frac{\prod_{i=1}^K \Gamma \left (n_{m,(\cdot)}^i+\alpha_i \right )}{\Gamma\left (\sum_{i=1}^K n_{m,(\cdot)}^i+\alpha_i \right)} \prod_{i=1}^K \frac{ \Gamma \left (n_{(\cdot),v}^i+\beta_v \right )}{\Gamma\left (\sum_{r=1}^V n_{(\cdot),r}^i+\beta_r \right )}\\ [8pt] &\propto \prod_{i=1}^K \Gamma \left (n_{m,(\cdot)}^i+\alpha_i \right ) \prod_{i=1}^K \frac{\Gamma \left (n_{(\cdot),v}^i+\beta_v \right )}{\Gamma\left (\sum_{r=1}^V n_{(\cdot),r}^i+\beta_r \right )}. \end{align} }[/math]

Finally, let [math]\displaystyle{ n_{j,r}^{i,-(m,n)} }[/math] be the same meaning as [math]\displaystyle{ n_{j,r}^i }[/math] but with the [math]\displaystyle{ Z_{(m,n)} }[/math] excluded. The above equation can be further simplified leveraging the property of gamma function. We first split the summation and then merge it back to obtain a [math]\displaystyle{ k }[/math]-independent summation, which could be dropped:

[math]\displaystyle{ \begin{align} &\propto \prod_{i\neq k} \Gamma \left (n_{m,(\cdot)}^{i,-(m,n)}+\alpha_i \right ) \prod_{i\neq k} \frac{ \Gamma \left (n_{(\cdot),v}^{i,-(m,n)}+\beta_v \right )}{\Gamma\left (\sum_{r=1}^V n_{(\cdot),r}^{i,-(m,n)}+\beta_r \right )} \Gamma \left (n_{m,(\cdot)}^{k,-(m,n)}+\alpha_k + 1 \right ) \frac{\Gamma \left (n_{(\cdot),v}^{k,-(m,n)}+\beta_v + 1 \right )}{\Gamma\left(\sum_{r=1}^V n_{(\cdot),r}^{k,-(m,n)} + \beta_r +1 \right)} \\ [8pt] &= \prod_{i\neq k} \Gamma \left (n_{m,(\cdot)}^{i,-(m,n)}+\alpha_i \right ) \prod_{i\neq k} \frac{\Gamma \left (n_{(\cdot),v}^{i,-(m,n)}+\beta_v \right )}{\Gamma\left (\sum_{r=1}^V n_{(\cdot),r}^{i,-(m,n)} + \beta_r \right )} \Gamma \left (n_{m,(\cdot)}^{k,-(m,n)}+\alpha_k \right ) \frac{\Gamma \left (n_{(\cdot),v}^{k,-(m,n)}+\beta_v \right )} {\Gamma\left (\sum_{r=1}^V n_{(\cdot),r}^{k,-(m,n)}+\beta_r \right )} \left (n_{m,(\cdot)}^{k,-(m,n)}+\alpha_k \right ) \frac{n_{(\cdot),v}^{k,-(m,n)}+\beta_v } {\sum_{r=1}^V n_{(\cdot),r}^{k,-(m,n)}+\beta_r} \\ [8pt] &= \prod_{i} \Gamma \left (n_{m,(\cdot)}^{i,-(m,n)}+\alpha_i \right ) \prod_{i} \frac{ \Gamma \left (n_{(\cdot),v}^{i,-(m,n)}+\beta_v \right )}{\Gamma\left (\sum_{r=1}^V n_{(\cdot),r}^{i,-(m,n)}+\beta_r \right )} \left (n_{m,(\cdot)}^{k,-(m,n)}+\alpha_k \right ) \frac{n_{(\cdot),v}^{k,-(m,n)}+\beta_v } {\sum_{r=1}^V n_{(\cdot),r}^{k,-(m,n)}+\beta_r} \\ [8pt] &\propto \left (n_{m,(\cdot)}^{k,-(m,n)}+\alpha_k \right ) \frac{n_{(\cdot),v}^{k,-(m,n)}+\beta_v } {\sum_{r=1}^V n_{(\cdot),r}^{k,-(m,n)}+\beta_r} \end{align} }[/math]

Note that the same formula is derived in the article on the Dirichlet-multinomial distribution, as part of a more general discussion of integrating Dirichlet distribution priors out of a Bayesian network.

Related problems

Related models

Topic modeling is a classic solution to the problem of information retrieval using linked data and semantic web technology. Related models and techniques are, among others, latent semantic indexing, independent component analysis, probabilistic latent semantic indexing, non-negative matrix factorization, and Gamma-Poisson distribution.

The LDA model is highly modular and can therefore be easily extended. The main field of interest is modeling relations between topics. This is achieved by using another distribution on the simplex instead of the Dirichlet. The Correlated Topic Model follows this approach, inducing a correlation structure between topics by using the logistic normal distribution instead of the Dirichlet. Another extension is the hierarchical LDA (hLDA), where topics are joined together in a hierarchy by using the nested Chinese restaurant process, whose structure is learnt from data. LDA can also be extended to a corpus in which a document includes two types of information (e.g., words and names), as in the LDA-dual model. Nonparametric extensions of LDA include the hierarchical Dirichlet process mixture model, which allows the number of topics to be unbounded and learnt from data.

As noted earlier, pLSA is similar to LDA. The LDA model is essentially the Bayesian version of pLSA model. The Bayesian formulation tends to perform better on small datasets because Bayesian methods can avoid overfitting the data. For very large datasets, the results of the two models tend to converge. One difference is that pLSA uses a variable [math]\displaystyle{ d }[/math] to represent a document in the training set. So in pLSA, when presented with a document the model has not seen before, we fix [math]\displaystyle{ \Pr(w \mid z) }[/math]—the probability of words under topics—to be that learned from the training set and use the same EM algorithm to infer [math]\displaystyle{ \Pr(z \mid d) }[/math]—the topic distribution under [math]\displaystyle{ d }[/math]. Blei argues that this step is cheating because you are essentially refitting the model to the new data.

Spatial models

In evolutionary biology, it is often natural to assume that the geographic locations of the individuals observed bring some information about their ancestry. This is the rational of various models for geo-referenced genetic data.

Variations on LDA have been used to automatically put natural images into categories, such as "bedroom" or "forest", by treating an image as a document, and small patches of the image as words; one of the variations is called spatial latent Dirichlet allocation.

See also

• Variational Bayesian methods
• Pachinko allocation
• tf-idf
• Infer.NET

External links

• jLDADMM A Java package for topic modeling on normal or short texts. jLDADMM includes implementations of the LDA topic model and the one-topic-per-document Dirichlet Multinomial Mixture model. jLDADMM also provides an implementation for document clustering evaluation to compare topic models.
• STTM A Java package for short text topic modeling (https://github.com/qiang2100/STTM). STTM includes these following algorithms: Dirichlet Multinomial Mixture (DMM) in conference KDD2014, Biterm Topic Model (BTM) in journal TKDE2016, Word Network Topic Model (WNTM) in journal KAIS2018, Pseudo-Document-Based Topic Model (PTM) in conference KDD2016, Self-Aggregation-Based Topic Model (SATM) in conference IJCAI2015, (ETM) in conference PAKDD2017, Generalized P´olya Urn (GPU) based Dirichlet Multinomial Mixturemodel (GPU-DMM) in conference SIGIR2016, Generalized P´olya Urn (GPU) based Poisson-based Dirichlet Multinomial Mixturemodel (GPU-PDMM) in journal TIS2017 and Latent Feature Model with DMM (LF-DMM) in journal TACL2015. STTM also includes six short text corpus for evaluation. STTM presents three aspects about how to evaluate the performance of the algorithms (i.e., topic coherence, clustering, and classification).
• Lecture that covers some of the notation in this article: LDA and Topic Modelling Video Lecture by David Blei or same lecture on YouTube
• D. Mimno's LDA Bibliography An exhaustive list of LDA-related resources (incl. papers and some implementations)
• Gensim, a Python+NumPy implementation of online LDA for inputs larger than the available RAM.
• topicmodels and lda are two R packages for LDA analysis.
• MALLET Open source Java-based package from the University of Massachusetts-Amherst for topic modeling with LDA, also has an independently developed GUI, the Topic Modeling Tool
• LDA in Mahout implementation of LDA using MapReduce on the Hadoop platform
• Latent Dirichlet Allocation (LDA) Tutorial for the Infer.NET Machine Computing Framework Microsoft Research C# Machine Learning Framework
• LDA in Spark: Since version 1.3.0, Apache Spark also features an implementation of LDA
• LDA, exampleLDA MATLAB implementation