See this document in CiteSeerX!

Parameter Revision Techniques for Bayesian Networks with Hidden Variables: An Experimental Comparison (1997)  (Make Corrections)  
Sowmya Ramachandran, Raymond J. Mooney



  Home/Search   Context   Related

 
View or download:
utexas.edu/pub/moo...submitted97.ps.Z
utexas.edu/pub/moo...submitted97.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  jprc.com/Artificial_Intel...index (more)
From:  jprc.com/Artificial_Intel...index
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Learning Bayesian networks inductively in the presence of hidden variables is still an open problem. Even the simpler task of learning just the conditional probabilities on a Bayesian network with hidden variables is not completely solved. In this paper, we present an approach that learns the parameters of a Bayesian network composed of noisy-or and noisy-and nodes by using a gradient descent back-propagation approach similar to that used to train neural networks. For the task of causal... (Update)

Similar documents based on text:   More   All
0.2:   The Information Bottleneck EM Algorithm - Elidan, Friedman (2003)   (Correct)
0.2:   Backward Causation, Hidden Variables and the Meaning of Completeness - Price (2000)   (Correct)
0.2:   Revising Bayesian Network Parameters Using Backpropagation - Sowmya Ramachandran (1996)   (Correct)

BibTeX entry:   (Update)

@misc{ ramachandran-parameter,
  author = "Sowmya Ramachandran and Raymond J. Mooney",
  title = "Parameter Revision Techniques for Bayesian Networks with Hidden Variables:
    An Experimental Comparison",
  url = "citeseer.ist.psu.edu/ramachandran97parameter.html" }
Citations (may not include all citations):
2528   Maximum likelihood from incomplete data via the EM algorithm (context) - Dempster, Laird et al. - 1977
1543   Probabilistic Reasoning in Intelligent Systems: Networks of .. (context) - Pearl - 1988
1359   Induction of decision trees (context) - Quinlan - 1986
493   Modeling by shortest data description (context) - Rissanen - 1978
351   Learning Bayesian networks: The combination of knowledge and.. - Heckerman, Geiger et al. - 1994
349   Knowledge acquisition via incremental conceptual clustering (context) - Fisher - 1987
303   Stochastic relaxation (context) - Geman, Geman - 1984
130   Refinement of approximate domain theories by knowledge-based.. - Towell, Shavlik et al. - 1990
121   An analysis of Bayesian classifiers - Langley, Iba et al. - 1992
118   Sequential updating of conditional probabilities on directed.. (context) - Spiegelhalter, Lauritzen - 1990
111   Connectionist learning of belief networks (context) - Neal - 1992
107   The EM algorithm for graphical association models with missi.. (context) - Lauritzen - 1995
101   Explorations in Parallel Distributed Processing: A Handbook .. (context) - McClelland, Rumelhart - 1988
89   Changing the rules: A comprehensive approach to theory refin.. (context) - Ourston, Mooney - 1990
84   Theory refinement on Bayesian networks - Buntine - 1991

[Article contains additional citations not shown here]

Documents on the same site (http://www.cora.jprc.com/Artificial_Intelligence/Machine_Learning/Neural_Networks/index.html):   More
Breaking Rotational Symmetry in a Self-Organizing.. - Riesenhuber, Bauer, al. (1997)   (Correct)
Unsupervised Learning by Convex and Conic Coding - Lee, Seung (1997)   (Correct)
Efficient Indexing for Object Recognition Using Large.. - Stevens, Anderson.. (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC