Installation
About
An implementation of k-means specifically design to cluster joint trajectories (longitudinal data on several variable-trajectories). Like 'kml', it provides facilities to deal with missing value, compute several quality criterion (Calinski and Harabatz, Ray and Turie, Davies and Bouldin, BIC,...) and propose a graphical interface for choosing the 'best' number of clusters. In addition, the 3D graph representing the mean joint-trajectories of each cluster can be exported through LaTeX in a 3D dynamic rotating PDF graph.
| Citation | kml3d citation info |
| www.r-project.org |
Key Metrics
Downloads
| Yesterday | 45 |
| Last 7 days | 72 -18% |
| Last 30 days | 401 -20% |
| Last 90 days | 1.508 +26% |
| Last 365 days | 5.041 +5% |