BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
DOI10.1016/0167-9473(93)E0054-8zbMATH Open0875.62566OpenAlexW1996601454MaRDI QIDQ674208FDOQ674208
Publication date: 28 February 1997
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-9473(93)e0054-8
Machine learningCausal probabilistic networksGraphical association modelsModel selectionSelection criteriaSelection strategies
Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of statistics (62P99) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm AS 159: An Efficient Method of Generating Random R × C Tables with Given Row and Column Totals
- Estimating the dimension of a model
- A new look at the statistical model identification
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- A fast procedure for model search in multidimensional contingency tables
- Decomposition of maximum likelihood in mixed graphical interaction models
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- Simultaneous Test Procedures--Some Theory of Multiple Comparisons
- Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
- The Analysis of Multidimensional Contingency Tables: Stepwise Procedures and Direct Estimation Methods for Building Models for Multiple Classifications
- Markov fields and log-linear interaction models for contingency tables
- Model Search among Multiplicative Models
- A Fast Model Selection Procedure for Large Families of Models
- Independence properties of directed markov fields
- Marginalization and collapsibility in graphical interaction models
- Graphical and Recursive Models for Contingency Tables
Cited In (10)
- Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme
- Estimation of graphical models whose conditional independence graphs are interval graphs and its application to modelling linkage disequilibrium
- Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
- Learning structures from data and experts
- Computational learning of the conditional phase-type (C-Ph) distribution. Learning C-Ph distributions
- Separation and completeness properties for AMP chain graph Markov models.
- Split models for contingency tables
- Characterizing Markov equivalence classes for AMP chain graph models
- Bayesian learning of Bayesian networks with informative priors
- A graphical characterization of the largest chain graphs
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Block-relaxation approaches for fitting the INDCLUS model 👍 👎
- Analysis of Recursive Probabilistic Models 👍 👎
- Structure characterization of the recursively separable models 👍 👎
- BLOCK RENEWAL PROCESSES AND THEIR APPLICATION TO MODELING 👍 👎
- Recursive estimation and testing of dynamic models 👍 👎
This page was built for publication: BIFROST -- Block recursive models Induced From Relevant knowledge, Observations, and Statistical Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674208)