Open Access
February, 1968 On the Identifiability of Finite Mixtures
Sidney J. Yakowitz, John D. Spragins
Ann. Math. Statist. 39(1): 209-214 (February, 1968). DOI: 10.1214/aoms/1177698520


H. Teicher [5] has initiated a valuable study of the identifiability of finite mixtures (these terms to be defined in the next section), revealing a sufficiency condition that a class of finite mixtures be identifiable and from this, establishing the identifiability of all finite mixtures of one-dimensional Gaussian distributions and all finite mixtures of gamma distributions. From other considerations, he has generalized [4] a result of Feller [1] that arbitrary (and hence finite) mixtures of Poisson distributions are identifiable, and has also shown binomial and uniform families do not generate identifiable mixtures. In this paper it is proven that a family $\mathscr{F}$ of cumulative distribution functions (cdf's) induces identifiable finite mixtures if and only if $\mathscr{F}$ is linearly independent in its span over the field of real numbers. Also we demonstrate that finite mixtures of $\mathscr{F}$ are identifiable if $\mathscr{F}$ is any of the following: the family of $n$ products of exponential distributions, the multivariate Gaussian family, the union of the last two families, the family of one-dimensional Cauchy distributions, and the non-degenerate members of the family of one-dimensional negative binomial distributions. Finally it is shown that the translation-parameter family generated by any one-dimensional cdf yields identifiable finite mixtures.


Download Citation

Sidney J. Yakowitz. John D. Spragins. "On the Identifiability of Finite Mixtures." Ann. Math. Statist. 39 (1) 209 - 214, February, 1968.


Published: February, 1968
First available in Project Euclid: 27 April 2007

zbMATH: 0155.25703
MathSciNet: MR224204
Digital Object Identifier: 10.1214/aoms/1177698520

Rights: Copyright © 1968 Institute of Mathematical Statistics

Vol.39 • No. 1 • February, 1968
Back to Top