.png){kind=icon}
Return
Adaptive pattern classification for symbolic dynamic systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2012.08.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Statistical pattern classification
Symbolic dynamics
Probabilistic finite state automata
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
Cited Papers
Wavelet-based feature extraction using probabilistic finite state automata for pattern classification.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSaveShareSave
View more