Clustering multivariate functional data using unsupervised binary trees
arXiv:2012.05973 · doi:10.1016/j.csda.2021.107376
Abstract
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.
References in corpus (14)
- Scikit-learn: Machine Learning in Python
- Natural Scales in Geographical Patterns
- Multivariate Functional Principal Component Analysis for Data Observed on Different (Dimensional) Domains
- Functional Data Analysis of Amplitude and Phase Variation
- The discriminative functional mixture model for a comparative analysis of bike sharing systems
- Defining probability density for a distribution of random functions
- Interpretable Clustering using Unsupervised Binary Trees
- Conditional Flow Variational Autoencoders for Structured Sequence Prediction
- The highD Dataset: A Drone Dataset of Naturalistic Vehicle Trajectories on German Highways for Validation of Highly Automated Driving Systems
- Low-Rank Covariance Function Estimation for Multidimensional Functional Data
- Functional Isolation Forest
- Unexpected properties of bandwidth choice when smoothing discrete data for constructing a functional data classifier
- Learning the smoothness of noisy curves with application to online curve estimation
- Vehicle Trajectory Prediction in Crowded Highway Scenarios Using Bird Eye View Representations and CNNs