论文信息 - Identifiability of mixtures

Identifiability of mixtures

Abstract Let F(x, θ) be a family of distribution functions indexed by θ ∈ Ω. If G(θ) is a distribution function on Ω H(x) = ƒohm; F(x, θ) dG(θ) is a mixture with respect to G. If there is a unique G yielding H, the mixtures is said to be identifiable.This paper summarises some known results related to identifiability of special types of mixtures and then discusses the general problem of identifiability in terms of mappings. Some new results follow for mappings with special features.

G. M. Tallis | P. Chesson

[1] S. Yakowitz,et al. On the Identifiability of Finite Mixtures , 1968 .

[2] O. Barndorff-Nielsen. Identifiability of mixtures of exponential families , 1965 .

[3] K. Parthasarathy. PROBABILITY MEASURES IN A METRIC SPACE , 1967 .

[4] O. Gaans. Probability measures on metric spaces , 2022 .

[5] G. Patil,et al. Identifiability of countable mixtures of discrete probability distributions using methods of infinite matrices , 1966, Mathematical Proceedings of the Cambridge Philosophical Society.