Skip to Main content Skip to Navigation
Journal articles

kmlShape: An Efficient Method to Cluster Longitudinal Data (Time-Series) According to Their Shapes

Abstract : Background Longitudinal data are data in which each variable is measured repeatedly over time. One possibility for the analysis of such data is to cluster them. The majority of clustering methods group together individual that have close trajectories at given time points. These methods group trajectories that are locally close but not necessarily those that have similar shapes. However, in several circumstances, the progress of a phenomenon may be more important than the moment at which it occurs. One would thus like to achieve a partitioning where each group gathers individuals whose trajectories have similar shapes whatever the time lag between them. Method In this article, we present a longitudinal data partitioning algorithm based on the shapes of the trajectories rather than on classical distances. Because this algorithm is time consuming, we propose as well two data simplification procedures that make it applicable to high dimensional datasets. Results In an application to Alzheimer disease, this algorithm revealed a "rapid decline" patient group that was not found by the classical methods. In another application to the feminine menstrual cycle, the algorithm showed, contrarily to the current literature, that the luteinizing hormone presents two peaks in an important proportion of women (22%).
Complete list of metadata
Contributor : Administrateur HAL Nanterre Connect in order to contact the contributor
Submitted on : Tuesday, February 14, 2017 - 4:18:06 PM
Last modification on : Monday, July 4, 2022 - 9:50:02 AM

Links full text



Christophe Genolini, René Ecochard, Mamoun Benghezal, Driss Tarak, Sandrine Andrieu, et al.. kmlShape: An Efficient Method to Cluster Longitudinal Data (Time-Series) According to Their Shapes. PLoS ONE, Public Library of Science, 2016, 11 (6), ⟨10.1371/journal.pone.0150738⟩. ⟨hal-01467694⟩



Record views