Abstract. When merging belief functions, Dempster rule of combination is justified only when sources can be considered as independent. When dependencies are ill-known, it is usual ...
For a presented case, a Bayesian network classifier in essence computes a posterior probability distribution over its class variable. Based upon this distribution, the classifier...
Linda C. van der Gaag, Silja Renooij, Wilma Steene...
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
The Transferable Belief Model is a powerful interpretation of belief function theory where decision making is based on the pignistic transform. Smets has proposed a generalization ...
Most operators for merging multiple knowledge bases (where each is a set of formulae) aim to produce a knowledge base as output that best reflects the information available in the ...
Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from t...
In this paper, a new algebraic representation by the non-Archimedean fields is proposed to model stratified/ranked knowledge bases. The non-Archimedean representation is in the for...
Fuzzy vectors were introduced as a description of imprecise quantities whose uncertainty originates from vagueness, not from a probabilistic model. Support functions are a classica...
We consider the problem of inference from multinomial data with chances θ, subject to the a-priori information that the true parameter vector θ belongs to a known convex polytope...