Learning discrete decomposable graphical models via constraint optimization
type: Item
instance of: scholarly article
title: Learning discrete decomposable graphical models via constraint optimization
zbMATH Open document ID: 1505.62200
author: Tomi Janhunen
author: Martin Gebser
author: Jussi Rintanen
author: Henrik Nyman
author: Johan Pensar
author: Jukka Corander
published in: Statistics and Computing
publication date: 2017-03-23T00:00:00Z
full work available at URL: http://hdl.handle.net/10072/101831
Mathematics Subject Classification ID: 62-08
Mathematics Subject Classification ID: 62H22
Mathematics Subject Classification ID: 62H17
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6696855
zbMATH Keywords: graphical models
zbMATH Keywords: structure learning
zbMATH Keywords: constraint programming
zbMATH Keywords: satisfiability
zbMATH Keywords: MAXSAT
zbMATH Keywords: answer set programming
describes a project that uses: Sat4j
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W2248372602
cites work: Generating and characterizing the perfect elimination orderings of a chordal graph
cites work: The complexity of theorem-proving procedures
cites work: Labelled Graphical Models
cites work: Hyper Markov laws in the statistical analysis of decomposable graphical models
cites work: Markov chain Monte Carlo model determination for hierarchical and graphical log-linear models
cites work: On rigid circuit graphs
cites work: Q4217802
cites work: Q5282991
cites work: Conflict-driven answer set solving: from theory to practice
cites work: Improving Markov chain Monte Carlo model search for data mining
cites work: Decomposable graphical Gaussian model determination
cites work: Q3328583
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Split models for contingency tables
cites work: Statistical Inference in Context Specific Interaction Models for Contingency Tables
cites work: Approximation algorithms for combinatorial problems
cites work: Bayes Factors
cites work: Q3655273
cites work: Q4382293
cites work: Answer set programming and plan generation
cites work: Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
cites work: Algorithms for Weighted Boolean Optimization
cites work: Q4702577
cites work: An overview of parallel SAT solving
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Stratified graphical models -- context-specific independence in graphical models
cites work: Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
cites work: Triangulated graphs and the elimination process
cites work: Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
cites work: Q3358073
DOI: 10.1007/S11222-015-9611-4
description: scientific article; zbMATH DE number 6696855