Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2002.9B.1.017

An Approximate Evidence Combination Scheme for Increased Efficiency  

Lee, Gyesung (Dept.of Computer Science, Dankook University)
Publication Information
The KIPS Transactions:PartB / v.9B, no.1, 2002 , pp. 17-22 More about this Journal
Abstract
A major impediment in using the Dempster-chafer evidence combination scheme is its computational complexity, which in general is exponential since DS scheme allows any subsets over the frame of discernment as focal elements. To avoid this problem, we propose a method called approximate evidence combination scheme. This scheme is applied to a few sample applications and the experiment results are compared with those of VBS. The results show that the approximation scheme achieves a great amount of computational speedup and produces belief values within the range of deviation that the expert allows.
Keywords
evidence combination; uncertaint; Dempster-Shafer scheme;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Lee, G, 'Rule models for the integrated design of knowledge acquisition, reasoning, and knowledge refinement,' The transactions of the Korea Information Processing Society, Vol.3, No.7, pp.908-914, 1996   과학기술학회마을
2 Shenoy, P. P., 'Valuation network representation and solution of asymmetric decision problems,' European journal of operation research, Vol.121, No.3, 2000   DOI   ScienceOn
3 Wang, S. and Valtorata, M., 'On the exponential growth rateof Dempster-Shafer belief functions,' Applications of AI X, pp.15-24, 1994   DOI
4 Zarley, D., 'An evidential reasoning system,' Master thesis, Dept. of Computer Science, The univ. of Kansas, 1988
5 Shafer, G., 'A mathematical theory of evidence,' Princeton University Press, 1976
6 Gordon, J and Shortliffe, E. H., 'A method for managing evidential reasoning in a hierarchical hypothesis space,' AI 26, pp.323-357, 1985   DOI   ScienceOn