Estimation of the complexity of a finite mixture distribution: from well- to less known methods
From MaRDI portal
Publication:2081736
DOI10.1007/s42519-022-00289-1OpenAlexW4293242254MaRDI QIDQ2081736
Fadoua Balabdaoui, Lilian Müller, Yulia Kulagina, Andrei Kolar
Publication date: 30 September 2022
Published in: Journal of Statistical Theory and Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s42519-022-00289-1
Parametric inference (62Fxx) Nonparametric inference (62Gxx) Probabilistic methods, stochastic differential equations (65Cxx)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On location mixtures with Pólya frequency components
- The geometry of mixture likelihoods, part II: The exponential family
- \(L_{2}E\) estimation of mixture complexity for count data
- Finite mixture models and model-based clustering
- Model-based cluster and discriminant analysis with the MIXMOD software
- Bayesian regularization for normal mixture estimation and model-based clustering
- Robust estimation of mixture complexity for count data
- The geometry of mixture likelihoods: A general theory
- Identifiability of finite mixtures for directional data
- Moment matrices: Applications in mixtures
- An entropy criterion for assessing the number of clusters in a mixture model
- Consistent estimation of a mixing distribution
- Estimating the dimension of a model
- Minimum Hellinger distance estimates for parametric models
- On testing for the number of components in a mixed Poisson model
- The distribution of the likelihood ratio for mixtures of densities from the one-parameter exponential family
- The estimation of the order of a mixture model
- Asymptotics for likelihood ratio tests under loss of identifiability
- R. A. Fisher and the making of maximum likelihood 1912--1922
- On the posterior distribution of the number of components in a finite mixture
- Consistent estimation of mixture complexity.
- Least squares estimation of a completely monotone pmf: from analysis to statistics
- Bounds for Bayesian order identification with application to mixtures
- A Modified Likelihood Ratio Test for Homogeneity in Finite Mixture Models
- Estimating the Number of Clusters Using Cross-Validation
- Robust Estimation of Mixture Complexity
- A Look at Some Data on the Old Faithful Geyser
- The EM Algorithm and Extensions, 2E
- Asymptotic Properties of Maximum Likelihood Estimators and Likelihood Ratio Tests Under Nonstandard Conditions
- An improvement of the NEC criterion for assessing the number of clusters in a mixture model
- An Application of the Laplace Method to Finite Mixture Distributions
- Minimum Hellinger Distance Estimation for Finite Mixture Models
- Practical Bayesian Density Estimation Using Mixtures of Normals
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Penalized minimum‐distance estimates in finite mixture models
- Bayesian Density Estimation and Inference Using Mixtures
- The Support Reduction Algorithm for Computing Non‐Parametric Function Estimates in Mixture Models
- On Fast Computation of the Non-Parametric Maximum Likelihood Estimate of a Mixing Distribution
- Identifiability of Finite Mixtures of Elliptical Distributions
- Identifiability of Finite Mixtures
- Identifiability of Mixtures
- On the Identifiability of Finite Mixtures
- Estimating the components of a mixture of normal distributions
- METHOD OF MOMENTS AND METHOD OF MAXIMUM LIKELIHOOD
- The Large-Sample Distribution of the Likelihood Ratio for Testing Composite Hypotheses
- A graphical method for the analysis of statistical distributions into two normal components
This page was built for publication: Estimation of the complexity of a finite mixture distribution: from well- to less known methods