Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Assumptions, beliefs and probabilities
Artificial Intelligence
Artificial Intelligence
A generalization of the algorithm of Heidtmann to non-monotone formulas
Journal of Computational and Applied Mathematics
Machine Learning - Special issue on learning with probabilistic representations
Information Algebras: Generic Structures for Inference
Information Algebras: Generic Structures for Inference
Pairwise classifier combination using belief functions
Pattern Recognition Letters
Uncertain information: Random variables in graded semilattices
International Journal of Approximate Reasoning
An algebraic theory for statistical information based on the theory of hints
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning
Decision making in the TBM: the necessity of the pignistic transformation
International Journal of Approximate Reasoning
Practical uses of belief functions
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Classification Using Belief Functions: Relationship Between Case-Based and Model-Based Approaches
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A neural network classifier based on Dempster-Shafer theory
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
The impact of diversity on the accuracy of evidential classifier ensembles
International Journal of Approximate Reasoning
The conjunctive combination of interval-valued belief structures from dependent sources
International Journal of Approximate Reasoning
Hi-index | 0.00 |
A model and method are proposed for dealing with noisy and dependent features in classification problems. The knowledge base consists of uncertain logical rules forming a probabilistic argumentation system. Assumption-based reasoning is the inference mechanism that is used to derive information about the correct class of the object. Given a hypothesis regarding the correct class, the system provides a symbolic expression of the arguments for that hypothesis as a logical disjunctive normal form. These arguments turn into degrees of support for the hypothesis when numerical weights are assigned to them, thereby creating a support function on the set of possible classes. Since a support function is a belief function, the pignistic transformation is then applied to the support function and the object is placed into the class with maximal pignistic probability.