An elementary derivation of the Chinese restaurant process from Sethuraman's stick-breaking process
The Chinese restaurant process (CRP) and the stick-breaking process are the two most commonly used representations of the Dirichlet process. However, the usual proof of the connection between them is indirect, relying on abstract properties of the Dirichlet process that are difficult for nonexperts to verify. This short note provides a direct proof that the stick-breaking process leads to the CRP, without using any measure theory. We also discuss how the stick-breaking representation arises naturally from the CRP.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Chinese Restaurant Process for cognate clustering: A threshold free approach
In this paper, we introduce a threshold free approach, motivated from Chinese Restaurant Process, for the purpose of cognate clustering. We show that our approach yields similar results to a linguistically motivated cogn…
ClusteringReducing over-clustering via the powered Chinese restaurant process
Dirichlet process mixture (DPM) models tend to produce many small clusters regardless of whether they are needed to accurately characterize the data - this is particularly true for large data sets. However, interpretabil…
ClusteringPOS induction with distributional and morphological information using a distance-dependent Chinese restaurant process
Temporally-Reweighted Chinese Restaurant Process Mixtures for Clustering, Imputing, and Forecasting Multivariate Time Series
This article proposes a Bayesian nonparametric method for forecasting, imputation, and clustering in sparsely observed, multivariate time series data. The method is appropriate for jointly modeling hundreds of time serie…
ClusteringImputationTime SeriesTime Series AnalysisSimilarity Dependent Chinese Restaurant Process for Cognate Identification in Multilingual Wordlists
We present and evaluate two similarity dependent Chinese Restaurant Process (sd-CRP) algorithms at the task of automated cognate detection. The sd-CRP clustering algorithms do not require any predefined threshold for det…
ClusteringLanguage Identification