On estimating the number of components in a finite mixture of power series distributions

DOI10.1016/0167-9473(86)90004-6zbMath0613.62034OpenAlexW2062589734MaRDI QIDQ1819490

Anestis Antoniadis, Jacques Berruyer

Publication date: 1986

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9473(86)90004-6

zbMATH Keywords

difference equationsexponential familyepsilon algorithmpower series distributionsestimating the number of components in a finite mixture of distributions

Mathematics Subject Classification ID

Point estimation (62F10) Parametric inference (62F99) Probabilistic methods, stochastic differential equations (65C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accélération de la convergence en analyse numérique
• Maximum likelihood estimation of a compound Poisson process
• Bootstrap methods: another look at the jackknife
• Consistent cross-validated density estimation
• Biological problems involving sums of exponential functions of time: an improved method of calculation
• Multivariate Tests for Clusters
• On the Convergence and Stability of the Epsilon Algorithm
• Identifiability of Finite Mixtures
• Identifiability of Mixtures
• Some simple tests of mixtures with symmetrical components
• Linear Statistical Inference and its Applications
• Singular rules for certain non-linear algorithms
• On a Device for Computing the e m (S n ) Transformation

This page was built for publication: On estimating the number of components in a finite mixture of power series distributions