Improved Greedy Algorithms for Learning Graphical Models

DOI10.1109/TIT.2015.2427354MaRDI QIDQ2977445zbMATH OpenFDO

Authors Avik Ray, Sujay Sanghavi, Sanjay Shakkottai

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Learning and adaptive systems in artificial intelligence (68T05)

Cited in

(4)

• The one-inclusion graph algorithm is near-optimal for the prediction model of learning
• scientific article; zbMATH DE number 7370576 (Why is no real title available?)
• Computational implications of reducing data to sufficient statistics
• Learning loosely connected Markov random fields

This page was built for publication: Improved Greedy Algorithms for Learning Graphical Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977445)