Clustering by fast search and find of density peaks
This package provides an improved implementation (based on k-nearest neighbors) of the density peak clustering algorithm, originally described by Alex Rodriguez and Alessandro Laio (Science, 2014 vol. 344). It can handle large datasets (> 100,000 samples) very efficiently.
| System | Target | Derivation | Build status |
|---|---|---|---|
| x86_64-linux | /gnu/store/wfw49l5ph819kpxdw3kdz8im4gbwzhaa-r-densityclust-0.3.drv | ||
| mips64el-linux | /gnu/store/8bwylnpk28bg38mir6jggq4316lbx921-r-densityclust-0.3.drv | ||
| i686-linux | /gnu/store/rbl76ma093ivaksnzii2sbb4rpv8fy0v-r-densityclust-0.3.drv | ||
| i586-gnu | /gnu/store/yddcayp0sgk2grpz52cl4z6bjj74g87g-r-densityclust-0.3.drv | ||
| armhf-linux | /gnu/store/w8gymrmv1g3vwcvm3rxs2wvln88adwc0-r-densityclust-0.3.drv | ||
| aarch64-linux | /gnu/store/d2ps0jasvmr46pks991nh6jxzjbfgjmp-r-densityclust-0.3.drv |
| Linter | Message | Location |
|---|---|---|
| No lint warnings ✓ | ||