Sciweavers

319 search results - page 11 / 64
» Learning Equivalence Classes of Bayesian Network Structures
Sort
View
UAI
1996
14 years 10 months ago
Learning Bayesian Networks with Local Structure
In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly ...
Nir Friedman, Moisés Goldszmidt
JETAI
1998
110views more  JETAI 1998»
14 years 9 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
CORR
2011
Springer
261views Education» more  CORR 2011»
14 years 4 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
IJAR
2006
89views more  IJAR 2006»
14 years 9 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
IICAI
2003
14 years 11 months ago
Performance Analysis of an Acyclic Genetic approach to Learn Bayesian Network Structure
Abstract. We introduce a new genetic algorithm approach for learning a Bayesian network structure from data. Our method is capable of learning over all node orderings and structure...
Pankaj B. Gupta, Vicki H. Allan