2014
AISTATS
AISTATS 2014
An inclusion optimal algorithm for chain graph structure learning
Abstract
This paper presents and proves an extension of Meek’s conjecture to chain graphs under the Lauritzen-Wermuth-Frydenberg interpretation. The proof of the conjecture leads to the development of a structure learning algorithm that finds an inclusion optimal chain graph for any given probability distribution satisfying the composition property. Finally, the new algorithm is experimentally evaluated.
🌉
Interdisciplinary Bridge
- Machine Learning and Mathematics & Optimization
🐣
Hot Topic Early Bird
- structure learning
🐝
Cross-Pollinator
- Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio