White Box Clustering Algorithm Design
Overview
White Box Cluster Algorithm Design allows you to create Representative based cluster algorithm by using reusable components. This way one can recreate already available cluster algorithms (i.e. K-Means, K-Means++, PAM) but also create new cluster algorithms not available in the literature or any other software. For more information see papers doi:10.1007/s10462-009-9133-6 and doi:10.1016/j.datak.2012.03.005.
Install
Health
CRAN check results are not tracked yet.
Documentation
- Help pages
- 88
- Examples that run
- 100%6 run in a plain check
- Exported functions with examples
- 100%
- Documented parameters
- 100%
- Return-value docs
- 100%
- Help pages citing references
- 0%
Downloads
Dependencies
Code & Tests
People & History
- RR 4.0.0 released · 2020-04-24
- archivedRemoved from CRAN2019-12-21check problems were not corrected in time
- RR 3.6.0 released · 2019-04-26
- 0.1.22018-11-20
- RR 3.5.0 released · 2018-04-23
Package metadata
- First published
- 2018-11-20
- Total releases
- 1 / 8 yrs
- License
- GPL-3 OSI
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("whiboclustering")This package has no citation file, so citation() returns this entry built from DESCRIPTION.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-26, which the citation names so these numbers can be found later. More on citing and the projects behind them.