Blurring Mean Shift for Clustering Functional Data: A Scalable Algorithm and Convergence Analysis
Toshinari Morimoto, Ting-Li Chen, Su-Yun Huang, Ruey S. Tsay

TL;DR
This paper extends the blurring mean shift algorithm to functional data, introduces a scalable stochastic variant, and provides convergence analysis, demonstrated on real-world large-scale datasets.
Contribution
It develops a scalable stochastic version of the functional mean shift algorithm and provides theoretical convergence guarantees for both full and stochastic methods.
Findings
The method effectively clusters functional data without pre-specifying the number of clusters.
The stochastic variant significantly reduces computational complexity for large datasets.
Convergence analysis supports the reliability of the full algorithm.
Abstract
This paper extends the blurring mean shift algorithm from vector-valued data to functional data, enabling effective clustering in infinite-dimensional settings without requiring specification of the number of clusters. To address the computational challenges posed by large-scale datasets, we introduce a fast stochastic variant that significantly reduces computational complexity. We provide a rigorous convergence analysis for the full blurring functional mean shift procedure, establishing theoretical guarantees for its iterative behavior. For the stochastic variant, we provide partial theoretical justification by showing that, when the subset size is sufficiently large, its one-step update is well approximated by the corresponding update of the full algorithm. The proposed method is demonstrated through real-data applications, including hourly Taiwan PM measurements and Argo…
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.
