Possibilistic conditional independence is in­ vestigated : we propose a definition of this notion similar to the one used in probability theory. The links between independence and no-interactivity are investigated, and proper­ ties of these relations are given. The influ­ ence of the conjunction used to define a con­ ditional measure of possibility is also high­ lighted : we examine three types...

We show that the definition of neighbor in Markov random fields as defined by Besag (1974) when the joint distribution of the sites is not positive is not well-defined. In a random field with finite number of sites we study the conditions under which giving the value at extra sites will change the belief of an agent about one site. Also the conditions under which the information from some sites...

Feature subset-selection has emerged as a useful technique for creating diversity in ensembles – particularly in classification ensembles. In this paper we argue that this diversity needs to be monitored in the creation of the ensemble. We propose an entropy measure of the outputs of the ensemble members as a useful measure of the ensemble diversity. Further, we show that using the associated c...

We examine the relationship between the Cooper-Herskovitz score of a Bayesian network and the conditional entropies of the nodes of the networks conditioned on the probability distributions of their parents. We show that minimizing the conditional entropy of each node of the BNS conditioned on its set of parents amounts to maximization of the CH score. The main result is a lower bound on the si...

Assuming absolute continuity of marginals, we give the distribution for sums of dependent random variables from some class of Archimedean copulas and the marginal distribution functions of all order statistics.We use conditional independence structure of random variables from this class of Archimedean copulas and Laplace transform. Additionally, we present an application of our results to VaR e...

Building access control represents an important application for biometric verification but often requires greater accuracy than can be provided by a single verifier. Even as algorithms continue to improve, poor samples and environmental factors will continue to impact performance in the building environment. We aim to improve verification accuracy by combining decisions from multiple verifiers ...

We prove additivity of the minimal conditional entropy associated with a quantum channel Φ, represent by a completely positive (CP), trace-preserving map, when the infimum of S(γ12)−S(γ1) is restricted to states of the form (I ⊗Φ) ( |ψ〉〈ψ| ) We show that this follows from multiplicativity of the completely bounded norm of Φ considered as a map from L1 → Lp for Lp spaces defined by the Schatten ...

The paper develops a connection between traditional perceptron algorithms and recently introduced herding algorithms. It is shown that both algorithms can be viewed as an application of the perceptron cycling theorem. This connection strengthens some herding results and suggests new (supervised) herding algorithms that, like CRFs or discriminative RBMs, make predictions by conditioning on the i...

This contribution addresses the problem of expressing preferences among nonfunctional properties in a Web Service architecture. In such a context, semantic annotations are needed and added on service declaration and business process in order to select the best available service. These conditional and unconditional preferences are managed using Conditional Preference-Networks (CP-Nets). But in s...

Decomposition is an important property that we exploit in order to render problems more tractable. The decomposability of a problem implies the existence of some “independences” between the variables that are in play in the problem under consideration. In this paper we investigate the decomposability of functions which take values into an Abelian Group. For the problems which involve these type...