Estimating finite mixture of continuous trees using penalized mutual information
From MaRDI portal
Publication:5078004
DOI10.1080/03610926.2019.1609519OpenAlexW2942698689WikidataQ127946296 ScholiaQ127946296MaRDI QIDQ5078004
Farzad Eskandari, Atefeh Khalili
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
mixture modelundirected graphical modelpenalized maximum likelihoodcontinuous multivariate analysisgraphical mixture modelnon parametric inferencetree mixture model
Related Items (2)
Estimation of nonparanormal graphical models based on ranked set sampling (RSS) ⋮ Estimation of undirected graph with finite mixture of nonparanormal distribution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Sparse inverse covariance estimation with the graphical lasso
- Sparse Gaussian graphical mixture model
- Fitting of mixtures with unspecified number of components using cross validation distance estimate
- Nonparametric estimation of component distributions in a multivariate mixture
- Sparse permutation invariant covariance estimation
- 10.1162/153244301753344605
- Extended Bayesian information criteria for model selection with large model spaces
- Model selection and estimation in the Gaussian graphical model
- Nonparametric inference in multivariate mixtures
- On the Choice of Smoothing Parameters for Parzen Estimators of Probability Density Functions
- Almost Nonparametric Inference for Repeated Measures in Mixture Models
- Finite mixture models
- 10.1162/jmlr.2003.4.7-8.1205
- Approximating discrete probability distributions with dependence trees
This page was built for publication: Estimating finite mixture of continuous trees using penalized mutual information
