Separation and completeness properties for AMP chain graph Markov models.
From MaRDI portal
(Redirected from Publication:1848925)
Recommendations
- Characterizing Markov equivalence classes for AMP chain graph models
- On chain graph models for description of conditional independence structures
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
- Alternative Markov properties for chain graphs
- A characterization of Markov equivalence classes for acyclic digraphs
Cites work
- A recovery algorithm for chain graphs
- Alternative Markov properties for chain graphs
- Bayesian analysis in expert systems. With comments and a rejoinder by the authors
- Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
- BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
- Causation, prediction, and search
- Distinctness of the eigenvalues of a quadratic form in a multivariate sample
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 4211299 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 4867 (Why is no real title available?)
- Identifying independence in bayesian networks
- Independence properties of directed markov fields
- Learning Bayesian networks: The combination of knowledge and statistical data
- Normal linear regression models with recursive graphical Markov structure
- On chain graph models for description of conditional independence structures
- Probabilistic Networks and Expert Systems
Cited in
(21)- Minimal sufficient causation and directed acyclic graphs
- The L-separation criterion for description of cs-independence models
- Unifying Markov properties for graphical models
- A characterization of Markov equivalence for directed cyclic graphs
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Marginal AMP chain graphs
- Characterizing Markov equivalence classes for AMP chain graph models
- Alternative Markov properties for chain graphs
- Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
- Every LWF and AMP chain graph originates from a set of causal models
- scientific article; zbMATH DE number 1309303 (Why is no real title available?)
- Graphical modelling of multivariate time series
- Multiple testing and error control in Gaussian graphical model selection
- Joint Response Graphs and Separation Induced by Triangular Systems
- A note on faithfulness and total positivity
- AMP chain graphs: minimal separators and structure learning algorithms
- On Gaussian conditional independence structures
- Improved evolutionary-based feature selection technique using extension of knowledge based on the rough approximations
- Properties of graphical regression models for multidimensional categorical data
- Identifiability and Consistent Estimation for Gaussian Chain Graph Models
- Mixed orthogonality graphs for continuous-time stationary processes
This page was built for publication: Separation and completeness properties for AMP chain graph Markov models.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848925)
