Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
نویسندگان
چکیده
منابع مشابه
Comparing Dynamic Causal Models using AIC, BIC and Free Energy
In neuroimaging it is now becoming standard practise to fit multiple models to data and compare them using a model selection criterion. This is especially prevalent in the analysis of brain connectivity. This paper describes a simulation study which compares the relative merits of three model selection criteria (i) Akaike's Information Criterion (AIC), (ii) the Bayesian Information Criterion (B...
متن کاملCheng Title : High - dimensional Mixed Graphical Model
In this project we propose a mixed graphical model that allows us to model data sets with both continuous and discrete variables. The proposed model reduces the complexity of a complete conditional Gaussian (CG) density yet maintains its flexibility. It also allows us to develop a computationally efficient regression based algorithm by focusing on the conditional log-likelihood of each variable...
متن کاملAic and Bic Formodelingwith Complex Survey Data
Model-selection criteria such as AIC and BIC are widely used in applied statistics. In recent years, there has been a huge increase in modeling data from large complex surveys, and a resulting demand for versions of AIC and BIC that are valid under complex sampling. In this paper, we show how both criteria can be modified to handle complex samples. We illustrate with two examples, the first usi...
متن کاملGeneralized linear mixed models and modified AIC
The paper by Austin et al. refers repeatedly to generalized linear mixed models, or GLMMs. Example. Suppose we are doing a simple observational study. We observe some species of animal. N animals are selected at random and tracked. They may be observed visually, or by some sort of attached sensor. The position is recorded at short regular intervals. Say, once a minute. The variable of interest ...
متن کاملNon-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical Models
We observe that certain large-clique graph triangulations can be useful for reducing computational requirements when making queries on mixed stochastic/deterministic graphical models. We demonstrate that many of these largeclique triangulations are non-minimal and are thus unattainable via the elimination algorithm. We introduce ancestral pairs as the basis for novel triangulation heuristics an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2010
ISSN: 1471-2105
DOI: 10.1186/1471-2105-11-18