Papers › Clustering Sets of Functional Data by Similarity in Law
Clustering Sets of Functional Data by Similarity in Law
Antonio Galves, Fernando Najman, Marcela Svarc, Claudia D. Vargas
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We introduce a new clustering method for the classification of functional data sets by their probabilistic law, that is, a procedure that aims to assign data sets to the same cluster if and only if the data were generated with the same underlying distribution. This method has the nice virtue of being non-supervised and non-parametric, allowing for exploratory investigation with few assumptions about the data. Rigorous finite bounds on the classification error are given along with an objective heuristic that consistently selects the best partition in a data-driven manner. Simulated data has been clustered with this procedure to show the performance of the method with different parametric model classes of functional data.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections