摘要
提出了一种近似计算的方法，该方法改进了Ｔｅｓｓｅｍ提出的方法，进一步，基于Ｐｉｇｎｉｓｔｉｃ概率和信任函数对证据的解释，对这两种方法进行了比较。
The aim of approximation computation is to solve the efficiency problem of evidence theo-ry. In this paper we present an approximation method which improves Tessem's approximationmethod.Further,based on the explanation of pignistic probability and belief function about evi-dences,we compare our method with Tessem's method .
出处
《吉林大学自然科学学报》
CAS
CSCD
1995年第1期28-32,共5页
Acta Scientiarum Naturalium Universitatis Jilinensis
基金
国家教委博士点和国家"863"高技术项目基金
关键词
证据理论
近似计算
人工智能
theory of evidence,Dempster's rule of combination,approximation computation
