MAXIMUM ENTROPY ALGORITHMS FOR UNCERTAINTY MEASURES

Hung Tan Nguyen · H. Ichihashi

50 citations0/0 files storedInternational Journal of Uncertainty Fuzziness and Knowledge-Based Systems

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Multi-Criteria Decision Making Bayesian Modeling and Causal Inference Fuzzy Systems and Optimization

Abstract

In decision-making problems when probabilistic information is incomplete (e.g. Nguyen and Walker [1]) as well as in measuring the non-specificity and conflict in the theory of evidence (e.g. Maeda and Ichihashi [2, 3]), one is led to consider the problem of maximizing probabilistic entropy under a functional constraint induced by the available evidence. This paper is devoted specifically to developing computational algorithms for this optimization problem.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 50 citations exist upstream.

Cited by

1996ON THE COMPUTATION OF UNCERTAINTY MEASURE IN DEMPSTER-SHAFER THEORY 2021A new distance-based total uncertainty measure in Dempster-Shafer evidence theory 2020Deng Entropy Weighted Risk Priority Number Model for Failure Mode and Effects Analysis 2020Critique of modified Deng entropies under the evidence theory 2025Measurement uncertainty evaluation with small samples: A review and prospect

Imported from OpenAlex (CC0) — nothing here is generated.