kml3d

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.

Last 30 days

This package has been downloaded 642 times in the last 30 days. More downloads than an obscure whitepaper, but not enough to bring down any servers. A solid effort! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 3 times.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.

Last 365 days

This package has been downloaded 7,000 times in the last 365 days. Impressive! The kind of number that makes colleagues ask, 'How did you do it?' The day with the most downloads was Mar 28, 2025 with 82 downloads.

The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.