Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms

DOI10.1016/j.ijar.2005.12.001zbMath1103.68121OpenAlexW1981844345MaRDI QIDQ2506950

Scott A. Ferson, Gang Xiang, Vladik Ya. Kreinovich

Publication date: 10 October 2006

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2005.12.001

zbMATH Keywords

quadratic optimization problem

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (4)

Estimating sample mean under interval uncertainty and constraint on sample variance ⋮ Statistical reasoning with set-valued information: ontic vs. epistemic views ⋮ Rejoinder on ``Statistical reasoning with set-valued information: ontic vs. epistemic views ⋮ Possibilistic risk aversion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outlier detection under interval uncertainty: algorithmic solvability and computational complexity
• Exact bounds on finite populations of interval data
• Numerical Software with Result Verification

This page was built for publication: Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms