An implementation of k-means specifically design to cluster longitudinal data. 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.
copied from cf-staging / r-kml
https://anaconda.org/conda-forge/r-kml/badges/version.svg
https://anaconda.org/conda-forge/r-kml/badges/latest_release_date.svg
https://anaconda.org/conda-forge/r-kml/badges/latest_release_relative_date.svg
https://anaconda.org/conda-forge/r-kml/badges/platforms.svg
https://anaconda.org/conda-forge/r-kml/badges/license.svg
https://anaconda.org/conda-forge/r-kml/badges/downloads.svg