dclust
Divisive Hierarchical Clustering
Contains a single function dclust() for divisive hierarchical clustering based on recursive k-means partitioning (k = 2). Useful for clustering large datasets where computation of a n x n distance matrix is not feasible (e.g. n > 10,000 records). For further information see Steinbach, Karypis and Kumar (2000) <http://glaros.dtc.umn.edu/gkhome/fetch/papers/docclusterKDDTMW00.pdf>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.0 |
rolling linux/jammy R-4.5 | dclust_0.1.0.tar.gz |
19.0 KiB |
0.1.0 |
rolling linux/noble R-4.5 | dclust_0.1.0.tar.gz |
18.9 KiB |
0.1.0 |
rolling source/ R- | dclust_0.1.0.tar.gz |
4.4 KiB |
0.1.0 |
latest linux/jammy R-4.5 | dclust_0.1.0.tar.gz |
19.0 KiB |
0.1.0 |
latest linux/noble R-4.5 | dclust_0.1.0.tar.gz |
18.9 KiB |
0.1.0 |
latest source/ R- | dclust_0.1.0.tar.gz |
4.4 KiB |
0.1.0 |
2026-04-26 source/ R- | dclust_0.1.0.tar.gz |
4.4 KiB |
0.1.0 |
2026-04-23 source/ R- | dclust_0.1.0.tar.gz |
4.4 KiB |
0.1.0 |
2026-04-09 windows/windows R-4.5 | dclust_0.1.0.zip |
21.4 KiB |
0.1.0 |
2025-04-20 source/ R- | dclust_0.1.0.tar.gz |
4.4 KiB |