Distance for Functional Data Clustering Based on Smoothing Parameter Commutation
ShengLi Tzeng, Christian Hennig, Yu-Fen Li, Chien-Ju Lin

TL;DR
This paper introduces a new dissimilarity measure for functional data clustering that uses pairwise smoothing parameter commutation, improving robustness to noise and missing data while maintaining computational efficiency.
Contribution
The novel dissimilarity measure based on pairwise smoothing parameter commutation enhances functional data clustering by handling missing data and outliers effectively.
Findings
Outperforms existing dissimilarity measures in simulations
Handles missing values and irregular time points directly
Maintains computational complexity similar to Euclidean distance
Abstract
We propose a novel method to determine the dissimilarity between subjects for functional data clustering. Spline smoothing or interpolation is common to deal with data of such type. Instead of estimating the best-representing curve for each subject as fixed during clustering, we measure the dissimilarity between subjects based on varying curve estimates with commutation of smoothing parameters pair-by-pair (of subjects). The intuitions are that smoothing parameters of smoothing splines reflect inverse signal-to-noise ratios and that applying an identical smoothing parameter the smoothed curves for two similar subjects are expected to be close. The effectiveness of our proposal is shown through simulations comparing to other dissimilarity measures. It also has several pragmatic advantages. First, missing values or irregular time points can be handled directly, thanks to the nature of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
