The functional mean-shift algorithm for mode hunting and clustering in infinite dimensions
pith:VVKJZWSJ Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{VVKJZWSJ}
Prints a linked pith:VVKJZWSJ badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
We introduce the functional mean-shift algorithm, an iterative algorithm for estimating the local modes of a surrogate density from functional data. We show that the algorithm can be used for cluster analysis of functional data. We propose a test based on the bootstrap for the significance of the estimated local modes of the surrogate density. We present two applications of our methodology. In the first application, we demonstrate how the functional mean-shift algorithm can be used to perform spike sorting, i.e. cluster neural activity curves. In the second application, we use the functional mean-shift algorithm to distinguish between original and fake signatures.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Blurring Mean Shift for Clustering Functional Data: A Scalable Algorithm and Convergence Analysis
Extends blurring mean shift to functional data in Hilbert space with convergence analysis and a scalable stochastic variant based on random partitioning.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.