J48SS: A Novel Decision Tree Approach for the Handling of Sequential and Time Series Data

• Main Authors: Andrea Brunello, Enrico Marzano, Angelo Montanari, Guido Sciavicco
• Format: Article
• Language: English
• Published: MDPI AG 2019-03-01
• Series: Computers
• Subjects: machine learning; decision trees; sequential data; pattern mining; time series classification; evolutionary algorithms
• Online Access: http://www.mdpi.com/2073-431X/8/1/21

Temporal information plays a very important role in many analysis tasks, and can be encoded in at least two different ways. It can be modeled by discrete sequences of events as, for example, in the business intelligence domain, with the aim of tracking the evolution of customer behaviors over time. Alternatively, it can be represented by time series, as in the stock market to characterize price histories. In some analysis tasks, temporal information is complemented by other kinds of data, which may be represented by static attributes, e.g., categorical or numerical ones. This paper presents J48SS, a novel decision tree inducer capable of natively mixing static (i.e., numerical and categorical), sequential, and time series data for classification purposes. The novel algorithm is based on the popular C4.5 decision tree learner, and it relies on the concepts of frequent pattern extraction and time series shapelet generation. The algorithm is evaluated on a text classification task in a real business setting, as well as on a selection of public UCR time series datasets. Results show that it is capable of providing competitive classification performances, while generating highly interpretable models and effectively reducing the data preparation effort.