Sciweavers

26 search results - page 2 / 6
» Learning the Bayesian Network Structure: Dirichlet Prior vs ...
Sort
View
SAC
2009
ACM
13 years 11 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
CEC
2010
IEEE
13 years 5 months ago
Two novel Ant Colony Optimization approaches for Bayesian network structure learning
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
Yanghui Wu, John A. W. McCall, David W. Corne
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
13 years 10 months ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park
UAI
2001
13 years 6 months ago
A Bayesian Multiresolution Independence Test for Continuous Variables
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...
Dimitris Margaritis, Sebastian Thrun
AMAI
2005
Springer
13 years 4 months ago
Robust inference of trees
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
Marco Zaffalon, Marcus Hutter