Robust Estimation of Mixture Complexity
77 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/4aaee677051150e030de8ce2cce42bfc76297b0c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Statistics and Probability
Citations in the corpus
- Nonparametric Identification of Multivariate Mixtures (2010, background): “…to select the number of components have been proposed in a parametric setting (see Henna 1985; Leroux 1992; Lindsay and Roeder 1992; Windham and Cutler 1992; Roeder 1994; Chen and Kalbfleisch 1996; Dacunha- Castelle and Gassiat 1997, 1999; Keribin 2000; James et al. 2001; Woo and Sriram 2006).”
- Order Selection in Finite Mixture Models With a Nonsmooth Penalty (2008, methodology): “…mixtures, we compared MSCAD with six methods: two information-based criteria, AIC and BIC; the Bayesian method GWCR (Ishwaran et al. 2001); the Kullback–Leibler (KL) distance method (James et al. 2001); the Hellinger distance (HD) method (Woo and Sriram 2006); and Lassoing (Xing and Rao 2008).”
- Inference on the Order of a Normal Mixture (2012, methodology): “…order selection procedure for estimating the order of normal mixture model; see Leroux (1992); Richardson and Green (1997); Keribin (2000); Ishwaran, James, and Sun (2001); James, Priebe, and Marchette (2001); Miloslavsky and van der Laan (2003); Woo and Sriram (2006); and Chen and Khalili (2008).”