Learning mixtures by simplifying kernel density estimators

DOI10.1007/978-3-642-30232-9_16zbMATH Open1269.94015OpenAlexW982971517MaRDI QIDQ5325906FDOQ5325906

Authors: Olivier Schwander, Frank Nielsen 

Publication date: 31 July 2013

Published in: Matrix Information Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30232-9_16

Recommendations

• Simplification and hierarchical representations of mixtures of exponential families
• AN ACCELERATED ALGORITHM FOR DENSITY ESTIMATION IN LARGE DATABASES USING GAUSSIAN MIXTURES
• On learning statistical mixtures maximizing the complete likelihood
• Online \(k\)-MLE for mixture modeling with exponential families
• Adaptive density estimation for clustering with Gaussian mixtures

zbMATH Keywords

mixture modelskernel density estimationKullback-Leibler divergence\(k\)-means algorithmsbio-informatics application

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics in engineering and industry; control charts (62P30) Biochemistry, molecular biology (92C40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Measures of information, entropy (94A17)

Cited In (5)

• Mixture density modeling, Kullback-Leibler divergence, and differential log-likelihood
• On statistical learning of simplices: unmixing problem revisited
• Chain Rule Optimal Transport
• Kernel mixture model for probability density estimation in Bayesian classifiers
• Simplification and hierarchical representations of mixtures of exponential families

Uses Software

• Mixmod
• pyMEF
• PyMix

This page was built for publication: Learning mixtures by simplifying kernel density estimators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325906)