In recent years, there is a growing interest in learning Bayesian networks with continuous variables. Learning the structure of such networks is a computationally expensive procedure, which limits most applications to parameter learning. This problem is even more acute when learning networks with hidden variables. We present a general method for significantly speeding the structure search algorithm for continuous variable networks with common parametric distributions. Importantly, our method facilitates the addition of new hidden variables into the network structure efficiently. We demonstrate the method on several data sets, both for learning structure on fully observable data, and for introducing new hidden variables during structure search.
"Ideal Parent" Structure Learning for Continuous Variable Networks
I. Nachman,G. Elidan,N. Friedman
Published 2004 in Conference on Uncertainty in Artificial Intelligence
ABSTRACT
PUBLICATION RECORD
- Publication year
2004
- Venue
Conference on Uncertainty in Artificial Intelligence
- Publication date
2004-07-07
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-19 of 19 references · Page 1 of 1
CITED BY
Showing 1-17 of 17 citing papers · Page 1 of 1