SZodixStudyAcademic Library

Dashboard Shelves Open access My library Inbox Notes Write Learn Alerts

More

Ask your library Notifications Quick cite Review

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Approximations for efficient computation in the theory of evidence · Study

ArticleShelves

ArticleApproximations for efficient computation in the theory of evidence

Bj∅rnar Tessem1993

Article1993

Approximations for efficient computation in the theory of evidence

Bj∅rnar Tessem

226 citations·0/0 files stored·Artificial Intelligence

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 Logic, Reasoning, and Knowledge Bayesian Modeling and Causal Inference

Abstract

No abstract was published for this record.

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 — 226 citations exist upstream.

References

1965Fuzzy sets 1985A method for managing evidential reasoning in a hierarchical hypothesis space 2008Computational Methods for A Mathematical Theory of Evidence 1985A NOTE ON MEASURES OF SPECIFICITY FOR FUZZY SETS 1987Implementing Dempster's rule for hierarchical evidence

Cited by

1997Approximation algorithms and decision making in the Dempster-Shafer theory of evidence — An empirical study 2008A Geometric Approach to the Theory of Evidence 2022A survey: Optimization and applications of evidence fusion algorithm based on Dempster–Shafer theory 2016Belief Interval-Based Distance Measures in the Theory of Belief Functions 2020CED: A Distance for Complex Mass Functions 2013How to preserve the conflict as an alarm in the combination of belief functions?2001INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH 2000Algorithms for Dempster-Shafer Theory

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

1990Consonant approximations of belief functionsarticle · 3 shared references 1986On the unicity of dempster rule of combinationarticle · 3 shared references 1990Dempster's rule of combination is #P-completearticle · 3 shared references 2000Algorithms for Dempster-Shafer Theorychapter · 3 shared references 1990Evidence accumulation using binary frames of discernment for verification visionarticle · 3 shared references 1987Implementing Dempster's rule for hierarchical evidencearticle · 2 shared references

Details

Year1993

Typearticle

Published1993-06-01

VenueArtificial Intelligence

ISSN-L0004-3702

Languageen

Citations226

Files0 public / 0

ShelfMulti-Criteria Decision Making

Identifiers

doi10.1016/0004-3702(93)90072-j

openalex_workW2012821550

Links

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