Abstract
Probability density function (PDF) estimation problem is a core stage of the pattern recognition, data analysis and other engineering applications. One of the popular maximum-likelihood (ML) constrained methods for Gaussian kernel PDF estimation is expectation maximization (EM) algorithm. However, it suffers from low convergence speed and also ill positioning of the kernels. We proposed a new PDF estimation method based on the continuous domain ant colony optimization (ACOR) with the aim to maximize the likelihood of data patterns. The proposed approach outperforms the EM algorithm in estimating the Gaussian kernel parameters. One stochastic dataset involved in evaluating the algorithm. Results show that applying modified ACOR provides more accurate estimation of the PDF parameters in lower convergence time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
