Greedy learning of markov network structure

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 1295-1302

  Netrapalli, Praneeth ^a   Banerjee, Siddhartha ^a   Sanghavi, Sujay ^a   Shakkottai, Sanjay ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SCIENCE; BOUNDED DEGREE; CENTRAL PROBLEMS; CONDITIONAL ENTROPY; DEGREE BOUNDS; DISCRETE RANDOM VARIABLES; GAUSSIANS; GRAPH STRUCTURES; GRAPHICAL MODEL; GREEDY LEARNING; MARKOV NETWORKS; MARKOV RANDOM FIELD; MODEL SELECTION; NP-HARD; STRUCTURE RECOVERY; STRUCTURE-LEARNING; SUFFICIENT CONDITIONS; UNDERLYING DISTRIBUTION;

COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; ISING MODEL; RANDOM VARIABLES; SIGNAL PROCESSING;

COMPUTER SYSTEM RECOVERY;

EID: 79952428571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5707063     Document Type: Conference Paper

References (13)

1. N. P. Santhanam and M. J. Wainwright, "Information-theoretic limits of selecting binary graphical models in high dimensions," CoRR, vol. abs/0905.2639, 2009.
2. J. Bento and A. Montanari, "Which graphical models are difficult to learn?," 2009. http://arxiv.org/abs/0910.5761.
3. N. Srebro, "Maximum likelihood bounded tree-width markov networks," Artificial Intelligence, vol. 143, no. 1, pp. 123-138, 2003.
4. A. Bogdanov, E. Mossel, and S. P. Vadhan, "The complexity of distinguishing markov random fields," in APPROX-RANDOM, pp. 331-342, 2008.
5. M. J. Wainwright and M. I. Jordan, Graphical Models, Exponential Families, and Variational Inference. Hanover, MA, USA: Now Publishers Inc., 2008.
6. P. Ravikumar, M. J. Wainwright, and J. D. Lafferty, "High- dimensional graphical model selection using l1-regularized logistic regression," Annals of Statistics, vol. 38, no. 3, pp. 1287-1319, 2010.
7. O. Banerjee, L. El Ghaoui, and A. d'Aspremont, "Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data," J. Mach. Learn. Res., vol. 9, pp. 485-516, 2008.
8. G. Bresler, E. Mossel, and A. Sly, "Reconstruction of markov random fields from samples: Some observations and algorithms," in APPROX '08 / RANDOM '08, (Berlin, Heidelberg), pp. 343-356, Springer-Verlag, 2008.
9. P. Abbeel, D. Koller, and A. Y. Ng, "Learning factor graphs in polynomial time and sample complexity," J. Mach. Learn. Res., vol. 7, pp. 1743-1788, 2006.
10. C. I. Chow and C. N. Liu, "Approximating discrete probability distributions with dependence trees," IEEE Transactions on Information Theory, vol. 14, pp. 462-467, 1968.
11. V. Y. F. Tan, A. Anandkumar, and A. S. Willsky, "Learning high-dimensional markov forest distributions: Analysis of error rates," CoRR, vol. abs/1005.0766, 2010.
12. T. M. Cover and J. A. Thomas, Elements of Information Theory, 1st Edition (Wiley Series in Telecommunications and Signal Processing). New York, NY, USA: Wiley-Interscience, 2006.
13. P. Netrapalli, S. Banerjee, S. Sanghavi, and S. Shakkottai, "Greedy learning of markov network structure," tech. rep., The University of Texas at Austin, 2010.