A Decision Tree Approach to Data Classification using Signal Temporal Logic

Giuseppe Bombara, Cristian-Ioan Vasile, Francisco Penedo Alvarez, Yasuoka Hirotoshi, and Calin Belta. A Decision Tree Approach to Data Classification using Signal Temporal Logic. In Hybrid Systems: Computation and Control (HSCC), pages 1–10, Vienna, Austria, April 2016. doi:10.1145/2883817.2883843.

Published date: 
Tuesday, April 12, 2016

This paper introduces a framework for inference of timed temporal logic properties from data. The data is given as a finite set of pairs of finite-time system traces and labels, where the labels indicate whether the traces exhibit some desired behavior (e.g. a ship traveling along a safe route). We propose a decision-tree based approach for learning signal temporal logic classifiers. The method produces binary decision trees that represent the inferred formulae. Each node of the tree contains a test associated with the satisfaction of a simple formula, optimally chosen from a predefined finite set of primitives. Optimality is assessed using heuristic impurity measures, which capture how well the current primitive splits the data with respect to the traces' labels. We propose extensions of the usual impurity measures from machine learning literature to handle classification of system traces by leveraging upon the robustness degree concept. The proposed incremental construction procedure greatly improves the execution time and the accuracy compared to existing algorithms. We present two case studies that illustrate the usefulness and the computational advantages of the algorithms. The first is an anomaly detection problem in a maritime environment. The second is a fault detection problem in an automotive powertrain system.