2001
DOI: 10.1214/aos/1013203454
|View full text |Cite
|
Sign up to set email alerts
|

Consistent estimation of mixture complexity

Abstract: The consistent estimation of mixture complexity is of fundamental importance in many applications of finite mixture models. An enormous body of literature exists regarding the application, computational issues and theoretical aspects of mixture models when the number of components is known, but estimating the unknown number of components remains an area of intense research effort. This article presents a semiparametric methodology yielding almost sure convergence of the estimated number of components to the tr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2006
2006
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 60 publications
(23 citation statements)
references
References 28 publications
(30 reference statements)
0
23
0
Order By: Relevance
“…, π m ). The order of a Gaussian mixture can be consistently estimated (James et al (2001)), and therefore 1(τ 2 1 = 0), which is equal to the indicator of a single mixture component, is identifiable from data. Testing a homogeneous Gaussian (τ 2 1 = 0) against a mixture with more components is a hard problem (see Chauveau et al (2019) for some recent work and more references) and proofs of unbiasedness as required for distinguishability from data do not seem to exist, but existing tests at least allow to potentially distinguish τ 2 1 = 0 from τ 2 1 > 0.…”
Section: Distinguishing Independence and Dependencementioning
confidence: 99%
“…, π m ). The order of a Gaussian mixture can be consistently estimated (James et al (2001)), and therefore 1(τ 2 1 = 0), which is equal to the indicator of a single mixture component, is identifiable from data. Testing a homogeneous Gaussian (τ 2 1 = 0) against a mixture with more components is a hard problem (see Chauveau et al (2019) for some recent work and more references) and proofs of unbiasedness as required for distinguishability from data do not seem to exist, but existing tests at least allow to potentially distinguish τ 2 1 = 0 from τ 2 1 > 0.…”
Section: Distinguishing Independence and Dependencementioning
confidence: 99%
“…The difficulty of order estimation in stationary HMMs (or equivalently order estimation for finite mixture models) mainly comes from the monotonic increase of the likelihood as the order increases. The methods developed by Chen and Kalbfleisch (1996) and James et al (2001) try to minimize the distance between a nonparametric curve based on the sample of data and the fitted model. Poskitt and Zhang (2005) proposed to use a penalized quasi-likelihood estimator and investigated its asymptotic properties.…”
Section: Mixture Modelsmentioning
confidence: 99%
“…To ensure the validity of the asymptotic results, normally a restriction is imposed on the values found by cross-validation approaches (James et al, 2001). In addition, these approaches normally require intensive computation and make it too difficult to be applied on the large number of genes from microarray data.…”
Section: Choices Of the Threshold Parametersmentioning
confidence: 99%
“…Throughout the paper, the number of mixing components K of the unknown density has been assumed to be known-for example, the scientist will have some insight in its choice. Nevertheless, K could also be treated as an unknown parameter to be estimated, this being a standard problem in mixture estimation (see James, Priebe and Marchette [24], and references therein). In fact, more unknown parameters can be introduced, as long as the mixture remains identifiable.…”
Section: 2mentioning
confidence: 99%