Adaptive pattern classification for symbolic dynamic systems

Yicheng Wen, Kushal Mukherjee, Asok Ray

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


This paper addresses pattern classification in dynamical systems, where the underlying algorithms are formulated in the symbolic domain and the patterns are constructed from symbol strings as probabilistic finite state automata (PFSA) with (possibly) diverse algebraic structures. A combination of Dirichlet and multinomial distributions is used to model the uncertainties due to the (finite-length) string approximation of symbol sequences in both training and testing phases of pattern classification. The classifier algorithm follows the structure of a Bayes model and has been validated on a simulation test bed. The results of numerical simulation are presented for several examples.

Original languageEnglish (US)
Pages (from-to)252-260
Number of pages9
JournalSignal Processing
Issue number1
StatePublished - Jan 2013

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering


Dive into the research topics of 'Adaptive pattern classification for symbolic dynamic systems'. Together they form a unique fingerprint.

Cite this