Search results for "conditional probability"

Probabilistic semantics for categorical syllogisms of Figure II

2018

A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of \(\bar{P}|S\) from the premise set \(\{M|P,\bar{M}|S\}\) is not informative, we add \(p(S|(S \vee P))>0\) as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the…

Automated uncertainty quantification analysis using a system model and data

2015

International audience; Understanding the sources of, and quantifying the magnitude of, uncertainty can improve decision-making and, thereby, make manufacturing systems more efficient. Achieving this goal requires knowledge in two separate domains: data science and manufacturing. In this paper, we focus on quantifying uncertainty, usually called uncertainty quantification (UQ). More specifically, we propose a methodology to perform UQ automatically using Bayesian networks (BN) constructed from three types of sources: a descriptive system model, physics-based mathematical models, and data. The system model is a high-level model describing the system and its parameters; we develop this model …

Modeling user preferences in content-based image retrieval: A novel attempt to bridge the semantic gap

2015

This paper is concerned with content-based image retrieval from a stochastic point of view. The semantic gap problem is addressed in two ways. First, a dimensional reduction is applied using the (pre-calculated) distances among images. The dimension of the reduced vector is the number of preferences that we allow the user to choose from, in this case, three levels. Second, the conditional probability distribution of the random user preference, given this reduced feature vector, is modeled using a proportional odds model. A new model is fitted at each iteration. The score used to rank the image database is based on the estimated probability function of the random preference. Additionally, so…

A principled approach to network-based classification and data representation

2013

Measures of similarity are fundamental in pattern recognition and data mining. Typically the Euclidean metric is used in this context, weighting all variables equally and therefore assuming equal relevance, which is very rare in real applications. In contrast, given an estimate of a conditional density function, the Fisher information calculated in primary data space implicitly measures the relevance of variables in a principled way by reference to auxiliary data such as class labels. This paper proposes a framework that uses a distance metric based on Fisher information to construct similarity networks that achieve a more informative and principled representation of data. The framework ena…

Assessment of qualitative judgements for conditional events in expert systems

1991

From imprecise probability assessments to conditional probabilities with quasi additive classes of conditioning events

2012

In this paper, starting from a generalized coherent (i.e. avoiding uniform loss) intervalvalued probability assessment on a finite family of conditional events, we construct conditional probabilities with quasi additive classes of conditioning events which are consistent with the given initial assessment. Quasi additivity assures coherence for the obtained conditional probabilities. In order to reach our goal we define a finite sequence of conditional probabilities by exploiting some theoretical results on g-coherence. In particular, we use solutions of a finite sequence of linear systems.

Probabilistic Logic under Coherence: Complexity and Algorithms

2005

In previous work [V. Biazzo, A. Gilio, T. Lukasiewicz and G. Sanfilippo, Probabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P, Journal of Applied Non-Classical Logics 12(2) (2002) 189---213.], we have explored the relationship between probabilistic reasoning under coherence and model-theoretic probabilistic reasoning. In particular, we have shown that the notions of g-coherence and of g-coherent entailment in probabilistic reasoning under coherence can be expressed by combining notions in model-theoretic probabilistic reasoning with concepts from default reasoning. In this paper, we continue this line of research. Based on the above sem…

Bayesian Hierarchical Models for Random Routes in Finite Populations

1996

In many practical situations involving sampling from finite populations, it is not possible (or it is prohibitely expensive) to access, or to even produce, a listing of all of the units in the population. In these situations, inferences can not be based on random samples from the population. Random routes are widely used procedures to collect data in absence of well defined sampling frames, and they usually have either been improperly analyzed as random samples, or entirely ignored as useless. We present here a Bayesian analysis of random routes that incorporates the information provided but carefully takes into account the non- randomness in the selection of the units.

Some results on generalized coherence of conditional probability bounds

2003

Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional probability bounds. Our notion of g-coherence is equivalent to the 'avoiding uniform loss' property for lower and upper probabilities (a la Walley). Moreover, given a g-coherent imprecise assessment by our algorithms we can correct it obtaining the associated coherent assessment (in the sense of Walley and Williams). As is well known, the problems of checking g-coherence and propagating tight g-coherent intervals are NP and FP^NP complete, respectively, and thus NP-hard. Two notions which may be helpful to reduce co…

Unawareness, Priors and Posteriors

2008

Abstract. This note contains first thoughts on awareness of unawareness in a simple dynamic context where a decision situation is repeated over time. The main consequence of increasing awareness is that the model the decision maker uses, and the prior which it contains, becomes richer over time. The decision maker is prepared to this change, and we show that if a projection-consistency axiom is satisfied unawareness does not affect the value of her estimate of a payoff-relevant conditional probability (although it may weaken confidence in such estimate). Probability-zero events however pose a challenge to this axiom, and if that fails, even estimate values will be different if the decision …