kml3d (Q32959)

From MaRDI portal
K-Means for Joint Longitudinal Data
Language Label Description Also known as
English
kml3d
K-Means for Joint Longitudinal Data

    Statements

    0 references
    0 references
    2.4.6
    12 February 2023
    0 references
    0.1
    4 May 2010
    0 references
    0.5
    9 August 2011
    0 references
    0.6
    24 November 2011
    0 references
    0.7
    8 December 2011
    0 references
    2.0
    28 March 2012
    0 references
    2.1.1
    18 November 2012
    0 references
    2.1.2
    19 November 2012
    0 references
    2.1
    20 August 2012
    0 references
    2.2
    25 March 2014
    0 references
    2.3
    21 May 2015
    0 references
    2.4.1
    16 February 2016
    0 references
    2.4.2
    8 August 2017
    0 references
    2.4
    17 August 2015
    0 references
    2.4.6.1
    13 December 2023
    0 references
    0 references
    0 references
    13 December 2023
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references