Optimal Reinsertion: A new search operator for accelerated and more accurate Bayesian network structure learning

Proceedings, Twentieth International Conference on Machine Learning

Volumn 2, Issue , 2003, Pages 552-559

  Moore, Andrew ^a   Wong, Weng Keen ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA REDUCTION; GRAPH THEORY; LEARNING ALGORITHMS; OPTIMIZATION; PROBABILITY;

BAYESIAN NETWORK STRUCTURE; CONDITIONAL PROBABILITY; DATASETS; OPTIMAL REINSERTION;

LEARNING SYSTEMS;

EID: 1942452317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Beinlich, I. A., Suermondt, H. J., Chavez, R. M., & Cooper, G. F. (1989). The alarm monitoring system: A case study with two probabilistic inference techniques for belief networks. Proc. Second European Conference on AI and Medicine (pp. 247-256). Berlin: Springer-Verlag.
2. Blake, C., & Merz; C. (1998). UCI Repository of machine learning databases, http://www.ics.uci.edu/~mlearn/MLRepository.html.
3. Buntine, W. (1991). Theory Refinement on Bayesian Networks. Proceedings of the Seventh Conference on UAI (pp. 52-60).
4. Chickering, D. M. (1996a). Learning Bayesian networks is NP-Complete. In D. Fisher and H. Lenz (Eds.), Learning from data: Artificial intelligence and statistics v, 121-130. Springer-Verlag.
5. Chickering, D. M. (1996b). Learning equivalence classes of Bayesian network structures. Proceedings of the Twelfth Conference on UAI, Portland, OR (pp. 150-157). Morgan Kaufmann.
6. Cooper, G., & Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9, 309-347.
7. Elidan, G., Ninio, M., Friedman, N., & Schuurmans, D. (2002). Data perturbation for escaping local maxima in learning. Proceedings of AAAI-02 (pp. 132-139).
8. Friedman, N. (1997). Learning belief networks in the presence of missing values and hidden variables. Proc. 14th ICML(pp. 125-133). Morgan Kaufmann.
9. Friedman, N., & Goldszmidt, M. (1997). Sequential update of Bayesian network structure. Proceedings of the Thirteenth Conference on UAI(pp. 165-174).
10. Friedman, N., Nachman, I., & Peér, D. (1999). Learning Bayesian network structure from massive datasets: The "sparse candidate" algorithm. Proceedings of the Fifteenth Conference on UAI (pp. 206-215).
11. Heckerman, D., Geiger, D., & Chickering, D. M. (1995). Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 20, 197-243.
12. Hulten, G., & Domingos, P. (2002). Mining complex models from arbitrarily large databases in constant time. Proc. 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
13. Kaelbling, L. P. (1990). Learning in Embedded Systems. PhD. Thesis; Technical Report No. TR-90-04). Stanford University, Department of Computer Science.
14. Maron, O., & Moore, A. (1993). Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation. Advances in NIPS 6. Morgan Kaufmann.
15. Moore, A. W., & Lee, M. S. (1998). Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets. JAIR, 8, 67-91.
16. Moore, A. W., & Schneider, J. (2002). Real-valued All-Dimensions search: Low-overhead rapid searching over subsets of attributes. Conference on UAI (pp. 360-369).
17. Nichol, R. C., Collins, C. A., & Lumsden, S. L. (2000). The Edinburgh/Durham Southern Galaxy Catalogue -IX. The Galaxy Catalogue, http://xxx.lanl.gov/abs/astro-ph/0008184.
18. Pelleg, D., & Moore, A. W. (2002). Using Tarjan's Red Rule for Fast Dependency Tree Construction. NIPS 15. Morgan Kaufmann.
19. Schwanz, G. (1979). Estimating the dimensions of a model. Annals of Statistics, 6, 461-464.
20. Xiang, Y., Wong, S., & Cereone, N. (1997). A microscopic study of minimum entropy search in learning decomposable markov networks. Machine Learning, 26, 65-92.