Sciweavers

IJAR
2010
113views more  IJAR 2010»
13 years 5 months ago
A geometric view on learning Bayesian network structures
We recall the basic idea of an algebraic approach to learning Bayesian network (BN) structures, namely to represent every BN structure by a certain (uniquely determined) vector, c...
Milan Studený, Jirí Vomlel, Raymond ...
IJAR
2010
152views more  IJAR 2010»
13 years 5 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...
IJAR
2010
91views more  IJAR 2010»
13 years 5 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
IJAR
2010
151views more  IJAR 2010»
13 years 5 months ago
Envisioning uncertainty in geospatial information
Geospatial Reasoning has been an essential aspect of military planning since the invention of cartography. Although maps have always been a focal point for developing situational ...
Kathryn B. Laskey, Edward J. Wright, Paulo Cesar G...
IJAR
2010
130views more  IJAR 2010»
13 years 5 months ago
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...
Tomi Silander, Teemu Roos, Petri Myllymäki
IJAR
2010
70views more  IJAR 2010»
13 years 5 months ago
Granular computing applied to ontologies
Granular Computing is an emerging conceptual and computing paradigm of information processing. A central notion is an information-processing pyramid with different levels of clari...
Silvia Calegari, Davide Ciucci
IJAR
2010
75views more  IJAR 2010»
13 years 5 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...
IJAR
2010
120views more  IJAR 2010»
13 years 5 months ago
Comparison of tightly and loosely coupled decision paradigms in multiagent expedition
Frameworks for cooperative multiagent decision making may be divided into those where each agent is assigned a single variable (SVFs) and those where each agent carries an interna...
Yang Xiang, Franklin Hanshar
IJAR
2010
50views more  IJAR 2010»
13 years 5 months ago
A framework for ontologically-grounded probabilistic matching
Rita Sharma, David Poole, Clinton Smyth