Decomposition of maximum likelihood in mixed graphical interaction models
DOI10.1093/BIOMET/76.3.539zbMATH Open0677.62053OpenAlexW2085076749WikidataQ57394065 ScholiaQ57394065MaRDI QIDQ3833443FDOQ3833443
Steffen Lauritzen, Morten Frydenberg
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
Cited In (24)
- Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
- Likelihood Factorizations for Mixed Discrete and Continuous Variables
- Learning decomposable Markov networks in pseudo-independent domains with local evaluation
- Collapsibility of Conditional Graphical Models
- Factorization of posteriors and partial imputation algorithm for graphical models with missing data.
- Spanning trees and identifiability of a single-factor model
- Mixed graphical models with missing data and the partial imputation EM algorithm
- MCMC model determination for discrete graphical models
- Bayesian Approaches for Large Biological Networks
- Re‐identification in the Absence of Common Variables for Matching
- The EM algorithm for graphical association models with missing data
- Decomposition of search for \(v\)-structures in DAGs
- Improving on the maximum likelihood estimators of the means in Poisson decomposable graphical models
- Searching for a source of difference in graphical models
- Structural Markov graph laws for Bayesian model uncertainty
- Blankets joint posterior score for learning Markov network structures
- Bayesian inference for graphical factor analysis models
- A review of Gaussian Markov models for conditional independence
- Sequential sampling of junction trees for decomposable graphs
- Probability distributions with summary graph structure
- Decomposition of Covariate-Dependent Graphical Models with Categorical Data
- A characterization of Markov equivalence classes for acyclic digraphs
- BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
- Efficient local updates for undirected graphical models
Recommendations
- Decomposition of models whose marginal distributions are mixtures 👍 👎
- Decomposable graphical Gaussian model determination 👍 👎
- The Maximum Likelihood Degree of Mixtures of Independence Models 👍 👎
- Title not available (Why is that?) 👍 👎
- Improving on the maximum likelihood estimators of the means in Poisson decomposable graphical models 👍 👎
- Selection and estimation for mixed graphical models 👍 👎
- Title not available (Why is that?) 👍 👎
- Decomposition of multivariate statistical models 👍 👎
- Marginal likelihood integrals for mixtures of independence models 👍 👎
This page was built for publication: Decomposition of maximum likelihood in mixed graphical interaction models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3833443)
