Computer Science – Learning
Scientific paper
2002-10-29
Computer Science
Learning
26 pages, 5 figures; 5 tables; http://www.santafe.edu/projects/CompMech Added discussion of algorithm parameters; improved t
Scientific paper
We present a new algorithm for discovering patterns in time series and other sequential data. We exhibit a reliable procedure for building the minimal set of hidden, Markovian states that is statistically capable of producing the behavior exhibited in the data -- the underlying process's causal states. Unlike conventional methods for fitting hidden Markov models (HMMs) to data, our algorithm makes no assumptions about the process's causal architecture (the number of hidden states and their transition structure), but rather infers it from the data. It starts with assumptions of minimal structure and introduces complexity only when the data demand it. Moreover, the causal states it infers have important predictive optimality properties that conventional HMM states lack. We introduce the algorithm, review the theory behind it, prove its asymptotic reliability, use large deviation theory to estimate its rate of convergence, and compare it to other algorithms which also construct HMMs from data. We also illustrate its behavior on an example process, and report selected numerical results from an implementation.
Crutchfield James P.
Shalizi Cosma Rohilla
Shalizi Kristina Lisa
No associations
LandOfFree
An Algorithm for Pattern Discovery in Time Series does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Algorithm for Pattern Discovery in Time Series, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm for Pattern Discovery in Time Series will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-533887