.png){kind=icon}
返回
Adaptive pattern classification for symbolic dynamic systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2012.08.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Statistical pattern classification
Symbolic dynamics
Probabilistic finite state automata
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
Wavelet-based feature extraction using probabilistic finite state automata for pattern classification.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏分享收藏
查看更多内容