Decomposition of maximum likelihood in mixed graphical interaction models
From MaRDI portal
Publication:3833443
DOI10.1093/biomet/76.3.539zbMath0677.62053OpenAlexW2085076749WikidataQ57394065 ScholiaQ57394065MaRDI QIDQ3833443
Morten Frydenberg, Steffen L. Lauritzen
Publication date: 1989
Published in: Biometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/biomet/76.3.539
cutmultiplicative modeldecomposable modelsdecompositions of estimation and testing problemsdecompositions of marked graphsdecompositions of maximum likelihood estimatesfactorizations of likelihood ratio statisticsgraphical interaction modelsMixed graphical association modelssymmetric and directional association
Related Items
Learning decomposable Markov networks in pseudo-independent domains with local evaluation, A characterization of Markov equivalence classes for acyclic digraphs, Blankets joint posterior score for learning Markov network structures, Re‐identification in the Absence of Common Variables for Matching, Decomposition of Covariate-Dependent Graphical Models with Categorical Data, Probability distributions with summary graph structure, Factorization of posteriors and partial imputation algorithm for graphical models with missing data., BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques, The EM algorithm for graphical association models with missing data, Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme, Collapsibility of Conditional Graphical Models, Spanning trees and identifiability of a single-factor model, Searching for a source of difference in graphical models, Bayesian inference for graphical factor analysis models, Bayesian Approaches for Large Biological Networks, Efficient local updates for undirected graphical models, Structural Markov graph laws for Bayesian model uncertainty, A review of Gaussian Markov models for conditional independence, Sequential sampling of junction trees for decomposable graphs, MCMC model determination for discrete graphical models, Decomposition of search for \(v\)-structures in DAGs