Under Interval and Fuzzy Uncertainty, Symmetric Markov Chains Are More Difficult to Predict

R. Araiza, G. Xiang, O. Kosheleva, D. Škulj
{"title":"Under Interval and Fuzzy Uncertainty, Symmetric Markov Chains Are More Difficult to Predict","authors":"R. Araiza, G. Xiang, O. Kosheleva, D. Škulj","doi":"10.1109/NAFIPS.2007.383895","DOIUrl":null,"url":null,"abstract":"Markov chains are an important tool for solving practical problems. In particular, Markov chains have been successfully applied in bioinformatics. Traditional statistical tools for processing Markov chains assume that we know the exact probabilities pij of a transition from the state i to the state j. In reality, we often only know these transition probabilities with interval (or fuzzy) uncertainty. We start the paper with a brief reminder of how the Markov chain formulas can be extended to the cases of such interval and fuzzy uncertainty. In some practical situations, there is another restriction on the Markov chain-that this Markov chain is symmetric in the sense that for every two states i and j, the probability of transitioning from i to j is the same as the probability of transitioning from j to i: pij = pji. In general, symmetry assumptions simplify computations. In this paper, we show that for Markov chains under interval and fuzzy uncertainty, symmetry has the opposite effect: it makes the computational problems more difficult.","PeriodicalId":292853,"journal":{"name":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAFIPS.2007.383895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Markov chains are an important tool for solving practical problems. In particular, Markov chains have been successfully applied in bioinformatics. Traditional statistical tools for processing Markov chains assume that we know the exact probabilities pij of a transition from the state i to the state j. In reality, we often only know these transition probabilities with interval (or fuzzy) uncertainty. We start the paper with a brief reminder of how the Markov chain formulas can be extended to the cases of such interval and fuzzy uncertainty. In some practical situations, there is another restriction on the Markov chain-that this Markov chain is symmetric in the sense that for every two states i and j, the probability of transitioning from i to j is the same as the probability of transitioning from j to i: pij = pji. In general, symmetry assumptions simplify computations. In this paper, we show that for Markov chains under interval and fuzzy uncertainty, symmetry has the opposite effect: it makes the computational problems more difficult.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在区间不确定性和模糊不确定性下,对称马尔可夫链较难预测
马尔可夫链是解决实际问题的重要工具。特别是马尔可夫链已成功地应用于生物信息学。处理马尔可夫链的传统统计工具假设我们知道从状态i到状态j的转换的确切概率pij。在现实中,我们通常只知道这些具有区间(或模糊)不确定性的转换概率。本文首先简要介绍了马尔可夫链公式如何推广到这种区间和模糊不确定性的情况。在某些实际情况下,马尔可夫链还有另一个限制条件——这个马尔可夫链是对称的,即对于每两个状态i和j,从i到j的转换概率与从j到i的转换概率相同:pij = pji。一般来说,对称假设简化了计算。在本文中,我们证明了对于区间和模糊不确定性下的马尔可夫链,对称具有相反的效果:它使计算问题变得更加困难。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Neighbourhood Sets based on Web Usage Mining Design an Intelligent Neural-Fuzzy Controller for Hybrid Motorcycle Fuzzy ROI Based 2-D/3-D Registration for Kinetic Analysis after Anterior Cruciate Ligament Reconstruction About the Division Operator in a Possibilistic Database Framework A Fast Structural Optimization Technique for IDS Modeling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1