Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Computational Methods for A Mathematical Theory of Evidence

1 references·16 citing·33 second hop

FromToDepth

this work references cited by second hop

References

1965Fuzzy sets67,827 cited

Cited by

1985A method for managing evidential reasoning in a hierarchical hypothesis space399 cited
1987Implementing Dempster's rule for hierarchical evidence285 cited
1993Approximations for efficient computation in the theory of evidence226 cited
1997Approximation algorithms and decision making in the Dempster-Shafer theory of evidence — An empirical study177 cited
1989A computationally efficient approximation of Dempster-Shafer theory176 cited
1990Decision analysis using belief functions162 cited
2008The combination of multiple classifiers using an evidential reasoning approach124 cited
1982Inference procedures under uncertainty for the problem-reduction method112 cited
1990Dempster's rule of combination is #P-complete109 cited
1988Combining the Classification Results of Independent Classifiers Based on the Dempster/Shafer Theory of Evidence105 cited
1992Uncertainty measures for evidential reasoning I: A review102 cited
2005Shedding new light on Zadeh's criticism of Dempster's rule of combination98 cited
2018An approach to assess the value of industrial heritage based on Dempster–Shafer theory89 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

2001

INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH

89 cited

1984Dempster-Shafer Theory87 cited

2020A risk assessment model of a sewer pipeline in an underground utility tunnel based on a Bayesian network80 cited