mlsanityData to 7 Oct 2026

Classification of Time-Series Data Using Boosted Decision Trees

arXiv 2110.00581 ↗First posted 1 Oct 2021cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

Time-series data classification is central to the analysis and control of autonomous systems, such as robots and self-driving cars. Temporal logic-based learning algorithms have been proposed recently as classifiers of such data. However, current frameworks are either inaccurate for real-world applications, such as autonomous driving, or they generate long and complicated formulae that lack interpretability. To address these limitations, we introduce a novel learning method, called Boosted Concise Decision Trees (BCDTs), to generate binary classifiers that are represented as Signal Temporal Logic (STL) formulae. Our algorithm leverages an ensemble of Concise Decision Trees (CDTs) to improve the classification performance, where each CDT is a decision tree that is empowered by a set of techniques to generate simpler formulae and improve interpretability. The effectiveness and classification performance of our algorithm are evaluated on naval surveillance and urban-driving case studies.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 7 of its 28 references that are in the map. First posted on arXiv 1 Oct 2021.

Builds on

7 of 28 references.

References · 7

  1. 2017CARLA: An Open Urban Driving Simulatorcited by 2,431
  2. 2018Learning Linear Temporal Propertiescited by 41
  3. 2020Specifying User Preferences using Weighted Signal Temporal Logiccited by 22
  4. 2019Interpretable Classification of Time-Series Data using Efficient Enumerative Techniquescited by 19
  5. 2015Mining Parametric Temporal Logic Properties in Model Based Design for Cyber-Physical Systemscited by 16
  6. 2018Information-Guided Temporal Logic Inference with Prior Knowledgecited by 12
  7. 2016Logic-based Clustering and Learning for Time-Series Datacited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 1; 2023: 1; 2024: 4; 2025: 0; 2026: 1.

9 papers.