Robert H. Enders

dblp:18/8860 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 61% Probabilistic and Bayesian machine learning · 39%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
belief functions
0.112009
Semigroup structure of singleton Dempster-Shafer evidence accumulation · IEEE Trans. Inf. Theory 2009
Machine learning › Probabilistic and Bayesian machine learning
evidence accumulation
0.112009
Semigroup structure of singleton Dempster-Shafer evidence accumulation · IEEE Trans. Inf. Theory 2009
Knowledge, reasoning and agents › Knowledge representation and reasoning
uncertainty reasoning
0.112009
Semigroup structure of singleton Dempster-Shafer evidence accumulation · IEEE Trans. Inf. Theory 2009
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.012009
Semigroup structure of singleton Dempster-Shafer evidence accumulation · IEEE Trans. Inf. Theory 2009

Methods — techniques the papers use, named apart from their topics

semigroup theory · 0.1
YearPublicationVenuePosition
2009 Semigroup structure of singleton Dempster-Shafer evidence accumulation
abstract
Dempster-Shafer theory is one of the main tools for reasoning about data obtained from multiple sources, subject to uncertain information. In this work abstract algebraic properties of the Dempster-Shafer set of mass assignments are investigated and compared with the properties of the Bayes set of probabilities. The Bayes set is a special case of the Dempster-Shafer set, where all non-singleton masses are fixed at zero. The language of semigroups is used, as appropriate subsets of the Dempster-Shafer set, including the Bayes set and the singleton Dempster-Shafer set, under either a mild restriction or a slight extension, are semigroups with respect to the Dempster-Shafer evidence combination operation. These two semigroups are shown to be related by a semigroup homomorphism, with elements of the Bayes set acting as images of disjoint subsets of the Dempster-Shafer set. Subsequently, an inverse mapping from the Bayes set onto the set of these subsets is identified and a procedure for computing certain elements of these subsets, acting as subset generators, is obtained. The algebraic relationship between the Dempster-Shafer and Bayes evidence accumulation schemes revealed in the investigation elucidates the role of uncertainty in the Dempster-Shafer theory and enables direct comparison of results of the two analyses.
Andrzej K. Brodzik, Robert H. Enders
IEEE Trans. Inf. Theory2