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