Learning discrete decomposable graphical models via constraint optimization
From MaRDI portal
Publication:517387
DOI10.1007/s11222-015-9611-4zbMath1505.62200OpenAlexW2248372602MaRDI QIDQ517387
Henrik Nyman, Jussi Rintanen, Martin Gebser, Tomi Janhunen, 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
Computational methods for problems pertaining to statistics (62-08) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Contingency tables (62H17) Logic programming (68N17) Probabilistic graphical models (62H22)
Related Items
Unnamed Item ⋮ Rewriting optimization statements in answer-set programs ⋮ Structure Learning of Contextual Markov Networks using Marginal Pseudo‐likelihood ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ Boosting Answer Set Optimization with Weighted Comparator Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An overview of parallel SAT solving
- On rigid circuit graphs
- Stratified graphical models -- context-specific independence in graphical models
- Split models for contingency tables
- Approximation algorithms for combinatorial problems
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Improving Markov chain Monte Carlo model search for data mining
- Answer set programming and plan generation
- Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
- Conflict-driven answer set solving: from theory to practice
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Logic programs with stable model semantics as a constraint programming paradigm
- Triangulated graphs and the elimination process
- Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
- Outline of an algorithm for integer solutions to linear programs
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Algorithms for Weighted Boolean Optimization
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- Labelled Graphical Models
- Statistical Inference in Context Specific Interaction Models for Contingency Tables
- Bayes Factors
- Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models
- Decomposable graphical Gaussian model determination
- The complexity of theorem-proving procedures
