Efficient markov network discovery using particle filters

Computational Intelligence

Volumn 25, Issue 4, 2009, Pages 367-394

  Margaritis, Dimitris ^b   Bromberg, Facundo ^a  

^a UNIVERSIDAD TECNOLÓGICA NACIONAL   (Argentina)

^b Iowa State University   (United States)

Author keywords

Graphical model structure learning; Markov networks; Particle filters; Sequential Monte Carlo

Indexed keywords

DISTRIBUTED DATA; GRAPHICAL MODEL STRUCTURE LEARNING; INDEPENDENCE TESTS; INFORMATION GAIN; MARKOV NETWORKS; PARTICLE FILTER; PARTICLE FILTERS; POSTERIOR PROBABILITY; POTENTIAL ERRORS; SEQUENTIAL MONTE CARLO; VERY LARGE DATUM;

AIR FILTERS; DISTRIBUTED COMPUTER SYSTEMS; GRAPHIC METHODS; MONTE CARLO METHODS; NONLINEAR FILTERING; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; STATISTICAL TESTS; TARGET TRACKING;

SEQUENTIAL SWITCHING;

EID: 70449455407     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.2009.00347.x     Document Type: Article

References (46)

1. Abbeel, P., D. Koller, and A. Y. Ng. 2006. Learning factor graphs in polynomial time and sample complexity. Journal of Machine Learning Research, 7 : 1743 1788.
2. Agresti, A. 2002. Categorical Data Analysis (2nd ed.). Wiley-Interscience, New York.
3. Aliferis, C. F., I. Tsamardinos, and A. Statnikov. 2003. HITON, a novel Markov blanket algorithm for optimal variable selection. In Proceedings of the American Medical Informatics Association (AMIA) Fall Symposium, Washington, DC, pp. 21 25.
4. Andrieu, C., N. de Freitas, A. Doucet, and M. Jordan. 2003. An introduction to MCMC for machine learning. Machine Learning, 50 : 5 43.
5. Anguelov, D., B. Taskar, V. Chatalbashev, D. Koller, D. Gupta, G. Heitz, and A. Ng. 2005. Discriminative learning of Markov random fields for segmentation of 3D range data. In Proceedings of the Conference on Computer Vision and Pattern Recognition (CVPR), San Diego, CA, pp. 169 176.
6. Barahona, F. 1982. On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical and General, 15 (10 3241 3253.
7. Benjamini, Y., and Y. Hochberg. 1995. Controlling the false discovery rate: A practical and powerful approach to multiple testing. Journal of the Royal Statistical Society, Series B (Methodological), 57 (1 289 300.
8. Benjamini, Y., and D. Yekutieli. 2001. The control of the false discovery rate in multiple testing under dependency. Annals of Statistics, 29 (4 1165 1188.
9. Besag, J. 1974. Spatial interaction and the statistical analysis of lattice systems. Journal of the Royal Statistical Society, Series B, 36 (2 192 236.
10. Besag, J., J. York, and A. Mollie. 1991. Bayesian image restoration with two applications in spatial statistics. Annals of the Institute of Statistical Mathematics, 43 : 1 59.
11. Bromberg, F., D. Margaritis, and V. Honavar. 2006. Efficient Markov network structure discovery using independence tests. In SIAM International Conference on Data Mining, Bethesda, MD, pp. 141 152.
12. Cappé, O., A. Guillin, J.-M. Marin, and C. P. Robert. 2004. Population Monte Carlo. Journal of Computational and Graphical Statistics, 13 (4 907 929.
13. Carpenter, J., P. Clifford, and P. Fearnhead. 1999. An improved particle filter for non-linear problems. IEE proceedings, Radar, Sonar and Navigation, 146 : 2 7.
14. Chopin, N. 2002. A sequential particle filter method for static models. Biometrika, 89 : 539 552.
15. Chow, C., and C. Liu. May 1968. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14 (3 462 467.
16. Del Moral, P., A. Doucet, and A. Jasra. 2006. Sequential Monte Carlo samplers. Journal of the Royal Statistical Society, Series B (Methodological), 68 : 411 436.
17. Della Pietra, S., V. Della Pietra, and J. Lafferty. 1997. Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19 (4 390 393.
18. Doucet, A., N. de Freitas, and N. Gordon (Eds.). 2001. Sequential Monte Carlo methods in practice. Springer Verlag, New York.
19. Edwards, D. 2000. Introduction to Graphical Modelling (2nd ed. Springer, New York.
20. Geman, S., and D. Geman. 1984. Stochastic relaxation, Gibbs distributions, and the Bayesian relation of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6 : 721 741.
21. Gilks, W. R., and C. Berzuini. 2001. Following a moving target - Monte Carlo inference for dynamic Bayesian models. Journal of the Royal Statistical Society, Series B (Methodological), 63 : 127 146.
22. Gordon, N., D. Salmond, and A. F. Smith. 1993. Novel approach to nonlinear/non-Gaussian Bayesian state estimation. IEE Proceedings F, Radar and Signal Processing, 140 (2 107 113.
23. Heckerman, D. 1995. A tutorial on learning Bayesian networks. Technical Report MSR-TR-95-06, Microsoft Research.
24. Hettich, S., and S. D. Bay. 1999. UCI KDD archive. Department of Information and Computer Science, University of California, Irvine.
25. Hofmann, R., and V. Tresp. 1998. Nonlinear Markov networks for continuous variables. In Neural Information Processing Systems (NIPS) '98, Vol. 10, pp. 521 529.
26. Jerrum, M., and A. Sinclair. 1993. Polynomial-time approximation algorithms for the Ising model. SIAM Journal on Computing, 22 : 1087 1116.
27. Kitagawa, G. 1996. Monte Carlo filter and smoother for non-Gaussian nonlinear state space models. Journal of Computational and Graphical Statistics, 5 (1 1 25.
28. Lam, W., and F. Bacchus. 1994. Learning Bayesian belief networks: An approach based on the MDL principle. Computational Intelligence, 10 : 269 293.
29. 1-regularization. In Advances in Neural Information Processing Systems 19. Edited by B. Schölkopf, J. Platt, and T. Hoffman. MIT Press, Cambridge, MA, pp. 817 824.
30. Liu, J., and R. Chen. 1998. Sequential Monte Carlo methods for dynamic systems. Journal of the American Statistical Association, 93 (443 1032 1044.
31. Margaritis, D. 2005. Distribution-free learning of Bayesian network structure in continuous domains. In National Conference on Artificial Intelligence (AAAI). AAAI Press/MIT Press, Menlo Park, CA, pp. 825 830.
32. Margaritis, D., and S. Thrun. 2000. Bayesian network induction via local neighborhoods. In Advances in Neural Information Processing Systems 12. Edited by S. Solla, T. Leen, and K.-R. Müller. MIT Press, Cambridge, MA, pp. 505 511.
33. Margaritis, D., and S. Thrun. 2001. A Bayesian multiresolution independence test for continuous variables. In Proceedings of Conference on Uncertainty in Artificial Intelligence (UAI), Morgan Kaufmann, San Francisco, pp. 346 353.
34. McCallum, A. 2003. Efficiently inducing features of conditional random fields. Proceedings of Uncertainty in Artificial Intelligence (UAI), Acapulco, Mexico, pp. 403 410.
35. Miller, R. G. 1981. Simultaneous Statistical Inference (2nd ed.). Springer Verlag, New York.
36. Newman, D. J., S. Hettich, C. L. Blake, and C. Merz. 1998. UCI repository of machine learning databases. Department of Information and Computer Sciences, University of California, Irvine.
37. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc, San Francisco.
38. Rebane, G., and J. Pearl. 1989. The recovery of causal poly-trees from statistical data. In Uncertainty in Artificial Intelligence 3. Edited by L. N. Kanal, T. S. Levitt, and J. F. Lemmer. North-Holland, Amsterdam, pp. 175 182.
39. Shekhar, S., P. Zhang, Y. Huang, and R. Vatsavai. 2004. Trends in spatial data mining. In Data Mining: Next Generation Challenges and Future Directions. Edited by H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha. AAAI Press/The MIT Press, Menlo Park, CA, pp. 357 379.
40. Spirtes, P., C. Glymour, and R. Scheines. January 2000. Causation, Prediction, and Search. Adaptive Computation and Machine Learning Series (2nd ed.). MIT Press, Cambridge, MA.
41. Srebro, N., and D. Karger. 2001. Learning Markov networks: Maximum bounded tree-width graphs. In ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, pp. 392 401.
42. Tong, S., and D. Koller. 2001. Active learning for structure in Bayesian networks. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), Seattle, WA, pp. 863 869.
43. Tsamardinos, I., C. F. Aliferis, and A. Statnikov. 2003a. Algorithms for large scale Markov blanket discovery. In Proceedings of the 16th International FLAIRS Conference, St. Augustine, FL, pp. 376 381.
44. Tsamardinos, I., C. F. Aliferis, and A. Statnikov. 2003b. Time and sample efficient discovery of Markov blankets and direct causal relations. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, pp. 673 678.
45. Tsamardinos, I., L. E. Brown, and C. F. Aliferis. 2006. The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning, 65 (1 31 78.
46. Whittaker, J. 1990. Graphical Models in Applied Multivariate Statistics. John Wiley, and Sons, New York.