{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:18:43Z","timestamp":1760170723667,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1109\/allerton.2010.5707063","type":"proceedings-article","created":{"date-parts":[[2011,2,3]],"date-time":"2011-02-03T16:50:52Z","timestamp":1296751852000},"page":"1295-1302","source":"Crossref","is-referenced-by-count":19,"title":["Greedy learning of Markov network structure"],"prefix":"10.1109","author":[{"given":"Praneeth","family":"Netrapalli","sequence":"first","affiliation":[]},{"given":"Siddhartha","family":"Banerjee","sequence":"additional","affiliation":[]},{"given":"Sujay","family":"Sanghavi","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Shakkottai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054142"},{"key":"ref11","article-title":"Learning high-dimensional markov forest distributions: Analysis of error rates","volume":"abs 1005 766","author":"tan","year":"2010","journal-title":"CoRR"},{"key":"ref12","article-title":"Elements of Information Theory","author":"cover","year":"2006","journal-title":"(Wiley Series in Telecommunications and Signal Processing)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707063"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00360-0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS691"},{"journal-title":"Graphical models exponential families and variational inference","year":"2008","author":"wainwright","key":"ref5"},{"key":"ref8","first-page":"343","article-title":"Reconstruction of markov random fields from samples: Some observations and algorithms","author":"bresler","year":"2008","journal-title":"APPROX '08\/RANDOM '08"},{"key":"ref7","first-page":"485","article-title":"Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data","volume":"9","author":"banerjee","year":"2008","journal-title":"J Mach Learn Res"},{"article-title":"Which graphical models are difficult to learn?","year":"2009","author":"bento","key":"ref2"},{"key":"ref9","first-page":"1743","article-title":"Learning factor graphs in polynomial time and sample complexity","volume":"7","author":"abbeel","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref1","article-title":"Information-theoretic limits of selecting binary graphical models in high dimensions","volume":"abs 905 2639","author":"santhanam","year":"2009","journal-title":"CoRR"}],"event":{"name":"2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2010,9,29]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2010,10,1]]}},"container-title":["2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5701578\/5706874\/05707063.pdf?arnumber=5707063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:12:01Z","timestamp":1490055121000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5707063\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/allerton.2010.5707063","relation":{},"subject":[],"published":{"date-parts":[[2010,9]]}}}