Bayesian learning of finite asymmetric gaussian mixtures

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Asymmetric Gaussian mixture (AGM) model has been proven to be more flexible than the classic Gaussian mixture model from many aspects. In contrast with previous efforts that have focused on maximum likelihood estimation, this paper introduces a fully Bayesian learning approach using Metropolis-Hastings (MH) within Gibbs sampling method to learn AGM model. We show the merits of the proposed model using synthetic data and a challenging intrusion detection application.

Cite

CITATION STYLE

APA

Fu, S., & Bouguila, N. (2018). Bayesian learning of finite asymmetric gaussian mixtures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10868 LNAI, pp. 355–365). Springer Verlag. https://doi.org/10.1007/978-3-319-92058-0_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free