Reasoning with Imprecise Context Using Improved Dempster-Shafer Theory

C. H. Lyu, Minseuk Choi, Z. Li, H. Youn
{"title":"Reasoning with Imprecise Context Using Improved Dempster-Shafer Theory","authors":"C. H. Lyu, Minseuk Choi, Z. Li, H. Youn","doi":"10.1109/WI-IAT.2010.190","DOIUrl":null,"url":null,"abstract":"In pervasive computing environment the contexts are usually imprecise and incomplete due to unreliable connectivity, user mobility, and resource constraints. In this paper we present an approach based on the Dempster-Shafer Theory (DST) for the reasoning with imprecise context. To solve the two fundamental issues of the DST, computation intensiveness and the Zadeh paradox, we filer out excrescent subsets based on their energy to reduce the number of subsets, and employ the concept of evidence loss and approval degree of evidence in the combining process.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT.2010.190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In pervasive computing environment the contexts are usually imprecise and incomplete due to unreliable connectivity, user mobility, and resource constraints. In this paper we present an approach based on the Dempster-Shafer Theory (DST) for the reasoning with imprecise context. To solve the two fundamental issues of the DST, computation intensiveness and the Zadeh paradox, we filer out excrescent subsets based on their energy to reduce the number of subsets, and employ the concept of evidence loss and approval degree of evidence in the combining process.
基于改进Dempster-Shafer理论的不精确上下文推理
在普适计算环境中,由于不可靠的连接、用户移动性和资源限制,上下文通常是不精确和不完整的。本文提出了一种基于Dempster-Shafer理论(DST)的不精确上下文推理方法。为了解决DST的两个基本问题——计算强度和Zadeh悖论,我们根据子集的能量对多余子集进行过滤以减少子集的数量,并在合并过程中引入证据损失和证据认可程度的概念。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信