A stopping rule for symbolic dynamic filtering

Yicheng Wen; Asok Ray

doi:10.1016/j.aml.2010.04.048

A stopping rule for symbolic dynamic filtering

Yicheng Wen, Asok Ray

Mechanical Engineering

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

One of the key issues in symbolic dynamic filtering (SDF) is how to obtain a lower bound on the length of symbol blocks for computing the state probability vectors of probabilistic finite-state automata (PFSA). Having specified an absolute error bound at a confidence level, this short work formulates a stopping rule by making use of Markov chain Monte Carlo (MCMC) computations.

Original language	English (US)
Pages (from-to)	1125-1128
Number of pages	4
Journal	Applied Mathematics Letters
Volume	23
Issue number	9
DOIs	https://doi.org/10.1016/j.aml.2010.04.048
State	Published - Sep 2010

All Science Journal Classification (ASJC) codes

Applied Mathematics

Access to Document

10.1016/j.aml.2010.04.048

Cite this

@article{d0b7e3ccdfd34d93a0a437aa6c6bfcf5,

title = "A stopping rule for symbolic dynamic filtering",

abstract = "One of the key issues in symbolic dynamic filtering (SDF) is how to obtain a lower bound on the length of symbol blocks for computing the state probability vectors of probabilistic finite-state automata (PFSA). Having specified an absolute error bound at a confidence level, this short work formulates a stopping rule by making use of Markov chain Monte Carlo (MCMC) computations.",

author = "Yicheng Wen and Asok Ray",

year = "2010",

month = sep,

doi = "10.1016/j.aml.2010.04.048",

language = "English (US)",

volume = "23",

pages = "1125--1128",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd",

number = "9",

}

TY - JOUR

T1 - A stopping rule for symbolic dynamic filtering

AU - Wen, Yicheng

AU - Ray, Asok

PY - 2010/9

Y1 - 2010/9

N2 - One of the key issues in symbolic dynamic filtering (SDF) is how to obtain a lower bound on the length of symbol blocks for computing the state probability vectors of probabilistic finite-state automata (PFSA). Having specified an absolute error bound at a confidence level, this short work formulates a stopping rule by making use of Markov chain Monte Carlo (MCMC) computations.

AB - One of the key issues in symbolic dynamic filtering (SDF) is how to obtain a lower bound on the length of symbol blocks for computing the state probability vectors of probabilistic finite-state automata (PFSA). Having specified an absolute error bound at a confidence level, this short work formulates a stopping rule by making use of Markov chain Monte Carlo (MCMC) computations.

UR - http://www.scopus.com/inward/record.url?scp=77953688291&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77953688291&partnerID=8YFLogxK

U2 - 10.1016/j.aml.2010.04.048

DO - 10.1016/j.aml.2010.04.048

M3 - Article

AN - SCOPUS:77953688291

SN - 0893-9659

VL - 23

SP - 1125

EP - 1128

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 9

ER -

A stopping rule for symbolic dynamic filtering

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this