Variable selection in functional data classification: a maxima-hunting proposal
Not on the map. Why?
Abstract (arXiv)
Variable selection is considered in the setting of supervised binary classification with functional data X(t), t∈[0,1]. By "variable selection" we mean any dimension-reduction method which leads to replace the whole trajectory X(t), t∈[0,1], with a low-dimensional vector (X(t1),ldots,X(tk)) still keeping a similar classification error. Our proposal for variable selection is based on the idea of selecting the local maxima (t1,ldots,tk) of the function mathcal VX2(t)=mathcal V2(X(t),Y), where mathcal V denotes the "distance covariance" association measure for random variables due to Sz'ekely, Rizzo and Bakirov (2007). This method provides a simple natural way to deal with the relevance vs. redundancy trade-off which typically appears in variable selection. This paper includes (a) Some theoretical motivation: a result of consistent estimation on the maxima of mathcal VX2 is shown. We also show different theoretical models for the underlying process X(t) under which the relevant information in concentrated in the maxima of mathcal VX2. (b) An extensive empirical study, including about 400 simulated models and real data examples, aimed at comparing our variable selection method with other standard proposals for dimension reduction.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Sep 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1.
3 papers.
- 2022scikit-fda: A Python Package for Functional Data Analysiscited by 12
- 2023Functional Diffusion Mapscited by 1
- 2022Uncovering Regions of Maximum Dissimilarity on Random Process Datacited by 0
- 2023Functional Diffusion Maps27 Apr 2023
- 2022scikit-fda: A Python Package for Functional Data Analysis4 Nov 2022
- 2022Uncovering Regions of Maximum Dissimilarity on Random Process Data12 Sep 2022