CrossClustering
A Partial Clustering Algorithm
Provide the 'CrossClustering' algorithm (Tellaroli et al. (2016) <doi:10.1371/journal.pone.0152333>), which is a partial clustering algorithm that combines the Ward's minimum variance and Complete Linkage algorithms, providing automatic estimation of a suitable number of clusters and identification of outlier elements.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
4.1.3 |
rolling linux/jammy R-4.5 | CrossClustering_4.1.3.tar.gz |
75.8 KiB |
4.1.3 |
rolling linux/noble R-4.5 | CrossClustering_4.1.3.tar.gz |
75.7 KiB |
4.1.3 |
rolling source/ R- | CrossClustering_4.1.3.tar.gz |
29.9 KiB |
4.1.3 |
latest linux/jammy R-4.5 | CrossClustering_4.1.3.tar.gz |
75.8 KiB |
4.1.3 |
latest linux/noble R-4.5 | CrossClustering_4.1.3.tar.gz |
75.7 KiB |
4.1.3 |
latest source/ R- | CrossClustering_4.1.3.tar.gz |
29.9 KiB |
4.1.3 |
2026-04-26 source/ R- | CrossClustering_4.1.3.tar.gz |
29.9 KiB |
4.1.3 |
2026-04-23 source/ R- | CrossClustering_4.1.3.tar.gz |
29.9 KiB |
4.1.3 |
2026-04-09 windows/windows R-4.5 | CrossClustering_4.1.3.zip |
79.6 KiB |
4.1.2 |
2025-04-20 source/ R- | CrossClustering_4.1.2.tar.gz |
29.9 KiB |