Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clustering
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a nonparametric approach that can be used in envelope extraction, peak-burst detection and clustering in time series. Our problem formalization results in a naturally defined splitting/forking of the time series. With a possibly hierarchical implementation, it can be used for various applications in machine learning, signal processing and mathematical finance. From an incoming input signal, our iterative procedure sequentially creates two signals (one upper bounding and one lower bounding signal) by minimizing the cumulative L1 drift. We show that a solution can be efficiently calculated by use of a Viterbi-like path tracking algorithm together with an optimal elimination rule. We consider many interesting settings, where our algorithm has near-linear time complexities.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 4 of its 96 references that are in the map. First posted on arXiv 5 Sep 2021.
Builds on
4 of 96 references.
References · 4
- 2021Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statisticscited by 32
- 2018Sequential Outlier Detection based on Incremental Decision Treescited by 21
- 2021Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Errorcited by 17
- 2020Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environmentscited by 15
Built on by
Citing papers per year: 2022: 7; 2023: 4; 2024: 0; 2025: 1.
12 papers.
- 2022Smoothing with the Best Rectangle Window is Optimal for All Tapered Rectangle Windowscited by 3
- 2022Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexitycited by 1
- 2022Blind Source Separation for Mixture of Sinusoids with Near-Linear Computational Complexitycited by 1
- 2022Second Order Regret Bounds Against Generalized Expert Sequences under Partial Bandit Feedbackcited by 1
- 2022Merging Knockout and Round-Robin Tournaments: A Flexible Linear Elimination Tournament Designcited by 0
- 2022Robust, Nonparametric, Efficient Decomposition of Spectral Peaks under Distortion and Interferencecited by 0
- 2022An Auto-Regressive Formulation for Smoothing and Moving Mean with Exponentially Tapered Windowscited by 0
- 2023A 2-opt Algorithm for Locally Optimal Set Partition Optimizationcited by 0
- 2023Formulation of Weighted Average Smoothing as a Projection of the Origin onto a Convex Polytopecited by 0
- 2023A Note On Nonlinear Regression Under L2 Losscited by 0
- 2023Sequential Linearithmic Time Optimal Unimodal Fitting When Minimizing Univariate Linear Lossescited by 0
- 2025Kinematic-Based Assessment of Surgical Actions in Microanastomosiscited by 0
- 2025Kinematic-Based Assessment of Surgical Actions in Microanastomosis30 Dec 2025
- 2023Sequential Linearithmic Time Optimal Unimodal Fitting When Minimizing Univariate Linear Losses4 Apr 2023
- 2023A Note On Nonlinear Regression Under L2 Loss30 Mar 2023
- 2023Formulation of Weighted Average Smoothing as a Projection of the Origin onto a Convex Polytope19 Mar 2023
- 2023A 2-opt Algorithm for Locally Optimal Set Partition Optimization14 Mar 2023
- 2022An Auto-Regressive Formulation for Smoothing and Moving Mean with Exponentially Tapered Windows29 Jun 2022
- 2022Robust, Nonparametric, Efficient Decomposition of Spectral Peaks under Distortion and Interference18 Apr 2022
- 2022Second Order Regret Bounds Against Generalized Expert Sequences under Partial Bandit Feedback13 Apr 2022
- 2022Blind Source Separation for Mixture of Sinusoids with Near-Linear Computational Complexity27 Mar 2022
- 2022Merging Knockout and Round-Robin Tournaments: A Flexible Linear Elimination Tournament Design22 Mar 2022
- 2022Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity15 Mar 2022
- 2022Smoothing with the Best Rectangle Window is Optimal for All Tapered Rectangle Windows6 Mar 2022