Graphical and Recursive Models for Contingency Tables
DOI10.2307/2336490zbMATH Open0541.62038OpenAlexW2034109855WikidataQ57394070 ScholiaQ57394070MaRDI QIDQ3327524FDOQ3327524
Nanny Wermuth, Steffen Lauritzen
Publication date: 1983
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2336490
graphical modelsconditional independencedata reductionpath analysisundirected graphcollapsibilitymaximum likelihood estimatemultiplicative modeldecomposable modelrecursive modelshierarchical log linear modelszero partial associationzero partial dependence
Cited In (36)
- Bayesian method for learning graphical models with incompletely categorical data
- A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data
- Utilizing Gaussian Markov Random Field Properties of Bayesian Animal Models
- A comparison of graphical techniques for decision analysis
- Causality and causal models: a conceptual perspective
- Unifying Markov properties for graphical models
- Hyper-EM for large recursive models of categorical variables.
- Technology acceptance model: A replicated test using TETRAD
- The lesson of causal discovery algorithms for quantum correlations: causal explanations of Bell-inequality violations require fine-tuning
- Accurate parameter estimation for Bayesian network classifiers using hierarchical Dirichlet processes
- On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
- On a hypergraph probabilistic graphical model
- Learning Bayesian networks from data: An information-theory based approach
- Calibrated initials for an EM applied to recursive models of categorical variables.
- Chordal graph models of contingency tables
- The EM algorithm for graphical association models with missing data
- Maximum likelihood bounded tree-width Markov networks
- Decomposition of search for \(v\)-structures in DAGs
- Normal linear regression models with recursive graphical Markov structure
- Learning Bayesian networks for discrete data
- Logical and algorithmic properties of independence and their application to Bayesian networks
- On the Application of Conditional Independence to Ordinal Data
- Split models for contingency tables
- Sequences of regressions and their independences
- Copula Gaussian Graphical Models for Functional Data
- A hybrid methodology for learning belief networks: BENEDICT
- A review of Gaussian Markov models for conditional independence
- Information and probabilistic reasoning
- A note on the correctness of the causal ordering algorithm
- Decomposable Probabilistic Influence Diagrams
- Binary distributions of concentric rings
- Polyhedral approaches to learning Bayesian networks
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1
- Iterative proportional fitting for nonhierarchical log-linear models
- Fluctuation of estimates in an EM procedure for categorical data
- BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Graphical models for associations between variables, some of which are qualitative and some quantitative π π
- Binary Models for Marginal Independence π π
- A new algorithm for the maximum likelihood estimation of graphical log-linear models π π
This page was built for publication: Graphical and Recursive Models for Contingency Tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3327524)