Pattern‐Similarity‐Based Model for Time Series Prediction. (6th August 2013)

• Record Type: Journal Article
• Authors: Bhardwaj, Saurabh; Srivastava, Smriti; Gupta, J. R. P.
• Is Part Of: Computational intelligence. Volume 31:Number 1(2015:Feb.)
• Page Start: 106
• Page End: 131
• Publication Date: 2013-08-06
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12015
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" id="coin12015-abs-0001"> <title> <x xml:space="preserve">Abstract</x> </title> <p id="coin12015-para-0001">This research proposes a pattern/shape‐similarity‐based clustering approach for time series prediction. This article uses single hidden Markov model (HMM) for clustering and combines it with soft computing techniques (fuzzy inference system/artificial neural network) for the prediction of time series. Instead of using distance function as an index of similarity, here shape/pattern of the sequence is used as the similarity index for clustering, which overcomes few of the shortcomings associated with distance‐based clustering approaches. Underlying hidden properties of time series are captured with the help of HMM. The prediction method used here exploits the pattern identification prowess of the HMM for cluster selection and the generalization and nonlinear modeling capabilities of soft computing methods to predict the output of the system. To see the validity of the proposed method in the real‐life scenario, it is tested on four different time series. The first is a benchmark Mackey–Glass time series, which is tested for delay parameters <italic>τ</italic> = 17 and <italic>τ</italic> = 30. The remaining time series are monthly sunspot data time series, Laser data time series and the last is Lorenz attractor time series. Simulation results show that the proposed method provide a better prediction performance in comparison with the existing methods.</p> </abstract>