Pages that link to "Item:Q2752131"

The following pages link to Algorithms for Dempster-Shafer theory (Q2752131):

Displaying 14 items.

• A Monte Carlo-based method for the estimation of lower and upper probabilities of events using infinite random sets of indexable type (Q1037867) (← links)
• Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame. (Q1399497) (← links)
• Belief rule-based classification system: extension of FRBCS in belief functions framework (Q1749596) (← links)
• Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation (Q1761871) (← links)
• Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study (Q1809376) (← links)
• Focal points and their implications for Möbius transforms and Dempster-Shafer theory (Q2124186) (← links)
• Depth-bounded belief functions (Q2191247) (← links)
• Inference in directed evidential networks based on the transferable belief model (Q2270405) (← links)
• An evidential similarity-based regression method for the prediction of equipment remaining useful life in presence of incomplete degradation trajectories (Q2328943) (← links)
• Extending uncertainty formalisms to linear constraints and other complex formalisms (Q2379316) (← links)
• Monte Carlo and quasi-Monte Carlo methods for Dempster's rule of combination (Q2671754) (← links)
• Independence and 2-Monotonicity: Nice to Have, Hard to Keep (Q3011952) (← links)
• (Q3200587) (← links)
• Dempster-Shafer Theory: Ηow Constraint Programming Can Help (Q6485252) (← links)