Markov fields and log-linear interaction models for contingency tables
DOI10.1214/AOS/1176345006zbMATH Open0444.62064OpenAlexW2070013518WikidataQ57394072 ScholiaQ57394072MaRDI QIDQ1144875FDOQ1144875
John Darroch, Steffen Lauritzen, Terence P. Speed
Publication date: 1980
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176345006
graphical modelshierarchical modelsconditional independencedecomposabilityGibbs statestriangulated graphsMarkov fieldsmultidimensional contingency tableslog-linear interaction models
Contingency tables (62H17) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Graph theory (05C99)
Cited In (85)
- Label- and level-invariant graphical log-linear models
- Quasi-symmetric graphical log-linear models
- Inferring the finest pattern of mutual independence from data
- Reciprocal properties of random fields on undirected graphs
- Local computations in Dempster-Shafer theory of evidence
- On a hypergraph probabilistic graphical model
- Correspondence analysis and association models constrained by a conditional independence graph
- Computing the decomposable entropy of belief-function graphical models
- CANONICAL REPRESENTATION OF LOG-LINEAR MODELS
- Learning structures from data and experts
- A Comparison of Marginal and Conditional Models for Capture–Recapture Data with Application to Human Rights Violations Data
- Collapsibility of likelihood ratio tests in multidimensional contingency tables
- On conditional independence and log-convexity
- A novel association test for rare variants based on algebraic statistics
- Junction trees of general graphs
- On finite exchangeability and conditional independence
- Marginal information for structure learning
- Features Reweighting and Selection in ligand-based Virtual Screening for Molecular Similarity Searching Based on Deep Belief Networks
- Decomposable Probabilistic Influence Diagrams
- Independence in multi-way contingency tables: S.N. Roy's breakthroughs and later develop\-ments
- Explicit, identical maximum likelihood estimates for some cyclic Gaussian and cyclic Ising models
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1
- Bayesian method for learning graphical models with incompletely categorical data
- Technological modelling for graphical models: an approach based on genetic algorithms
- Computing the maximum-entropy extension of given discrete probability distributions
- A divide-and-conquer approach in applying EM for large recursive models with incomplete categorical data
- A new algorithm for decomposition of graphical models
- Constructing structural VAR models with conditional independence graphs
- A comparison of graphical techniques for decision analysis
- Ancestral graph Markov models.
- Unifying Markov properties for graphical models
- Hyper-EM for large recursive models of categorical variables.
- De Finetti priors using Markov chain Monte Carlo computations
- Temporal aggregation in chain graph models
- Three centuries of categorical data analysis: Log-linear models and maximum likelihood estima\-tion
- Whittemore's notion of collapsibility in multidimensional contingency tables
- A graphical chain model for inferring regulatory system networks from gene expression profiles
- Information geometric methods for complexity
- On the toric algebra of graphical models
- Multigraph representations of hierarchical loglinear models
- Hierarchical models for independence structures of networks
- The admissibility of the maximum likelihood estimator for decomposable log-linear interaction models for contingency tables
- Decomposition of a hypergraph by partial-edge separators
- A kriging procedure for processes indexed by graphs
- An efficient representation of chordal graphs
- Conditional log-linear structures for log-linear modelling
- Bayesian inference for Poisson and multinomial log-linear models
- Palindromic Bernoulli distributions
- Marginal models for categorical data
- Chordal graph models of contingency tables
- Binary Models for Marginal Independence
- A unique formal system for binary decompositions of database relations, probability distributions, and graphs
- On constrained estimation of graphical time series models
- The EM algorithm for graphical association models with missing data
- Decomposition of search for \(v\)-structures in DAGs
- Algebraic algorithms for sampling from conditional distributions
- Computing p-values in conditional independence models for a contingency table
- Improving on the maximum likelihood estimators of the means in Poisson decomposable graphical models
- Decomposition and model selection for large contingency tables
- Studies on hypergraphs. I: Hyperforests
- Optimal decomposition by clique separators
- Stratified graphical models -- context-specific independence in graphical models
- Split models for contingency tables
- Sequences of regressions and their independences
- Ignorability for categorical data
- A universal table model for categorical databases
- Copula Gaussian Graphical Models for Functional Data
- Sampling Algorithms for Discrete Markov Random Fields and Related Graphical Models
- The log-linear group-lasso estimator and its asymptotic properties
- Faithfulness of Probability Distributions and Graphs
- Triangular systems for symmetric binary variables
- A review of Gaussian Markov models for conditional independence
- Parametric estimation for Gaussian fields indexed by graphs
- Multi-dimensional multivariate Gaussian Markov random fields with application to image processing
- Binary distributions of concentric rings
- Graphical models for inference under outcome-dependent sampling
- A conjugate prior for discrete hierarchical log-linear models
- Chain Graph Models and their Causal Interpretations
- Maximum likelihood estimation for discrete exponential families and random graphs
- Markov properties for mixed graphs
- An implementation of the iterative proportional fitting procedure by propagation trees.
- A characterization of Markov equivalence classes for acyclic digraphs
- BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
- From association to causation via regression
- Log-linear modeling using conditional log-linear structures
This page was built for publication: Markov fields and log-linear interaction models for contingency tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144875)