"Dehumanizing the restaurant process never felt so fun," says Garrett Snyder.
There are a few analogies for the DP that have been well circulated in the statistics literature, the Chinese restaurant process (CRP) and the stick breaking process (SBP).
In particular, the Chinese restaurant game (CRG), initially inspired by the Chinese restaurant process, is a promising tool to address the negative externality issue in the relay selection, where each player makes decision sequentially based on the received signals reflecting the state of the tables in a Chinese restaurant and avoids choosing a crowded table [6].
The core of TBC method is inspired by a Chinese restaurant process (also known as Dirichlet process), a discrete-time stochastic process [19], [20], [21].
Usually, in real-world problems, the Chinese restaurant process is used as a prior and a Gibbs' sampler is employed [12], [13].
The TBC is an incremental partition algorithm, inspired by the stochastic Chinese restaurant process, and takes advantage of resampling techniques and models of sequence evolution.
The TBC is inspired by a stochastic Chinese restaurant process and takes advantage of resampling techniques and models of sequence evolution.
The TBC is an incremental algorithm [11], and it is remarkably linked with the Chinese restaurant process, previously employed both for the clustering of microarray gene expression data [12] and for haplotype identification in ultra-deep sequencing [13].
However, another approach that uses the Chinese restaurant process as a prior to infer clusters via Gibbs' sampling has been recently proposed, and performs both clustering and error correction at the same time [13].
The grouping property of the Dirichlet process can be best described using the Chinese restaurant process.
