[Home ] [Archive]    
Main Menu
Journal Information::
Home::
Archive::
For Authors::
For Reviewers::
Principles of Transparency::
Contact us::
::
Search in website

Advanced Search
..
Committed to

AWT IMAGE

Attribution-NonCommercial
CC BY-NC


AWT IMAGE

Open Access Publishing


AWT IMAGE

Prevent Plagiarism

..
Registered in


..
Statistics
Journal volumes: 17
Journal issues: 34
Articles views: 645775
Articles downloads: 299456

Total authors: 581
Unique authors: 422
Repeated authors: 159
Repeated authors percent: 27

Submitted articles: 368
Accepted articles: 266
Rejected articles: 25
Published articles: 219

Acceptance rate: 72.28
Rejection rate: 6.79

Average Time to Accept: 282 days
Average Time to First Review: 27.2 days
Average Time to Publish: 26.1 days

Last 3 years statistics:
Submitted articles: 77
Accepted articles: 52
Rejected articles: 12
Published articles: 24

Acceptance rate: 67.53
Rejection rate: 15.58

Average Time to Accept: 201 days
Average Time to First Review: 11.4 days
Average Time to Publish: 139.4 days
____
..
:: Volume 7, Issue 2 (3-2011) ::
JSRI 2011, 7(2): 103-120 Back to browse issues page
Taylor Expansion for the Entropy Rate of Hidden Markov Chains
H. Yar 1, Z. Nikooravesh
1- , yari@iust.ac.ir
Abstract:   (3727 Views)

We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate for the entropy rate of hidden Markov chain by matrix algebra and its spectral representation. To do so, we use the Taylor expansion, and calculate some estimates for the first and the second terms, for the entropy rate of the hidden Markov process and its binary version, respectively. For small varepsilon (channel's parameter), the entropy rate has o(varepsilon^2), as a maximum error, when it is calculated by the first term of Taylor expansion and it has  o(varepsilon^3) , as a maximum error, when it is calculated by the second term.

Keywords: Entropy rate, hidden Markov process, Taylor approximation, spectral representation
Full-Text [PDF 214 kb]   (949 Downloads)    
Type of Study: Research | Subject: General
Received: 2016/01/10 | Accepted: 2016/01/10 | Published: 2016/01/10
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA



XML   Persian Abstract   Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Yar H, Nikooravesh Z. Taylor Expansion for the Entropy Rate of Hidden Markov Chains. JSRI 2011; 7 (2) :103-120
URL: http://jsri.srtc.ac.ir/article-1-92-en.html


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 7, Issue 2 (3-2011) Back to browse issues page
مجله‌ی پژوهش‌های آماری ایران Journal of Statistical Research of Iran JSRI
Persian site map - English site map - Created in 0.05 seconds with 42 queries by YEKTAWEB 4645