Separation and completeness properties for AMP chain graph Markov models.
DOI10.1214/AOS/1015345961zbMATH Open1043.62080OpenAlexW1512305453MaRDI QIDQ1848925FDOQ1848925
Michael Levitz, Michael D. Perlman, David Madigan
Publication date: 14 November 2002
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1015345961
Applications of graph theory (05C90) Neural nets and related approaches to inference from stochastic processes (62M45) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Causation, prediction, and search
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Bayesian analysis in expert systems. With comments and a rejoinder by the authors
- Learning Bayesian networks: The combination of knowledge and statistical data
- Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
- Distinctness of the eigenvalues of a quadratic form in a multivariate sample
- Identifying independence in bayesian networks
- Probabilistic Networks and Expert Systems
- On chain graph models for description of conditional independence structures
- Alternative Markov properties for chain graphs
- Normal linear regression models with recursive graphical Markov structure
- Independence properties of directed markov fields
- BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
- A recovery algorithm for chain graphs
Cited In (19)
- 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
- Unifying Markov properties for graphical models
- Graphical modelling of multivariate time series
- Joint Response Graphs and Separation Induced by Triangular Systems
- Title not available (Why is that?)
- The L-separation criterion for description of cs-independence models
- Minimal sufficient causation and directed acyclic graphs
- Properties of graphical regression models for multidimensional categorical data
- Multiple testing and error control in Gaussian graphical model selection
- Identifiability and Consistent Estimation for Gaussian Chain Graph Models
- Mixed orthogonality graphs for continuous-time stationary processes
- AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms
- A note on faithfulness and total positivity
- Marginal AMP chain graphs
- Characterizing Markov equivalence classes for AMP chain graph models
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Alternative Markov properties for chain graphs
- Improved evolutionary-based feature selection technique using extension of knowledge based on the rough approximations
Uses Software
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 👍 👎
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)
