Efficient global maximum likelihood estimation through kernel methods

DOI10.1016/J.NEUNET.2010.03.003MaRDI QIDQ1784705zbMATH OpenOpenAlexWikidataFDO

Authors C. Cervellera, D. Macciò, Marco Muselli

Publication date 27 September 2018

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.neunet.2010.03.003

zbMATH Keywords

maximum likelihood estimationlow-discrepancy sequencesdeterministic learningkernel models

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming
• Estimation and optimization of MLE maximum entropy probability density
• Efficient numerical approximation of maximum entropy estimates
• Density estimation by dual ascent of the log-likelihood
• AN ACCELERATED ALGORITHM FOR DENSITY ESTIMATION IN LARGE DATABASES USING GAUSSIAN MIXTURES

Cites work

• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• scientific article; zbMATH DE number 735224 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• Density estimation via exponential model selection
• Efficient Greedy Learning of Gaussian Mixture Models
• Gaussian sum particle filtering
• Projection pursuit mixture density estimation
• The elements of statistical learning. Data mining, inference, and prediction

Cited in

(2)

• Fast and accurate computation for kernel estimators
• Maximum nonparametric kernel likelihood estimation for multiplicative linear regression models

This page was built for publication: Efficient global maximum likelihood estimation through kernel methods

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