Estimating finite mixture of continuous trees using penalized mutual information

DOI10.1080/03610926.2019.1609519MaRDI QIDQ5078004zbMATH OpenOpenAlexWikidataFDO

Authors Atefeh Khalili, Farzad Eskandari

Publication date 20 May 2022

Published in Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2019.1609519

zbMATH Keywords

continuous multivariate analysisgraphical mixture modelmixture modelnon parametric inferencepenalized maximum likelihoodtree mixture modelundirected graphical model

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• 10.1162/jmlr.2003.4.7-8.1205
• Almost Nonparametric Inference for Repeated Measures in Mixture Models
• Approximating discrete probability distributions with dependence trees
• Extended Bayesian information criteria for model selection with large model spaces
• Finite mixture models
• Fitting of mixtures with unspecified number of components using cross validation distance estimate
• Forest density estimation
• scientific article; zbMATH DE number 1059776 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• Learning with mixtures of trees.
• Model selection and estimation in the Gaussian graphical model
• Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
• Nonparametric estimation of component distributions in a multivariate mixture
• Nonparametric inference in multivariate mixtures
• On the Choice of Smoothing Parameters for Parzen Estimators of Probability Density Functions
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Sparse Gaussian graphical mixture model
• Sparse inverse covariance estimation with the graphical lasso
• Sparse permutation invariant covariance estimation
• The nonparanormal: semiparametric estimation of high dimensional undirected graphs

Cited in

(3)

• Improving mixture tree construction using better EM algorithms
• Estimation of undirected graph with finite mixture of nonparanormal distribution
• Estimation of nonparanormal graphical models based on ranked set sampling (RSS)

Describes a project that uses

Uses Software

• glasso

This page was built for publication: Estimating finite mixture of continuous trees using penalized mutual information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5078004)