Learning discrete decomposable graphical models via constraint optimization
DOI10.1007/S11222-015-9611-4zbMATH Open1505.62200OpenAlexW2248372602MaRDI QIDQ517387FDOQ517387
Authors: Tomi Janhunen, Martin Gebser, Jussi Rintanen, Henrik Nyman, Johan Pensar, Jukka Corander 
Publication date: 23 March 2017
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10072/101831
Recommendations
- Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming
- Efficient structure learning of Bayesian networks using constraints
- Learning chordal Markov networks via stochastic local search
- scientific article
- Learning decomposable Markov networks in pseudo-independent domains with local evaluation
Computational methods for problems pertaining to statistics (62-08) Contingency tables (62H17) Probabilistic graphical models (62H22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Cites Work
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Improving Markov chain Monte Carlo model search for data mining
- Title not available (Why is that?)
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- Title not available (Why is that?)
- Bayes Factors
- Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models
- Probabilistic graphical models.
- Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
- Title not available (Why is that?)
- Labelled Graphical Models
- Statistical Inference in Context Specific Interaction Models for Contingency Tables
- Approximation algorithms for combinatorial problems
- Title not available (Why is that?)
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Outline of an algorithm for integer solutions to linear programs
- The complexity of theorem-proving procedures
- On rigid circuit graphs
- Algorithms for Weighted Boolean Optimization
- Decomposable graphical Gaussian model determination
- Answer set programming and plan generation
- Conflict-driven answer set solving: from theory to practice
- Logic programs with stable model semantics as a constraint programming paradigm
- Triangulated graphs and the elimination process
- Title not available (Why is that?)
- Stratified graphical models -- context-specific independence in graphical models
- Split models for contingency tables
- An overview of parallel SAT solving
- Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Title not available (Why is that?)
Cited In (8)
- Boosting Answer Set Optimization with Weighted Comparator Networks
- Decomposable context-specific models
- Rewriting optimization statements in answer-set programs
- Decomposition of structural learning about directed acyclic graphs
- The Seventh Answer Set Programming Competition: Design and Results
- Title not available (Why is that?)
- Structure Learning of Contextual Markov Networks using Marginal Pseudo‐likelihood
- Towards using the chordal graph polytope in learning decomposable models
Uses Software
This page was built for publication: Learning discrete decomposable graphical models via constraint optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q517387)
