View source for Chinese restaurant process

{{Short description|Discrete-time stochastic process}}
{{other uses|Chinese restaurant (disambiguation)}}
In [[probability theory]], the '''Chinese restaurant process''' is a [[discrete-time]] [[stochastic process]], analogous to seating customers at tables in a restaurant.
Imagine a restaurant with an infinite number of circular tables, each with infinite capacity. Customer 1 sits at the first table. The next customer either sits at the same table as customer 1, or the next table. This continues, with each customer choosing to either sit at an occupied table with a probability proportional to the number of customers already there (i.e., they are more likely to sit at a table with many customers than few), or an unoccupied table. At time ''n'', the ''n'' customers have been [[partition of a set|partitioned]] among ''m''&nbsp;&le;&nbsp;''n'' tables (or blocks of the partition). The results of this process are [[Exchangeable random variables|exchangeable]], meaning the order in which the customers sit does not affect the probability of the final [[probability distribution|distribution]]. This property greatly simplifies a number of problems in [[population genetics]], [[linguistic analysis]], and [[image recognition]].

The restaurant analogy first appeared in a 1985 write-up by [[David Aldous]],<ref>{{Cite book | last1 = Aldous | first1 = D. J. | chapter = Exchangeability and related topics | doi = 10.1007/BFb0099421 | title = École d'Été de Probabilités de Saint-Flour XIII — 1983 | series = Lecture Notes in Mathematics | volume = 1117 | pages = 1–198 | year = 1985 | isbn = 978-3-540-15203-3 }}  The restaurant process is described on page 92.</ref> where it was attributed to [[Jim Pitman]] (who additionally credits [[Lester Dubins]]).<ref name=Pitman1995/>

An equivalent partition process was published a year earlier by [[Fred Hoppe]],<ref>{{Cite journal | title=Pólya-like urns and the Ewens' sampling formula| last1=Hoppe| first1=Fred M.| journal=Journal of Mathematical Biology| year=1984| volume=20| pages=91-94}}</ref> using an "urn scheme" akin to [[Pólya's urn]]. In comparison with Hoppe's urn model, the Chinese restaurant process has the advantage that it naturally lends itself to describing random permutations via their cycle structure, in addition to describing random partitions.

== Formal definition ==
For any positive integer <math>n</math>, let <math>\mathcal{P}_{n}</math> denote the set of all partitions of the set <math>\{ 1, 2, 3,..., n \} \triangleq [n]</math>. The Chinese restaurant process takes values in the infinite Cartesian product <math>\prod_{n \geq 1} \mathcal{P}_{n}</math>.

The value of the process at time <math>n</math> is a partition <math>B_n</math> of the set <math>[n]</math>, whose probability distribution is determined as follows.  At time <math>n=1</math>, the trivial partition <math>B_1 = \{ \{ 1 \} \}</math> is obtained (with probability one). At time <math>n+1</math> the element "<math>n+1</math>" is either:
# added to one of the blocks of the partition <math>B_n</math>, where each block is chosen with probability <math>|b|/(n+1)</math> where <math>|b|</math> is the size of the block (i.e. number of elements), or 
# added to the partition <math>B_n</math> as a new singleton block, with probability <math>1/(n+1)</math>.
The random partition so generated has some special properties. It is ''exchangeable'' in the sense that relabeling <math>\{ 1,..., n \}</math> does not change the distribution of the partition, and it is ''consistent'' in the sense that the law of the partition of <math>[n-1]</math> obtained by removing the element <math>n</math> from the random partition <math>B_n</math> is the same as the law of the random partition <math>B_{n-1}</math>.

The probability assigned to any particular partition (ignoring the order in which customers sit around any particular table) is

: <math>
\Pr(B_n = B) = \frac{\prod_{b\in B} (|b| -1)!}{n!}, \qquad B \in \mathcal{P}_{n}
</math>

where <math>b</math> is a block in the partition <math>B</math> and <math>|b|</math> is the size of <math>b</math>.

The definition can be generalized by introducing a parameter <math>\theta>0</math> which modifies the probability of the new customer sitting at a new table to <math>\frac{\theta}{n+\theta}</math> and correspondingly modifies the probability of them sitting at a table of size <math>|b|</math> to <math>\frac{|b|}{n+\theta}</math>. The vanilla process introduced above can be recovered by setting <math>\theta=1</math>. Intuitively, <math>\theta</math> can be interpreted as the effective number of customers sitting at the first empty table.

=== Alternative definition ===
An equivalent, but subtly different way to define the Chinese restaurant process, is to let new customers choose companions rather than tables.<ref name="Blei2011">{{cite journal |last1=Blei |first1=David M. |last2=Frazier |first2=Peter I. |title=Distance Dependent Chinese Restaurant Processes |journal=Journal of Machine Learning Research |date=2011 |volume=12 |pages=2461–2488 |url=https://www.jmlr.org/papers/volume12/blei11a/blei11a.pdf}}</ref> Customer <math>n+1</math> chooses to sit at the same table as any one of the <math>n</math> seated customers with probability <math>\frac{1}{n+\theta}</math>, or chooses to sit at a new, unoccupied table with probability <math>\frac{\theta}{n+\theta}</math>. Notice that in this formulation, the customer chooses a table without having to count table occupancies---we don't need <math>|b|</math>.

==Distribution of the number of tables==
{{Probability distribution|
  name       =Chinese restaurant table|
  type       =mass|
  parameters =<math>\theta > 0</math><br />
  <math>n \in \{1,2,\ldots \}</math>|
  support    =<math>k \in \{1,2,\ldots,n\}</math>|
  pdf        =<math>\frac{\Gamma(\theta)}{\Gamma(n+\theta)} |s(n,k)| \theta^{k} </math>|
  mean       =<math>\theta (\psi(\theta+n)-\psi(\theta))</math><br />(see [[digamma function]])|
}}
The '''Chinese restaurant table distribution''' ('''CRT''') is the [[probability distribution]] on the number of tables in the Chinese restaurant process.<ref>{{Cite journal | title=Negative Binomial Process Count and Mixture Modeling| arxiv=1209.3442| last1=Zhou| first1=Mingyuan| last2=Carin| first2=Lawrence| journal=IEEE Transactions on Pattern Analysis and Machine Intelligence| year=2012| volume=37| issue=2| pages=307–20| doi=10.1109/TPAMI.2013.211| pmid=26353243| bibcode=2012arXiv1209.3442Z| s2cid=1937045}}</ref> It can be understood as the sum of <math>n</math> independent [[Bernoulli distribution|Bernoulli]] random variables, each with a different parameter:

:<math>
\begin{align}
K & = \sum_{i=1}^n b_i \\[4pt]
b_i & \sim \operatorname{Bernoulli} \left( \frac \theta {i-1+\theta}\right)
\end{align}
</math>

The probability mass function of <math>K</math> is given by <ref>{{cite journal | last1 = Antoniak | first1 = Charles E | year = 1974| title = Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems | journal = The Annals of Statistics| volume = 2 | issue = 6 | pages = 1152–1174 | doi = 10.1214/aos/1176342871 | doi-access = free }}</ref>

:<math>
f(k) = \frac{\Gamma(\theta)}{\Gamma(n+\theta)} |s(n,k)| \theta^k, \quad k=1,\dots,n,
</math>

where <math>s</math> denotes [[Stirling numbers of the first kind]].

== Two-parameter generalization ==
This construction can be generalized to a model with two parameters, <math>\theta</math> & <math>\alpha</math>,<ref name=Pitman1995>{{cite journal
 |first=Jim |last=Pitman
 |title=Exchangeable and Partially Exchangeable Random Partitions
 |journal=Probability Theory and Related Fields 
 |volume=102 |issue=2 |pages=145&ndash;158 
 |year=1995
 |mr=1337249 |doi=10.1007/BF01213386
|s2cid=16849229
 |doi-access=free}}</ref><ref name=Pitman2006>{{cite book|last=Pitman|first=Jim|title=Combinatorial Stochastic Processes|volume=1875|url=http://works.bepress.com/jim_pitman/1/|publisher=Springer-Verlag|year=2006|location=Berlin|isbn=9783540309901|access-date=2011-05-11|archive-date=2012-09-25|archive-url=https://web.archive.org/web/20120925082105/http://works.bepress.com/jim_pitman/1/|url-status=dead}}</ref> commonly called the ''strength'' (or ''concentration'') and ''discount'' parameters respectively.  At time <math>n+1</math>, the next customer to arrive finds <math>|B|</math> occupied tables and decides to sit at an empty table with probability

: <math>
\frac{\theta + |B| \alpha}{n + \theta},
</math>

or at an occupied table <math>b</math> of size <math>|b|</math> with probability

: <math>
\frac{|b| -  \alpha}{n + \theta}.
</math>

In order for the construction to define a valid [[probability measure]] it is necessary to suppose that either <math>\alpha<0</math> and <math>\theta = -L\alpha</math> for some <math>L \in \{1,2,,...\}</math>; or that <math>0\leq\alpha<1</math> and <math>\theta>-\alpha</math>.

Under this model the probability assigned to any particular partition <math>B</math> of <math>[n]</math>, can be expressed in the general case (for any values of <math>\theta,\alpha</math> that satisfy the above-mentioned constraints) in terms of the [[Pochhammer k-symbol]], as

:<math>
\Pr(B_n = B \mid \theta,\alpha) = 
    \frac{(\theta + \alpha)_{|B|-1, \alpha}}{(\theta+1)_{n-1, 1}} 
    \prod_{b\in B}(1-\alpha)_{|b|-1, 1}
</math>

where, the Pochhammer k-symbol is defined as follows: by convention, <math>(a)_{0,k} = 1</math>, and for <math>m > 0</math>

:<math>
(a)_{m,k} = \prod_{i=0}^{m-1}(a+ik) = 
\begin{cases}
a^m & \text{if }k = 0, \\ \\
k^m\,(\frac{a}{k})^{\overline m} & \text{if }k>0, \\ \\
\left|k\right|^m\,(\frac{a}{\left|k\right|})^{\underline m} & \text{if }k<0 
\end{cases}
</math>

where <math>x^{\overline m}=\prod_{i=0}^{m-1}(x+i)</math> is the [[rising factorial]] and <math>x^{\underline m}=\prod_{i=0}^{m-1}(x-i)</math> is the [[falling factorial]]. It is worth noting that for the parameter setting where <math>\alpha<0</math> and <math>\theta = -L\alpha</math>, then <math>(\theta + \alpha)_{|B|-1, \alpha}=(|\alpha|(L-1))_{|B|-1, \alpha}</math>, which evaluates to zero whenever <math>|B|>L</math>, so that <math>L</math> is an upper bound on the number of blocks in the partition; see the subsection on the [[Chinese_restaurant_process#The_Dirichlet-categorical_model|Dirichlet-categorical model]] below for more details.

For the case when <math>\theta > 0</math> and <math>0<\alpha<1</math>, the partition probability can be rewritten in terms of the [[Gamma function]] as

:<math>
\Pr(B_n = B\mid \theta,\alpha) =\frac{\Gamma(\theta)}{\Gamma(\theta+n)}\dfrac{\alpha^{|B|}\,\Gamma(\theta/\alpha + |B|) }{\Gamma(\theta/\alpha)}\prod_{b\in B}\dfrac{\Gamma(|b|-\alpha)}{\Gamma(1-\alpha)}.
</math>

In the one-parameter case, where <math>\alpha</math> is zero, and <math>\theta>0</math> this simplifies to

:<math>
\Pr(B_n = B\mid\theta) = \frac{\Gamma(\theta)\,\theta^{|B|}}{\Gamma(\theta+n)}\prod_{b\in B} \Gamma(|b|).
</math>

Or, when <math>\theta</math> is zero, and <math>0<\alpha<1</math>

:<math>
\Pr(B_n = B\mid\alpha) =\frac{\alpha^{|B|-1}\,\Gamma(|B|) }{{\Gamma(n)}}\prod_{b\in B} \frac{\Gamma(|b|-\alpha)}{\Gamma(1-\alpha)}.
</math>

As before, the probability assigned to any particular partition depends only on the block sizes, so as before the random partition is exchangeable in the sense described above.  The consistency property still holds, as before, by construction.

If <math>\alpha=0</math>, the probability distribution of the random [[partition of an integer|partition of the integer]] <math>n</math> thus generated is the [[Ewens distribution]] with parameter <math>\theta</math>, used in [[population genetics]] and the [[unified neutral theory of biodiversity]].

[[File:Chinese Restaurant Process for DP(0.5,H).webm|thumb|800px|end=26|center|Animation of a Chinese restaurant process with scaling parameter <math>\theta=0.5,\ \alpha = 0</math>. Tables are hidden once the customers of a table can not be displayed anymore; however, every table has infinitely many seats. (Recording of an interactive animation.<ref>{{Cite web | url=http://topicmodels.west.uni-koblenz.de/ckling/tmt/crp.html?parameters=0.5&dp=1# | title=Dirichlet Process and Dirichlet Distribution -- Polya Restaurant Scheme and Chinese Restaurant Process}}</ref>)]]

=== Derivation ===

Here is one way to derive this partition probability.  Let <math>C_i</math> be the random block into which the number <math>i</math> is added, for <math>i =1,2,3,...</math>.  Then

:<math>
\Pr(C_i = c\mid C_1,\ldots,C_{i-1})
 = \begin{cases}
\dfrac{\theta + |B| \alpha }{\theta + i -1} & \text{if }c \in \text{new block}, \\  \\
\dfrac{|b| - \alpha }{\theta + i - 1} & \text{if }c\in b;
\end{cases}
</math>
<!-- where ''δ'' is the indicator function, i.e. ''δ''(''A'')&nbsp;=&nbsp;1&nbsp;or&nbsp;0 according as the event ''A'' occurs or fails. -->

The probability that <math>B_n</math> is any particular partition of the set <math>\{ 1,...,n \}</math> is the product of these probabilities as <math>i</math> runs from <math>1</math> to <math>n</math>.  Now consider the size of block <math>b</math>: it increases by one each time we add one element into it. When the last element in block <math>b</math> is to be added in, the block size is <math>|b|-1</math>. For example, consider this sequence of choices: (generate a new block <math>b</math>)(join <math>b</math>)(join <math>b</math>)(join <math>b</math>). In the end, block <math>b</math> has 4 elements and the product of the numerators in the above equation gets <math>\theta\cdot 1\cdot 2\cdot 3</math>.  Following this logic, we obtain <math>\Pr(B_n = B)</math> as above.

=== Expected number of tables ===
For the one parameter case, with <math>\alpha=0</math> and <math>0<\theta<\infty</math>, the number of tables is distributed according to the [[chinese restaurant table distribution]]. The expected value of this random variable, given that there are <math>n</math> seated customers, is<ref>Xinhua Zhang,  "A Very Gentle Note on the Construction of Dirichlet Process", September 2008, The Australian National University, Canberra. Online: http://users.cecs.anu.edu.au/~xzhang/pubDoc/notes/dirichlet_process.pdf  {{webarchive |url=https://web.archive.org/web/20110411124712/http://users.cecs.anu.edu.au/~xzhang/pubDoc/notes/dirichlet_process.pdf |date=April 11, 2011 }}</ref>

:<math>
\begin{align}
\sum_{k=1}^n \frac \theta {\theta+k-1} = \theta \cdot (\Psi(\theta+n) -  \Psi(\theta))
\end{align}
</math>

where <math>\Psi(\theta)</math> is the [[digamma function]]. For the two-parameter case, for <math>\alpha\ne0</math>, the expected number of occupied tables is<ref name=Pitman2006/>

:<math>
\begin{align}
\frac{(\theta+\alpha)^{\overline n}}{\alpha (\theta+1)^{\overline{n-1}}} - \frac \theta \alpha,
\end{align}
</math>
where <math>x^{\overline m}</math> is the rising factorial (as defined above).

=== The Dirichlet-categorical model ===
For the parameter choice <math>\alpha<0</math> and <math>\theta=-L\alpha</math>, where <math>L\in\{1,2,3,\ldots\}</math>, the two-parameter Chinese restaurant process is equivalent to the '''Dirichlet-categorical model''', which is a hierarchical model that can be defined as follows. Notice that for this parameter setting, the probability of occupying a new table, when there are already <math>L</math> occupied tables, is zero; so that the number of occupied tables is upper bounded by <math>L</math>. If we choose to identify tables with ''labels'' that take values in <math>\{1,2,\ldots,L\}</math>, then to generate a random partition of the set <math>[n]=\{1,2,\ldots,n\}</math>, the hierarchical model first draws a [[categorical distribution|categorical label distribution]], <math>\mathbf p=(p_1,p_2,\ldots,p_L)</math> from the symmetric [[Dirichlet distribution]], with concentration parameter <math>\gamma=-\alpha>0</math>. Then, independently for each of the <math>n</math> customers, the table label is drawn from the categorical <math>\mathbf p</math>. Since the Dirichlet distribution is [[conjugate prior|conjugate]] to the categorical, the hidden variable <math>\mathbf p</math> can be marginalized out to obtain the [[posterior predictive distribution]] for the next label state, <math>\ell_{n+1}</math>, given <math>n</math> previous labels
:<math>
P(\ell_{n+1}=i\mid \ell_1,\ldots,\ell_n) = \frac{\gamma+ \left| {b_i} \right| }{L\gamma+n}
</math>
where <math>\left|{b_i}\right|\ge0</math> is the number of customers that are already seated at table <math>i</math>. With <math>\alpha=-\gamma</math> and <math>\theta=L\gamma</math>, this agrees with the above general formula, <math>\frac{|b_i| -  \alpha}{n + \theta}</math>, for the probability of sitting at an occupied table when <math>|b_i|\ge1</math>. The probability for sitting at any of the <math>L-|B|</math> unoccupied tables, also agrees with the general formula and is given by

:<math>
\sum_{i: |b_i| = 0} P(\ell_{n+1}=i\mid \ell_1,\ldots,\ell_n) 
= \frac{(L-|B|)\gamma}{n + L\gamma}
= \frac{\theta + |B| \alpha}{n + \theta}
</math>

The marginal probability for the labels is given by

:<math>
P(\ell_1,\ldots,\ell_n) = P(\ell_1)\prod_{t=1}^{n-1} P(\ell_{t+1}\mid\ell_1,\ldots,\ell_t) =
\frac{\prod_{i=1}^L\gamma^{\overline{\left|{b_i}\right|} }}{(L\gamma)^{\overline n}}
</math>
where <math>P(\ell_1)=\frac1L</math> and <math>x^{\overline m}=\prod_{i=0}^{m-1}(x+i)</math> is the [[rising factorial]]. In general, there are however multiple label states that all correspond to the ''same'' partition. For a given partition, <math>B</math>, which has <math>\left|B\right|\le L</math> blocks, the number of label states that all correspond to this partition is given by the [[falling factorial]], <math>L^{\underline{\left|B\right|} }=\prod_{i=0}^{\left|B\right|-1}(L-i)</math>. Taking this into account, the probability for the partition is

:<math>
\text{Pr}(B_n=B\mid\gamma,L) 
=
L^{\underline{\left|B\right|}}\,\frac{\prod_{i=1}^L\gamma^{\overline{\left|{b_i}\right|} }}{(L\gamma)^{\overline n}}
</math>

which can be verified to agree with the general version of the partition probability that is given above in terms of the Pochhammer k-symbol. Notice again, that if <math>B</math> is outside of the support, i.e. <math>|B|>L</math>, the falling factorial, <math>L^{\underline{|B|}}</math> evaluates to zero as it should. (Practical implementations that evaluate the log probability for partitions via  <math>\log L^{\underline{|B|}}=\log\left|\Gamma(L+1)\right|-\log\left|\Gamma(L+1-|B|)\right|</math> will return <math>-\infty</math>, whenever <math>|B|>L</math>, as required.)  

==== Relationship between Dirichlet-categorical and one-parameter CRP ====
Consider on the one hand, the one-parameter Chinese restaurant process, with <math>\alpha=0</math> and <math>\theta>0</math>, which we denote <math>\text{CRP}(\alpha=0,\theta)</math>; and on the other hand the Dirichlet-categorical model with <math>L</math> a positive integer and where we choose <math>\gamma=\frac{\theta}{L}</math>, which as shown above, is equivalent to <math>\text{CRP}(\alpha=-\frac{\theta}{L},\theta)</math>. This shows that the Dirichlet-categorical model can be made arbitrarily close to <math>\text{CRP}(0,\theta)</math>, by making <math>L</math> large.

=== Stick-breaking process===
The two-parameter Chinese restaurant process can equivalently be defined in terms of a [[stick-breaking process]].<ref>{{Cite journal |last=Ishwaran |first=Hemant |last2=James |first2=Lancelot F. |date=2001 |title=Gibbs Sampling Methods for Stick-Breaking Priors |url=https://www.jstor.org/stable/2670356 |journal=Journal of the American Statistical Association |volume=96 |issue=453 |pages=161–173 |issn=0162-1459}}</ref> For the case where <math>0\le\alpha<1</math> and <math>\theta>-\alpha</math>, the stick breaking process can be described as a hierarchical model, much like the above [[Chinese_restaurant_process#The_Dirichlet-categorical_model|Dirichlet-categorical model]], except that there is an infinite number of label states. The table labels are drawn independently from the infinite categorical distribution <math>\mathbf p=(p_1,p_2,\ldots)</math>, the components of which are sampled using ''stick breaking'': start with a stick of length 1 and randomly break it in two, the length of the left half is <math>p_1</math> and the right half is broken again recursively to give <math>p_2,p_3,\ldots</math>. More precisely, the left fraction, <math>f_k</math>, of the <math>k</math>-th break is sampled from the [[beta distribution]]: 
:<math>
f_k\sim B(1-\alpha,\theta+k\alpha),\; \text{for }k\ge1\text{ and }0\le\alpha<1
</math>

The categorical probabilities are:

:<math>
p_k=f_k\prod_{i=1}^{k-1}(1-f_k),\;\text{where the empty product evaluates to one.}
</math>

For the parameter settings <math>\alpha<0</math> and <math>\theta=-\alpha L</math>, where <math>L</math> is a positive integer, and where the categorical is finite: <math>\mathbf p=(p_1,\ldots, p_L)</math>, we can sample <math>\mathbf p</math> from an ordinary Dirchlet distribution as explained [[Chinese_restaurant_process#The_Dirichlet-categorical_model|above]], but it can also be sampled with a ''truncated'' stick-breaking recipe, where the formula for sampling the fractions is modified to:

:<math>
f_k \sim B(-\alpha, \theta+k\alpha),\;\text{for }1\le k\le L-1\text{ and }\alpha<0
</math>
and <math>f_L=1</math>.

==The Indian buffet process==
It is possible to adapt the model such that each data point is no longer uniquely associated with a class (i.e., we are no longer constructing a partition), but may be associated with any combination of the classes. This strains the restaurant-tables analogy and so is instead likened to a process in which a series of diners samples from some subset of an infinite selection of dishes on offer at a buffet. The probability that a particular diner samples a particular dish is proportional to the popularity of the dish among diners so far, and in addition the diner may sample from the untested dishes. This has been named the [[Indian buffet process]]
and can be used to infer latent features in data.<ref name="ibpreport">Griffiths, T.L. and [[Zoubin Ghahramani|Ghahramani, Z.]] (2005) [http://learning.eng.cam.ac.uk/zoubin/papers/ibptr.pdf Infinite Latent Feature Models and the Indian Buffet Process] {{Webarchive|url=https://web.archive.org/web/20081031153937/http://learning.eng.cam.ac.uk/zoubin/papers/ibptr.pdf |date=2008-10-31 }}. Gatsby Unit Technical Report GCNU-TR-2005-001.</ref>

== Applications ==
The Chinese restaurant process is closely connected to [[Dirichlet process]]es and [[Pólya urn model|Pólya's urn scheme]], and therefore useful in applications of [[Bayesian statistics]] including [[nonparametric]] [[Bayesian methods]]. The Generalized Chinese Restaurant Process is closely related to [[Pitman–Yor process]]. These processes have been used in many applications, including modeling text, clustering biological [[DNA microarray|microarray]] data,<ref>{{cite journal | last1 = Qin | first1 = Zhaohui S | year = 2006 | title = Clustering microarray gene expression data using weighted Chinese restaurant process | journal = Bioinformatics | volume = 22 | issue = 16| pages = 1988–1997 | doi=10.1093/bioinformatics/btl284| pmid = 16766561 | doi-access =  }}</ref> [[unified neutral theory of biodiversity|biodiversity modelling]], and image reconstruction <ref>{{cite journal | last1 = White | first1 = J. T. | last2 = Ghosal | first2 = S. | year = 2011 | title = Bayesian smoothing of photon-limited images with applications in astronomy | url = http://www4.stat.ncsu.edu/%7Eghoshal/papers/Denoising%20Method.pdf | journal = Journal of the Royal Statistical Society, Series B (Statistical Methodology) | volume = 73 | issue = 4| pages = 579–599 | doi=10.1111/j.1467-9868.2011.00776.x| citeseerx = 10.1.1.308.7922 | s2cid = 2342134 }}</ref><ref>{{cite journal | last1 = Li | first1 = M. | last2 = Ghosal | first2 = S. | year = 2014 | title = Bayesian multiscale smoothing of Gaussian noised images | url = http://projecteuclid.org/download/pdfview_1/euclid.ba/1409921112 | journal = Bayesian Analysis | volume = 9 | issue = 3| pages = 733–758 | doi=10.1214/14-ba871| doi-access = free }}</ref>

== See also ==
*[[Ewens sampling formula]]
*[[Preferential attachment]]
*[[Hilbert's paradox of the Grand Hotel]]

==References==
<references />

==External links==
*[https://web.archive.org/web/20190327085650/https://pdfs.semanticscholar.org/775e/5727f5df0cb9bf834af2ea2548a696c27a38.pdf Introduction to the Dirichlet Distribution and Related Processes by Frigyik, Kapila and Gupta]
* A talk by [[Michael I. Jordan]] on the CRP:
** http://videolectures.net/icml05_jordan_dpcrp/

{{Stochastic processes}}

{{DEFAULTSORT:Chinese Restaurant Process}}
[[Category:Stochastic processes]]
[[Category:Nonparametric Bayesian statistics]]