Mining Multivariate Time Series Models with Soft-Computing Techniques: A Coarse-Grained Parallel Computing Approach

  1. (PDF, 494 KB)
AuthorSearch for: ; Search for:
ConferenceLecture Notes in Computer Science (Kumar, Gavrilova, Tan, L'Ecuyer eds
VolumeLNCS 2668
AbstractThis paper presents experimental results of a parallel implementation of a soft-computing algorithm for model discovery in multivariate time series, possibly with missing values. It uses a hybrid neural network with two different types of neurons trained with a non-traditional procedure. Models describing the multivariate time dependencies are encoded as binary strings representing neural networks, and evolved using genetic algorithms. The present paper studies its properties from an experimental point of view (using homogeneous and heterogeneous clusters) focussing on: i) the influence of missing values, ii) the factors controlling the parallel computation, and iii) the effectiveness of the time series prediction results. Results confirm that i) the algorithm possesses high tolerance to missing data, ii) Athon-based homogeneous clusters have higher throughput than Xeon-based homogeneous clusters, iii) an increase of the number of slaves reduces the processing time until communication overhead dominates (as expected), and iv) running the algorithm in parallel does not affect the RMS error (as expected). Even though much of this behaviour could be qualitatively expected, appropriate tradeoffs between error and time were actually discovered, thereby enabling more effective, systematic, future uses of the system.
Publication date
AffiliationNRC Institute for Information Technology; National Research Council Canada
Peer reviewedNo
NRC number46511
NPARC number8914041
Export citationExport as RIS
Report a correctionReport a correction
Record identifierf4641406-22ef-4923-a41f-5c7a1778c56b
Record created2009-04-22
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)