Efficient Greedy Learning of Gaussian Mixture Models
From MaRDI portal
Publication:4408948
DOI10.1162/089976603762553004zbMath1047.68114OpenAlexW2140136927WikidataQ52022340 ScholiaQ52022340MaRDI QIDQ4408948
Ben Kröse, Nikos Vlassis, Jakob Verbeek
Publication date: 2003
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/089976603762553004
Related Items (16)
A survey on deep learning and its applications ⋮ Multiscale Gaussian convolution algorithm for estimate of Gaussian mixture model ⋮ Learning invariant features using inertial priors ⋮ Newtonian clustering: an approach based on molecular dynamics and global optimization ⋮ Discrete- and Continuous-Time Probabilistic Models and Algorithms for Inferring Neuronal UP and DOWN States ⋮ Independent component analysis based on marginal density estimation using weighted parzen windows ⋮ Geometric Optimization in Machine Learning ⋮ Component Elimination Strategies to Fit Mixtures of Multiple Scale Distributions ⋮ Learning mixture models via component-wise parameter smoothing ⋮ Finite mixture models and model-based clustering ⋮ Feature representation and discrimination based on Gaussian mixture model probability densities -- practices and algorithms ⋮ Efficient global maximum likelihood estimation through kernel methods ⋮ Adaptive fault detection and diagnosis using parsimonious Gaussian mixture models trained with distributed computing techniques ⋮ Band-level correlation noise modeling for Wyner-Ziv video coding with Gaussian mixture models ⋮ A BYY scale-incremental EM algorithm for Gaussian mixture learning ⋮ Greedy Gaussian segmentation of multivariate time series
Cites Work
This page was built for publication: Efficient Greedy Learning of Gaussian Mixture Models
