Algorithms for clustering data
Algorithms for clustering data
Dempster's rule of combination is #P-complete (research note)
Artificial Intelligence
Consonant approximation of belief functions
International Journal of Approximate Reasoning
Approximations for efficient computation in the theory of evidence
Artificial Intelligence
Uncertainty-Based Information: Elements of Generalized Information Theory
Uncertainty-Based Information: Elements of Generalized Information Theory
Handling Different Forms of Uncertainty in Regression Analysis: A Fuzzy Belief Structure Approach
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Faithful approximations of belief functions
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Practical uses of belief functions
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
On the Orthogonal Projection of a Belief Function
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Dual Properties of the Relative Belief of Singletons
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Three alternative combinatorial formulations of the theory of evidence
Intelligent Data Analysis - Artificial Intelligence
Geometry of relative plausibility and relative belief of singletons
Annals of Mathematics and Artificial Intelligence
On the relative belief transform
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
A method is proposed for reducing the size of a frame of discernment, in such a way that the loss of information content in a set of belief functions is minimized. This approach allows to compute strong inner and outer approximations which can be combined efficiently using the Fast Möbius Transform algorithm.