Abstract
We present an approach to estimating high dimensional discrete probability distributions with decomposable graphical models. Starting with the independence assumption we add edges and thus gradually increase the complexity of our model. Bounded by the minimum description length principle we are able to produce highly accurate models without overfitting. We discuss the properties and benefits of this approach in an experimental evaluation and compare it to the well-studied Chow-Liu algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
