124 citations · 270 across the 6 of their papers we have counts for
6 papers
Partially Specified Belief Functions
Serafin Moral, Luis M. de Campos
This paper presents a procedure to determine a complete belief function from the known values of belief for some of the subsets of the frame of discerment. The method is based on t…
Independence Concepts for Convex Sets of Probabilities
Luis M. de Campos, Serafin Moral
In this paper we study different concepts of independence for convex sets of probabilities. There will be two basic ideas for independence. The first is irrelevance. Two variables…
An Algorithm for Finding Minimum d-Separating Sets in Belief Networks
Silvia Acid, Luis M. de Campos
The criterion commonly used in directed acyclic graphs (dags) for testing graphical independence is the well-known d-separation criterion. It allows us to build graphical represent…
Algorithms for Learning Decomposable Models and Chordal Graphs
Luis M. de Campos, Juan F. Huete
Decomposable dependency models and their graphical counterparts, i.e., chordal graphs, possess a number of interesting and useful properties. On the basis of two characterizations…
Query Expansion in Information Retrieval Systems using a Bayesian Network-Based Thesaurus
Luis M. de Campos, Juan M. Fernandez-Luna, Juan F. Huete
Information Retrieval (IR) is concerned with the identification of documents in a collection that are relevant to a given information need, usually represented as a query containin…
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
S. Acid, L. M. de Campos
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on ind…