English
Related papers

Related papers: Multiscale probability transformation of basic pro…

200 papers

We develop potential theory including a Bernstein-Walsh type estimate for functions of the form $p(z)q(f(z))$ where $p,q$ are polynomials and $f$ is holomorphic. Such functions arise in the study of certain ensembles of probability measures…

Classical Analysis and ODEs · Mathematics 2015-10-30 T. Bloom , N. Levenberg , V. Totik , F. Wielonsky

We define a new notion of conditional belief, which plays the same role for Dempster-Shafer belief functions as conditional probability does for probability functions. Our definition is different from the standard definition given by…

Artificial Intelligence · Computer Science 2013-04-05 Ronald Fagin , Joseph Y. Halpern

This paper studies decision making for Walley's partially consonant belief functions (pcb). In a pcb, the set of foci are partitioned. Within each partition, the foci are nested. The pcb class includes probability functions and possibility…

Artificial Intelligence · Computer Science 2012-12-12 Phan H. Giang , Prakash P. Shenoy

The AGM theory of belief revision has become an important paradigm for investigating rational belief changes. Unfortunately, researchers working in this paradigm have restricted much of their attention to rather simple representations of…

Artificial Intelligence · Computer Science 2013-01-30 Frans Voorbraak

The present paper studies a large class of temperature dependent probability distributions and shows that entropy and energy can be defined in such a way that these probability distributions are the equilibrium states of a generalized…

Statistical Mechanics · Physics 2015-06-24 Jan Naudts

The Dempster-Shafer theory of evidence has been used intensively to deal with uncertainty in knowledge-based systems. However the representation of uncertain relationships between evidence and hypothesis groups (heuristic knowledge) is…

Artificial Intelligence · Computer Science 2013-03-25 Weiru Liu , John G. Hughes , Michael F. McTear

Generalising well in supervised learning tasks relies on correctly extrapolating the training data to a large region of the input space. One way to achieve this is to constrain the predictions to be invariant to transformations on the input…

Machine Learning · Computer Science 2018-08-17 Mark van der Wilk , Matthias Bauer , ST John , James Hensman

Dempster-Shafer evidence theory has been widely used in various fields of applications, because of the flexibility and effectiveness in modeling uncertainties without prior information. Besides, it has been proven that the quantum theory…

Artificial Intelligence · Computer Science 2018-05-01 Fuyuan Xiao

We formulate Dempster Shafer Belief functions in terms of Propositional Logic using the implicit notion of provability underlying Dempster Shafer Theory. Given a set of propositional clauses, assigning weights to certain propositional…

Artificial Intelligence · Computer Science 2013-04-08 Gregory M. Provan

In this paper, we analyze the relationship between probability and Spohn's theory for representation of uncertain beliefs. Using the intuitive idea that the more probable a proposition is, the more believable it is, we study transformations…

Artificial Intelligence · Computer Science 2013-01-30 Phan H. Giang , Prakash P. Shenoy

On the basis of the deformed series in quantum calculus, we generalize the partition function and the mass exponent of a multifractal, as well as the average of a random variable distributed over self-similar set. For the partition…

Statistical Mechanics · Physics 2015-05-18 Alexander Olemskoi , Irina Shuda , Vadim Borisyuk

We give an axiomatization of confidence transfer - a known conditioning scheme - from the perspective of expectation-based inference in the sense of Gardenfors and Makinson. Then, we use the notion of belief independence to "filter out"…

Artificial Intelligence · Computer Science 2013-02-28 Yen-Teh Hsia

Posterior probabilistic statistical inference without priors is an important but so far elusive goal. Fisher's fiducial inference, Dempster-Shafer theory of belief functions, and Bayesian inference with default priors are attempts to…

Statistics Theory · Mathematics 2013-03-26 Ryan Martin , Chuanhai Liu

The problem of belief tracking in the presence of stochastic actions and observations is pervasive and yet computationally intractable. In this work we show however that probabilistic beliefs can be maintained in factored form exactly and…

Artificial Intelligence · Computer Science 2019-10-01 Blai Bonet , Hector Geffner

Information fusion is an advanced research area which can assist decision makers in enhancing their decisions. This paper aims at designing a new multi-layer framework that can support the process of performing decisions from the obtained…

Artificial Intelligence · Computer Science 2015-02-24 Tamer M. Abo Neama , Ismail A. Ismail , Tarek S. Sobh , M. Zaki

Dempster-Shafer Theory (DST) generalizes Bayesian probability theory, offering useful additional information, but suffers from a much higher computational burden. A lot of work has been done to reduce the time complexity of information…

Discrete Mathematics · Computer Science 2021-01-12 Maxime Chaveroche , Franck Davoine , Véronique Cherfaoui

The problem of assigning probabilities when little is known is analized in the case where the quanities of interest are physical observables, i.e. can be measured and their values expressed by numbers. It is pointed out that the assignment…

Data Analysis, Statistics and Probability · Physics 2012-08-29 Vesselin I. Dimitrov

Belief function theory provides a flexible way to combine information provided by different sources. This combination is usually followed by a decision making which can be handled by a range of decision rules. Some rules help to choose the…

Artificial Intelligence · Computer Science 2015-01-29 Amira Essaid , Arnaud Martin , Grégory Smits , Boutheina Ben Yaghlane

Dempster's rule is a fundamental tool for combining belief functions from distinct and reliable sources. However, its intersection-based semantics imposes strong structural restrictions, which limits its flexibility in handling complex…

Artificial Intelligence · Computer Science 2026-05-19 Qianli Zhou , Ye Cui , Zhen Li , Witold Pedrycz , Yong Deng

We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our…

Discrete Mathematics · Computer Science 2008-11-21 Michel Grabisch