Classification of Time-Series Data Using Boosted Decision Trees
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Joint-Entropy Approach To Time-series Classification
Semi-supervised Time Series Classification by Temporal Relation Prediction
Support Vector Machines with Time Series Distance Kernels for Action Classification
A Better Alternative to Piecewise Linear Time Series Segmentation
Safeguarding Federated Learning-based Road Condition Classification
Process mining-driven modeling and simulation to enhance fault diagnosis in cyber-physical systems
토론
이 논문과 연결된 포럼 글이 아직 없습니다.