An approximation to the information matrix of exponential family finite mixtures

DOI10.1007/s10463-015-0542-9zbMath1396.62155OpenAlexW2187545821WikidataQ115605419 ScholiaQ115605419MaRDI QIDQ520563

Nagaraj K. Neerchal, Jorge G. Morel, Andrew M. Raim

Publication date: 5 April 2017

Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10463-015-0542-9

zbMATH Keywords

complete dataFisher informationmisclassification rateclustered sampling

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (1)

An unsupervised machine-learning checkpoint-restart algorithm using Gaussian mixtures for particle-in-cell simulations

Uses Software

• BayesDA

Cites Work

• BayesDA
• Some inequalities relating to the partial sum of binomial probabilities
• An improved method for the computation of maximum likelihood estimates for multinomial overdispersion models
• On the method of approximate Fisher scoring for finite mixtures of multinomials
• Maximum Likelihood Estimation of the Multivariate Normal Mixture Model
• A finite mixture distribution for modelling multinomial extra variation
• Large Cluster Results for Two Parametric Multinomial Extra Variation Models
• Estimating the Parameters of Mixtures of Binomial Distributions
• Moment Estimators for the Parameters of a Mixture of Two Binomial Distributions
• Testing Statistical Hypotheses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation to the information matrix of exponential family finite mixtures