The Area of the Convex Hull of Sampled Curves: a Robust Functional Statistical Depth Measure
Not on the map. Why?
Abstract (arXiv)
With the ubiquity of sensors in the IoT era, statistical observations are becoming increasingly available in the form of massive (multivariate) time-series. Formulated as unsupervised anomaly detection tasks, an abundance of applications like aviation safety management, the health monitoring of complex infrastructures or fraud detection can now rely on such functional data, acquired and stored with an ever finer granularity. The concept of statistical depth, which reflects centrality of an arbitrary observation w.r.t. a statistical population may play a crucial role in this regard, anomalies corresponding to observations with 'small' depth. Supported by sound theoretical and computational developments in the recent decades, it has proven to be extremely useful, in particular in functional spaces. However, most approaches documented in the literature consist in evaluating independently the centrality of each point forming the time series and consequently exhibit a certain insensitivity to possible shape changes. In this paper, we propose a novel notion of functional depth based on the area of the convex hull of sampled curves, capturing gradual departures from centrality, even beyond the envelope of the data, in a natural fashion. We discuss practical relevance of commonly imposed axioms on functional depths and investigate which of them are satisfied by the notion of depth we promote here. Estimation and computational issues are also addressed and various numerical experiments provide empirical evidence of the relevance of the approach proposed.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 3; 2024: 1.
9 papers.
- 2021A Pseudo-Metric between Probability Distributions based on Depth-Trimmed Regionscited by 17
- 2022Learning Disentangled Textual Representations via Statistical Measures of Similaritycited by 14
- 2022Functional Anomaly Detection: a Benchmark Studycited by 10
- 2021Affine-Invariant Integrated Rank-Weighted Depth: Definition, Properties and Finite Sample Analysiscited by 8
- 2023Hypothesis Transfer Learning with Surrogate Classification Losses: Generalization Bounds through Algorithmic Stabilitycited by 4
- 2022Beyond Mahalanobis-Based Scores for Textual OOD Detectioncited by 3
- 2023Toward Stronger Textual Attack Detectorscited by 3
- 2023A Novel Information-Theoretic Objective to Disentangle Representations for Fair Classificationcited by 1
- 2024Signature Isolation Forestcited by 1
- 2024Signature Isolation Forest7 Mar 2024
- 2023Toward Stronger Textual Attack Detectors21 Oct 2023
- 2023A Novel Information-Theoretic Objective to Disentangle Representations for Fair Classification21 Oct 2023
- 2023Hypothesis Transfer Learning with Surrogate Classification Losses: Generalization Bounds through Algorithmic Stability31 May 2023
- 2022Beyond Mahalanobis-Based Scores for Textual OOD Detection24 Nov 2022
- 2022Learning Disentangled Textual Representations via Statistical Measures of Similarity7 May 2022
- 2022Functional Anomaly Detection: a Benchmark Study13 Jan 2022
- 2021Affine-Invariant Integrated Rank-Weighted Depth: Definition, Properties and Finite Sample Analysis21 Jun 2021
- 2021A Pseudo-Metric between Probability Distributions based on Depth-Trimmed Regions23 Mar 2021