Stochastic Methods to Find Maximum Likelihood for Spam E-mail Classification

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

Abstract

The increasing volume of unsolicited bulk e-mails leads to the need for reliable stochastic spam detection methods for the classification of the received sequence of e-mails. When a sequence of emails is received by a recipient during a time period, the spam filters have already classified them as spam or not spam. Due to the dynamic nature of the spam, there might be emails marked as not spam but are actually real spams and vice versa. For the sake of security, it is important to be able to detect real spam emails. This paper utilizes stochastic methods to refine the preliminary spam detection and to find maximum likelihood for spam e-mail classification. The method is based on the Bayesian theorem, hidden Markov model (HMM), and the Viterbi algorithm.

Cite

CITATION STYLE

APA

Mansourbeigi, S. M. H. (2019). Stochastic Methods to Find Maximum Likelihood for Spam E-mail Classification. In Advances in Intelligent Systems and Computing (Vol. 927, pp. 623–632). Springer Verlag. https://doi.org/10.1007/978-3-030-15035-8_60

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