Band depth based initialization of K-means for functional data clustering

DOI10.1007/S11634-022-00510-WMaRDI QIDQ6106174zbMATH OpenOpenAlexFDO

Authors Javier Albert-Smet, Aurora Torrente, Juan Romo

Publication date 27 June 2023

Published in Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2106.01129

zbMATH Keywords

\(k\)-meansB-splinebootstrapfunctional datamodified band depth

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Functional data analysis (62R10)

Abstract: The $k$-Means algorithm is one of the most popular choices for clustering data but is well-known to be sensitive to the initialization process. There is a substantial number of methods that aim at finding optimal initial seeds for $k$-Means, though none of them are universally valid. This paper presents an extension to longitudinal data of one of such methods, the BRIk algorithm, that relies on clustering a set of centroids derived from bootstrap replicates of the data and on the use of the versatile Modified Band Depth. In our approach we improve the BRIk method by adding a step where we fit appropriate B-splines to our observations and a resampling process that allows computational feasibility and handling issues such as noise or missing data. Our results with simulated and real data sets indicate that our $F$unctional Data $A$pproach to the BRIK method (FABRIk) is more effective than previous proposals at providing seeds to initialize $k$-Means in terms of clustering recovery.

Cites work

• \(k\)-mean alignment for curve clustering
• A comparison of hierarchical methods for clustering functional data
• Analysis of variance for functional data
• Curve Registration
• Finding Groups in Data
• Functional data clustering: a survey
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• Initializing \(k\)-means clustering by bootstrap and data depth
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• On the Concept of Depth for Functional Data
• Robust depth-based estimation in the time warping model
• The plane with parallel coordinates
• Unsupervised Curve Clustering using B‐Splines

This page was built for publication: Band depth based initialization of K-means for functional data clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106174)