Distance for Functional Data Clustering Based on Smoothing Parameter Commutation

04/10/2016
by   ShengLi Tzeng, et al.
0

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 smoothing splines. Second, conventional clustering method based on dissimilarity can be employed straightforward, and the dissimilarity also serves as a useful tool for outlier detection. Third, the implementation is almost handy since subroutines for smoothing splines and numerical integration are widely available. Fourth, the computational complexity does not increase and is parallel with that in calculating Euclidean distance between curves estimated by smoothing splines.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2018

Blended smoothing splines on Riemannian manifolds

We present a method to compute a fitting curve B to a set of data points...
research
03/14/2018

Smoothing Spline Growth Curves With Covariates

We adapt the interactive spline model of Wahba to growth curves with cov...
research
05/27/2022

Clustering Functional Data via Variational Inference

Functional data analysis deals with data that are recorded densely over ...
research
06/05/2018

RG Smoothing Algorithm Which Makes Data Compression

I describe a new method for smoothing a one-dimensional curve in Euclidi...
research
06/12/2022

smoothEM: a new approach for the simultaneous assessment of smooth patterns and spikes

We consider functional data where an underlying smooth curve is composed...
research
07/10/2018

Multi-D Kneser-Ney Smoothing Preserving the Original Marginal Distributions

Smoothing is an essential tool in many NLP tasks, therefore numerous tec...
research
11/23/2022

Shapley Curves: A Smoothing Perspective

Originating from cooperative game theory, Shapley values have become one...

Please sign up or login with your details

Forgot password? Click here to reset