Interval and dynamic time warping-based decision trees

This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirements of data mining is to produce comprehensible models. Decision trees are one of the most comprehensible classifiers. The use of these methods directly on this kind of data is, generally, not adequate, because complex and inaccurate classifiers are obtained. Hence, instead of using the raw features, new ones are constructed. This work presents two types of trees. In interval-based trees, the decision nodes evaluate a function (e.g., the average) in an interval and the result is compared to a threshold. For DTW-based trees each decision node has a reference example. The distance from the example to classify to the reference example is calculated and then it is compared to a threshold. The method for obtaining these trees it is based on 1) to develop a method that obtains for a 2-class data set a classifie...

• Type: Conference
• Year: 2004
• Where: SAC
• Authors: Juan José Rodríguez, Carlos J. Alonso
• Keywords: Applied Computing, Decision Trees, Reference Example, SAC 2004, Work Presents Decision