Peng, Jyh-Ying, Aston, John A. D. and Liou, Cheng-Yuan. (2011) Modeling time series and sequences using Markov chain embedded finite automata. International Journal of Innovative Computing, Information and Control, Volume 7 (Number 1). pp. 407-431. ISSN 1349-4198

Full text not available from this repository.

Abstract

This paper introduces a new pattern analysis framework, which enables exact and efficient calculation of probabilities of pattern occurrences in time series and general sequences. Statistics of pattern occurrences in data are formulated in terms of finite automata states, and the state transitions are embedded into a Markov chain. This enables pattern analysis of continuous or discrete sequences generated from hidden Markov models, where occurrences of specific patterns in the Markov state sequence is of interest. Through this new methodology, both the joint and marginal distributions of occurrence probabilities of multiple patterns can be obtained in a conceptually simple and computationally efficient way. A novel sequence segmentation methodology utilizing regular languages as pattern definitions is formulated and application of the proposed framework to real data is demonstrated.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics
Divisions:	Faculty of Science > Statistics
Library of Congress Subject Headings (LCSH):	Pattern recognition systems, Markov processes, Time-series analysis -- Mathematical models, Sequences (Mathematics), Machine theory
Journal or Publication Title:	International Journal of Innovative Computing, Information and Control
Publisher:	I C I C International
ISSN:	1349-4198
Date:	January 2011
Volume:	Volume 7
Number:	Number 1
Page Range:	pp. 407-431
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
URI:	http://wrap.warwick.ac.uk/id/eprint/41598

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item