Description: KmL is 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.
Collate: global.R clusterLongData.R parKml.R parChoice.R kml.R
Packaged: 2014-03-24 09:40:52 UTC; GENOLLINI

Description: An implementation of k-means specifically design
Packaged: 2015-06-03 21:50:50 UTC; Christophe

Packaged: 2015-05-20 00:00:16 UTC; Christophe

Packaged: 2016-02-11 17:37:52 UTC; Christophe

Packaged: 2015-08-17 15:52:00 UTC; Christophe

Title: K-means for joint Longitudinal data
Description: KmL3D is an implementation of k-means specificaly design
to deal with joint longitudinal data (longitudinal data on
several variable). It provide facilities to deal with missing
value and propose a graphical interphace for chosing the
Collate: global.r function.r partition.r parLongData.r parWindows.r
listClustering.r clusterLongData.r parKml.r parChoice.r kml.r
Packaged: 2010-05-03 19:49:02 UTC; Christophe

Packaged: 2011-08-09 07:33:30 UTC; Christophe

Packaged: 2011-11-24 09:55:22 UTC; GENOLLINI

Packaged: 2011-12-07 16:04:58 UTC; GENOLLINI

to deal with joint trajectories (longitudinal data on several
variable-trajectories).  It provide facilities to deal with
Harabatz, Ray and Turie, Davies and Bouldin) and propose a
graphical interphace for chosing the 'best' number of clusters.
Collate: global.r distance3d.r clusterLongData3d.r kml3d.r
Packaged: 2012-03-28 08:42:06 UTC; GENOLLINI

Description: KmL3D is 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.
Depends: methods,clv,rgl,misc3d,longitudinalData(>= 2.1), kml(>= 2.1)
Packaged: 2012-11-18 10:35:56 UTC; GENOLLINI
Author: Christophe Genolini [cre, aut], Bruno Falissard [ctb],