Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation
From MaRDI portal
(Redirected from Publication:1761871)
Recommendations
- Dempster-Shafer reasoning in large partially ordered sets: applications in machine learning
- Classic works on the Dempster-Shafer theory of belief functions
- Representing uncertainty on set-valued variables using belief functions
- scientific article; zbMATH DE number 51153
- Evidence-based uncertainty modeling
Cites work
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- scientific article; zbMATH DE number 2209459 (Why is no real title available?)
- A theory of Gaussian belief functions
- Algorithms for Dempster-Shafer theory
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Belief Functions and Cluster Ensembles
- Belief functions on lattices
- Belief functions on real numbers
- Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
- Bi-capacities. I: Definition, Möbius transform and interaction
- Binary join trees for computing marginals in the Shenoy-Shafer architecture
- Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence
- Constructing belief functions from sample data using multinomial confidence regions
- Ensemble clustering in the belief functions framework
- INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
- Inferring consensus weights from pairwise comparison matrices without suitable properties
- Lamarckian genetic algorithms applied to the aggregation of preferences
- ML-KNN: A lazy learning approach to multi-label learning
- Modelling the reliability of paired comparisons
- Multicriteria filtering methods based on concordance and non-disordance principles
- On the plausibility transformation method for translating belief function models to probability models
- Preferences, agreement, consensus -- measuring, aggregation and control --
- Propagating belief functions in qualitative Markov trees
- Representing uncertainty on set-valued variables using belief functions
- Set-based representations of conjunctive and disjunctive knowledge
- The presence of lattice theory in discrete problems of mathematical social sciences. Why.
- The transferable belief model
- Upper and Lower Probabilities Generated by a Random Closed Interval
- Upper and Lower Probabilities Induced by a Multivalued Mapping
Cited in
(14)- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- An improved operator of combination with adapted conflict
- State-of-charge estimation based on theory of evidence and interval analysis with differential evolution optimization
- A generic framework to include belief functions in preference handling and multi-criteria decision
- Representing uncertainty on set-valued variables using belief functions
- Toward credible belief base revision
- A distance for evidential preferences with application to group decision making
- Multiple criteria decision making with reliability of assessment
- Combining sources of evidence with reliability and importance for decision making
- Belief functions on distributive lattices
- Dempster-Shafer reasoning in large partially ordered sets: applications in machine learning
- Geometric views on conflicting mass functions: from distances to angles
- Two-probabilities focused combination in recommender systems
- Representations of uncertainty in AI: beyond probability and possibility
This page was built for publication: Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761871)
