CRPClustering: Bayesian Nonparametric Chinese Restaurant Process Clustering with Entropy

Chinese restaurant process [Pitman (1995) <doi:10.1007/BF01213386>] is used in order to compose Dirichlet process [Ferguson (1973) <doi:10.1214/aos/1176342360>]. The clustering which uses Chinese restaurant process does not need to decide the number of clusters in advance. This algorithm automatically adjusts it. And this package calculates the ambiguity of clusters as entropy [Yngvason (1999) <doi:10.1016/S0370-1573(98)00082-9>].

Version: 1.0
Depends: R (≥ 3.2.3)
Imports: MASS, mvtnorm, randomcoloR, graphics, stats, utils, png
Suggests: knitr, rmarkdown
Published: 2018-01-15
Author: Masashi Okada [aut, cre]
Maintainer: Masashi Okada <okadaalgorithm at>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
CRAN checks: CRPClustering results


Reference manual: CRPClustering.pdf
Vignettes: How to use package CRPClustering
Package source: CRPClustering_1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: CRPClustering_1.0.tgz
OS X Mavericks binaries: r-oldrel: not available


Please use the canonical form to link to this page.