Efficient Markov network structure discovery using independence tests

Proceedings of the Sixth SIAM International Conference on Data Mining

Volumn 2006, Issue , 2006, Pages 141-152

  Bromberg, Facundo ^a   Margaritis, Dimitris ^a   Honavar, Vasant ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DATA REDUCTION; LEARNING SYSTEMS; OPTIMAL CONTROL SYSTEMS; STATISTICAL METHODS; TESTING; THEOREM PROVING;

BAYESIAN NETWORKS; DISCRETE DATA; GROW-SHRINK ALGORITHM; MARKOV NETWORK STRUCTURE;

MARKOV PROCESSES;

EID: 33745441891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972764.13     Document Type: Conference Paper

References (21)

1. Alan Agresti. Categorical Data Analysis. Wiley, 2nd edition, 2002.
2. J. Besag, J. York, and A. Mollie. Bayesian image restoration with two applications in spatial statistics. Annals of the Institute of Statistical Mathematics, 43:1-59, 1991.
3. Wray L. Buntine. Operations for learning with graphical models. JAIR, 2:159-225, 1994.
4. C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14(3):462- 467, May 1968.
5. 2 tests. Biometrics, 10:417-451, 1954.
6. N. Friedman, M. Linial, I. Nachman, and D. Pe'er. Using Bayesian networks to analyze expression data. Computational Biology, 7:601-620, 2000.
7. S. Geman and D. Genian. Stochastic relaxation, gibbs distributions, and the bayesian relation of images. PAMI '84, 6:721-741, 1984.
8. D. Heckerman. A tutorial on learning Bayesian networks. Technical Report MSR-TR-95-06, Microsoft Research, 1995.
9. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 1995.
10. S. Hettich and S. D. Bay. The UCI KDD archive [http://kdd.ics.uci.edu]. Irvine, CA: University of California, Department of Information and Computer Science., 1999.
11. R. Hofmann and V. Tresp. Nonlinear Markov networks for continuous variables. In NIPS '98, volume 10, pages 521-529, 1998.
12. Michael Isard. Pampas: Real-valued graphical models for computer vision. In CVPR '03, volume 1, pages 613-620, 2003.
13. D. Koller and M. Sahami. Toward optimal feature selection. In International Conference on Machine Learning, pages 284-292, 1996.
14. W. Lam and F. Bacchus. Learning Bayesian belief networks: an approach based on the MDL principle. Computational Intelligence, 10:269-293, 1994.
15. D. Margaritis and S. Thrun. Bayesian network induction via local neighborhoods. In S. A. Solla, T.K. Leen, and K.-R. Müller, editors, Advances in Neural Information Processing Systems 12, pages 505-511. MIT Press, 2000.
16. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., 1988.
17. George Rebane and Judea Pearl. The recovery of causal poly-trees from statistical data. In L. N. Kanal, T. S. Levitt, and J. F. Lemmer, editors, Uncertainty in Artificial Intelligence 3, pages 175-182, Amsterdam, 1989. North-Holland.
18. D. W. Scott. Multivariate Density Estimation. Wiley series in probability and mathematical statistics. John Wiley & Sons, 1992.
19. Shashi Shekhar, Pusheng Zhang, Yan Huang, and Ranga Raju Vatsavai. Trends in Spatial Data Mining, chapter 19, pages 357-379. AAAI Press / The MIT Press, 2004.
20. Peter Spirtes, Clark Glymour, and Richard Scheines. Causation, Prediction, and Search. Adaptive Computation and Machine Learning Series. MIT Press, 2nd edition, January 2000.
21. Nathan Srebro and David Karger. Learning Markov networks: Maximum bounded tree-width graphs. In ACM-SIAM Symposium on Discrete Algorithms, 2001.