Data Perturbation for Escaping Local Maxima in Learning (2002)

by Gal Elidan , Matan Ninio , Nir Friedman , Dale Schuurmans
Venue:IN AAAI
Citations:36 - 3 self

Documents Related by Co-Citation

8058 Maximum likelihood from incomplete data via the EM algorithm – A. P. Dempster, N. M. Laird, D. B. Rubin - 1977
1081 A Bayesian method for the induction of probabilistic networks from data – Gregory F. Cooper, Tom Dietterich - 1992
913 Learning Bayesian networks: The combination of knowledge and statistical data – David Heckerman, David M. Chickering - 1995
2863 UCI Repository of machine learning databases [http://www.ics.uci.edu/~mlearn/MLRepository.html – C L Blake, C J Merz - 1998
7069 Probabilistic Reasoning in Intelligent Systems – J Pearl - 1988
8569 Elements of Information Theory – T M Cover, J A Thomas - 1991
94 Deterministic annealing EM algorithm – N Ueda, R Nakano - 1998
766 A View Of The Em Algorithm That Justifies Incremental, Sparse, And Other Variants – Radford Neal, Geoffrey E. Hinton - 1998
98 SMEM Algorithm for Mixture Models – Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Geoffrey E. Hinton - 1999
181 Learning Bayesian network structure from massive datasets: The “sparse candidate” algorithm – Nir Friedman - 1999
248 Deterministic Annealing for Clustering, Compression, Classification, Regression, and Related Optimization Problems – Kenneth Rose - 1998
142 On Convergence Properties of the EM Algorithm for Gaussian Mixtures – Lei Xu, Michael I. Jordan - 1995
159 Learning Bayesian Networks is NP-Complete – David Maxwell Chickering - 1996
220 The Bayesian Structural EM Algorithm – Nir Friedman - 1998
939 The EM Algorithm and Extensions – G J MCLACHLAN, T KRISHNAN - 1996
130 Learning Bayesian Networks is NP-Hard – David Chickering, Dan Geiger, David Heckerman - 1994
184 Theory Refinement on Bayesian Networks – Wray Buntine - 1991
178 Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables – David Maxwell Chickering, David Heckerman - 1997
6 A dynamical trajectory-based methodology for systematically computing multiple optimal solutions of general nonlinear programming problems – J Lee, H Chiang