Abstract

System dynamics (SD) is a simulation-based approach for analyzing feedback-rich systems. An ideal SD modeling cycle requires evaluating the qualitative pattern characteristics of a large set of time series model output for testing, validation, scenario analysis, and policy analysis purposes. This traditionally requires expert judgement, which limits the extent of experimentation due to time constraints. Although time series recognition approaches can help to automate such an evaluation, utilization of them has been limited to a hidden Markov model classifier, namely the Indirect Structure Testing Software (ISTS) algorithm. Despite being used within several automated model-analysis tools, ISTS has several shortcomings. In that respect, we propose an interpretable time series classification algorithm for the SD field, which also addresses the shortcomings of ISTS. Our approach, which can highlight the regions of a certain time series that are influential in the class assignment, is an extension of the symbolic multivariate time series approach with the use of a local importance measure. We compare the performance of the proposed approach against both ISTS and nearest-neighbor (NN) classifiers. Our experiments on a SD-specific application show that the proposed approach outperforms ISTS as well as conventional NN classifiers on both noisy and nonnoisy datasets. Additionally, its class assignments are interpretable as opposed to the other approaches considered in the experiments.

Highlights

  • Time series classification is a data mining problem being studied in different fields such as medicine [1], finance [2], and engineering [3]

  • For each NN classifier, we report the average required time to classify one single time series, and the error rate, which is the average of the misclassification errors over all replications and folds

  • We introduce a preprocessing stage in order to equate the lengths of the time series through interpolation

Read more

Summary

Introduction

Time series classification is a data mining problem being studied in different fields such as medicine [1], finance [2], and engineering [3]. Since application-specific approaches are needed due to the characteristics of the dataset at hand, the need for time series classification tools tailored to the SD field is obvious. Similarity-based approaches such as 1-nearest-neighbor (NN) classifiers with Euclidean or a dynamic time warping (DTW) distance have been widely and successfully used to classify time series [4,5,6]. The ISTS algorithm is a continuous density HMM-based algorithm developed to classify fundamental dynamic behavior patterns studied in the SD field [16]. ISTS is an ensemble of HMMs, each being trained for a particular behavior class. The ISTS relies on an ensemble of HMMs trained on the features to classify 25 principal behavior types. The reader is referred to [16]

Objectives
Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.