Greedy algorithms for dirac mixture approximation of arbitrary probability density functions.
Uwe D. HanebeckOliver C. SchrempfPublished in: CDC (2007)
Keyphrases
- probability density function
- greedy algorithms
- mixture model
- greedy algorithm
- gaussian mixture
- expectation maximization
- gaussian mixture model
- partition function
- density function
- density estimation
- em algorithm
- knapsack problem
- kernel density estimation
- kullback leibler divergence
- probability distribution
- parzen window
- closed form
- probabilistic model
- maximum likelihood
- search algorithm
- bayesian framework
- generative model
- error bounds
- unsupervised learning
- language model
- generalized gaussian
- gaussian distribution
- learning algorithm
- statistical methods
- gaussian model
- class conditional
- image segmentation