mlsanityData to 7 Oct 2026

Nonparametric Extrema Analysis in Time Series for Envelope Extraction, Peak Detection and Clustering

arXiv 2109.02082 ↗First posted 5 Sep 2021cs.LG eess.SP q-fin.MFcited by 12

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

  1. 2021Generalized Huber Loss for Robust Learning and its Efficient Minimization for a Robust Statisticscited by 32
  2. 2018Sequential Outlier Detection based on Incremental Decision Treescited by 21
  3. 2021Optimally Efficient Sequential Calibration of Binary Classifiers to Minimize Classification Errorcited by 17
  4. 2020Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environmentscited by 15

Built on by

Cited by year

Citing papers per year: 2022: 7; 2023: 4; 2024: 0; 2025: 1.

12 papers.