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.2 |
| Depends: | R (≥ 3.2.3) |
| Imports: | MASS, mvtnorm, randomcoloR, lucid, dplyr, graphics, stats, utils, png |
| Suggests: | R.rsp |
| Published: | 2018-05-01 |
| Author: | Masashi Okada [aut, cre] |
| Maintainer: | Masashi Okada <okadaalgorithm at gmail.com> |
| 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.2.tar.gz |
| Windows binaries: | r-devel: CRPClustering_1.2.zip, r-release: CRPClustering_1.2.zip, r-oldrel: CRPClustering_1.2.zip |
| macOS binaries: | r-release: CRPClustering_1.2.tgz, r-oldrel: CRPClustering_1.2.tgz |
| Old sources: | CRPClustering archive |
Please use the canonical form https://CRAN.R-project.org/package=CRPClustering to link to this page.