Learning Markov network structure using few independence tests

Society for Industrial and Applied Mathematics - 8th SIAM International Conference on Data Mining 2008, Proceedings in Applied Mathematics 130

Volumn 2, Issue , 2008, Pages 680-691

  Gandhi, Parichey ^a   Bromberg, Facundo ^a   Margaritis, Dimitris ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTS COMPUTING; DATA MINING; INFERENCE ENGINES; LEARNING ALGORITHMS; MARKOV PROCESSES;

BENCHMARK DATA; COMPUTATIONAL REQUIREMENTS; CONDITIONAL INDEPENDENCE TESTS; EFFICIENCY AND RELIABILITY; HEURISTIC ORDERING; INDEPENDENCE TESTS; MARKOV NETWORKS;

TESTING;

EID: 52649171391     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972788.62     Document Type: Conference Paper

References (22)

1. P. Abbeel, D. Koller, and A. Y. Ng. Learning factor graphs in polynomial time and sample complexity. Journal of Machine Learning Research, 7:1743-1788, 2006.
2. A. Agresti. Categorial Data Analysis. Wiley, 2nd edition.
3. D. Anguelov, B. Taskar, V. Chatalbashev, D. Koller, D. Gupta, G. Heitz, and A. Ng. Discriminative learning of Markov random fields for segmentation of 3D range data. 2005.
4. F. Barahona. On the computational complexity of Ising spin glass models. Journal of Physics A, 15(10):3241-3253, 1982.
5. J. Besag. Spacial interaction and the statistical analysis of lattice systems. Journal of Royal Statistical Society, Series B, 1974.
6. 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.
7. F. Bromberg, D. Margaritas, and V. Honavar. Effcient markov network structure discovery using independence tests. In Proceedings of SIAM Conf on Data Mining (SDM), 2006.
8. W. L. Buntine. Operations for learning with graphical models. Journal if Artificial Intelligence Research, 2:159-225, 1994.
9. S. Della Pietra, V. Della Pietra, and J. Lafferty. Inducing features of random fields. IEEE Transactions on PAMI, 19(4):390-393, 1997.
10. C. B. D.J. Newman, S. Hettich and C. Merz. UCI repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Science, 1998.
11. W. T. Freeman and E. Pasztor. Learning low-level vision. International Journal of Computer Vision, 40(1):25-47, 2000.
12. N. Friedman and M. Linial. Using Bayesian networks to analyze expression data. Journal of Computational Biology, 7(3-4) :601-620, August 2000.
13. S. Geman and D. Geman. Stochastic relaxation, gibbs distributions, and the bayesian relation of images. IEEE Transactions on PAMI, 6:721-741, 1984.
14. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning, 1995.
15. R. Hoffman and V. Tresp. Nonlinear markov networks for continuous variables, volume 10, pages 521-529, 1998.
16. D. Margaritis. On theoretically optimal variable selection. Submitted to the Journal of Machine Learning Research, 2007.
17. D. Margaritis and S. Thrun. Bayesian network induction via local neighbourhoods, volume 12, pages 505-511. MIT Press, 2000.
18. A. McCallum. Efficiently inducing feeatures of conditional random fields. Proceedings of Conference on Uncertainty in Artificial Intelligence (UAI), 2003.
19. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
20. S. Russell and P. Norvig. Artificial Intelligence: A Mordern Approach. Prentice Hall, 2nd edition, 2003.
21. S. Shekhar, P. Zhang, Y. Huang, and R. R. Vatsavai. Trends in Spatial Data Mining, chapter 19, pages 357-379. AAAI Press / The MIT Press, 2004.
22. P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction, and Search. Adaptive Computation and Machine Learning Series. MIT Press, 2nd edition, 2000.