A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
From MaRDI portal
(Redirected from Publication:2237508)
Recommendations
- Order-independent structure learning of multivariate regression chain graphs
- scientific article; zbMATH DE number 5968958
- A decomposition algorithm for learning Bayesian networks based on scoring function
- Structure learning in Bayesian networks using regular vines
- Chain graph models of multivariate regression type for categorical data
Cites work
- scientific article; zbMATH DE number 5968958 (Why is no real title available?)
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- A recovery algorithm for chain graphs
- AMP chain graphs: minimal separators and structure learning algorithms
- Adaptive probabilistic networks with hidden variables
- Ancestral graph Markov models.
- Approximating discrete probability distributions with dependence trees
- Causality. Models, reasoning, and inference
- Causation, prediction, and search
- Chain graph interpretations and their relations revisited
- Chain graph models of multivariate regression type for categorical data
- Decomposition of structural learning about directed acyclic graphs
- Discrete chain graph models
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- High-dimensional structure estimation in Ising models: local separation criterion
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Learning marginal AMP chain graphs under faithfulness
- Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
- Markov Properties for Acyclic Directed Mixed Graphs
- Markovian acyclic directed mixed graphs for discrete data
- Maximum cardinality search for computing minimal triangulations of graphs
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Order-independent structure learning of multivariate regression chain graphs
- Probabilistic Networks and Expert Systems
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
- Sequences of regressions and their independences
- The max-min hill-climbing Bayesian network structure learning algorithm
Cited in
(4)
This page was built for publication: A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237508)
