Sparse clustering of functional data

From MaRDI portal
Publication:61004

DOI10.1016/J.JMVA.2016.10.008zbMATH Open1353.62069arXiv1501.04755OpenAlexW252014637MaRDI QIDQ61004FDOQ61004


Authors: Davide Floriello, Valeria Vitelli, Davide Floriello, Valeria Vitelli Edit this on Wikidata


Publication date: February 2017

Published in: Journal of Multivariate Analysis (Search for Journal in Brave)

Abstract: We consider the problem of clustering functional data while jointly selecting the most relevant features for classification. This problem has never been tackled before in the functional data context, and it requires a proper definition of the concept of sparsity for functional data. Functional sparse clustering is here analytically defined as a variational problem with a hard thresholding constraint ensuring the sparsity of the solution. First, a unique solution to sparse clustering with hard thresholding in finite dimensions is proved to exist. Then, the infinite dimensional generalization is given and proved to have a unique solution. Both the multivariate and the functional version of sparse clustering with hard thresholding exhibits improvements on other standard and sparse clustering strategies on simulated data. A real functional data application is also shown.


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




Recommendations




Cites Work


Cited In (23)

Uses Software





This page was built for publication: Sparse clustering of functional data

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