\(L_{2}E\) estimation of mixture complexity for count data
From MaRDI portal
Publication:961924
DOI10.1016/J.CSDA.2009.05.013zbMath1279.62079OpenAlexW1975398812MaRDI QIDQ961924
Publication date: 1 April 2010
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2009.05.013
Related Items (4)
Efficient and robust tests for semiparametric models ⋮ A mixture model-based nonparametric approach to estimating a count distribution ⋮ On the performance ofL2Eestimation in modelling heterogeneous count responses with extreme values ⋮ Estimation of the complexity of a finite mixture distribution: from well- to less known methods
Cites Work
- Unnamed Item
- Unnamed Item
- Robust estimation of mixture complexity for count data
- Minimum Hellinger distance estimates for parametric models
- Minimum Hellinger distance estimation for Poisson mixtures.
- On testing for the number of components in a mixed Poisson model
- Consistent estimation of mixture complexity.
- Robust Estimation of Mixture Complexity
- Robust and efficient estimation by minimising a density power divergence
- A Graphical Technique for Determining the Number of Components in a Mixture of Normals
- Minimum Hellinger Distance Estimation for Finite Mixture Models
- Bayesian Model Selection in Finite Mixtures by Marginal Density Decompositions
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Order Selection in Finite Mixture Models With a Nonsmooth Penalty
- Robust inference for finite Poisson mixtures
This page was built for publication: \(L_{2}E\) estimation of mixture complexity for count data