# Clustering multivariate functional data using unsupervised binary trees

arXiv: https://arxiv.org/abs/2012.05973 · HTML: https://mlsanity.com/paper/2012.05973/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Dec 2020.

## Built on by (most cited first, 3 of 3)

- [Review of Clustering Methods for Functional Data](https://mlsanity.com/paper/2210.00847/) (2022)
- [FDApy: a Python package for functional data](https://mlsanity.com/paper/2101.11003/) (2021)
- [Enhancing Visual Interpretability and Explainability in Functional Survival Trees and Forests](https://mlsanity.com/paper/2504.18498/) (2025)

## Abstract (arXiv)

We propose a model-based clustering algorithm for a general class of functional data for which the components could be curves or images. The random functional data realizations could be measured with error at discrete, and possibly random, points in the definition domain. The idea is to build a set of binary trees by recursive splitting of the observations. The number of groups are determined in a data-driven way. The new algorithm provides easily interpretable results and fast predictions for online data sets. Results on simulated datasets reveal good performance in various complex settings. The methodology is applied to the analysis of vehicle trajectories on a German roundabout.