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.
copied from cf-staging / r-kml3d
https://anaconda.org/conda-forge/r-kml3d/badges/version.svg
https://anaconda.org/conda-forge/r-kml3d/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-kml3d/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-kml3d/badges/platforms.svg
https://anaconda.org/conda-forge/r-kml3d/badges/license.svg
https://anaconda.org/conda-forge/r-kml3d/badges/downloads.svg