Graphical and Recursive Models for Contingency Tables
From MaRDI portal
Publication:3327524
Recommendations
- A survey of graphical chain models for multidimensional contingency tables
- scientific article; zbMATH DE number 3878159
- 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
Cited in
(39)- 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
- Strategy for the selection of graphical models in non-structured contingency tables
- A comparison of graphical techniques for decision analysis
- Causality and causal models: a conceptual perspective
- DAGs as minimal \(\mathcal{I} \)-maps for the induced models of causal Bayesian networks under conditioning
- Unifying Markov properties for graphical models
- Hyper-EM for large recursive models of categorical variables.
- 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
- Learning Bayesian networks from data: An information-theory based approach
- On a hypergraph probabilistic graphical model
- Calibrated initials for an EM applied to recursive models of categorical variables.
- Chordal graph models of contingency tables
- Partial inversion for linear systems and partial closure of independence graphs
- 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
- Technology acceptance model: a replicated test using TETRAD
- Utilizing Gaussian Markov random field properties of Bayesian animal models
- 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
- BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
- Iterative proportional fitting for nonhierarchical log-linear models
- Fluctuation of estimates in an EM procedure for categorical data
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)
