ODMeans
OD-Means: k-Means for Origin-Destination
OD-means is a hierarchical adaptive k-means algorithm based on origin-destination pairs. In the first layer of the hierarchy, the clusters are separated automatically based on the variation of the within-cluster distance of each cluster until convergence. The second layer of the hierarchy corresponds to the sub clustering process of small clusters based on the distance between the origin and destination of each cluster.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.2.1 |
rolling linux/jammy R-4.5 | ODMeans_0.2.1.tar.gz |
3.0 MiB |
0.2.1 |
rolling linux/noble R-4.5 | ODMeans_0.2.1.tar.gz |
3.0 MiB |
0.2.1 |
rolling source/ R- | ODMeans_0.2.1.tar.gz |
3.0 MiB |
0.2.1 |
latest linux/jammy R-4.5 | ODMeans_0.2.1.tar.gz |
3.0 MiB |
0.2.1 |
latest linux/noble R-4.5 | ODMeans_0.2.1.tar.gz |
3.0 MiB |
0.2.1 |
latest source/ R- | ODMeans_0.2.1.tar.gz |
3.0 MiB |
0.2.1 |
2026-04-26 source/ R- | ODMeans_0.2.1.tar.gz |
3.0 MiB |
0.2.1 |
2026-04-23 source/ R- | ODMeans_0.2.1.tar.gz |
3.0 MiB |
0.2.1 |
2026-04-09 windows/windows R-4.5 | ODMeans_0.2.1.zip |
3.0 MiB |
0.2.1 |
2025-04-20 source/ R- | ODMeans_0.2.1.tar.gz |
3.0 MiB |