Cargando…
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
BACKGROUND: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example Kruskal's algorithm. The efficiency of the algorithm makes it tractable for high-dimensional problems. RESULTS: We ex...
| Autores principales: | , , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2010
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2823705/ https://www.ncbi.nlm.nih.gov/pubmed/20064242 http://dx.doi.org/10.1186/1471-2105-11-18 |