Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 401

The DOI matches its Crossref record.

On the Identifiability of Finite Mixtures

Open access
Yakowitz, Sidney J., Spragins, John D. · 1968 · The Annals of Mathematical Statistics

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1214/aoms/1177698520

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 401

Metadata

Authors
Yakowitz, S. J., & Spragins, J. D.
Venue
The Annals of Mathematical Statistics
Published
1968-02
Volume
39
Issue
1
Pages
209-214
ISSN
0003-4851 (ISSN-L)
OpenAlex
W2058220245
Cited by
401
References
0
FWCI
6.35
Type
journal article
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: On the Identifiability of Finite Mixtures. https://app.cochat.ai/papers/10.1214/aoms/1177698520
The paper
Yakowitz, S. J., & Spragins, J. D. (1968). On the Identifiability of Finite Mixtures. The Annals of Mathematical Statistics. https://doi.org/10.1214/aoms/1177698520

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.