• Feb 07, 2023 News!JACN will adopt Article-by-Article Work Flow. The benefit of article-by-article workflow is that a delay with one article may not delay the entire issue. Once a paper steps into production, it will be published online soon.   [Click]
  • May 30, 2022 News!JACN Vol.10, No.1 has been published with online version.   [Click]
  • Dec 24, 2021 News!Volume 9 No 1 has been indexed by EI (inspec)!   [Click]
General Information
    • ISSN: 1793-8244 (Print)
    • Abbreviated Title:  J. Adv. Comput. Netw.
    • Frequency: Semiyearly
    • DOI: 10.18178/JACN
    • Editor-in-Chief: Professor Haklin Kimm
    • Executive Editor: Ms. Cherry Chan
    • Abstracting/ Indexing: EBSCO, ProQuest, and Google Scholar.
    • E-mail: jacn@ejournal.net
    • APC: 500USD
Professor Haklin Kimm
East Stroudsburg University, USA
I'm happy to take on the position of editor in chief of JACN. We encourage authors to submit papers on all aspects of computer networks.

JACN 2013 Vol.1(2): 132-136 ISSN: 1793-8244
DOI: 10.7763/JACN.2013.V1.27

Interplay between Probabilistic Classifiers and Boosting Algorithms for Detecting Complex Unsolicited Emails

Shrawan Kumar Trivedi and Shubhamoy Dey

Abstract—This paper presents the performance comparison of probabilistic classifiers with/without the help of various boosting algorithms, in the Email Spam classification domain. Our focus is on complex Emails, where most of the existing classifiers fail to identify unsolicited Emails. In this paper we consider two probabilistic algorithms i.e. “Bayesian” and “Naive Bayes” and three boosting algorithms i.e. “Bagging”, “Boosting with Re-sampling” and “AdaBoost”. Initially, the Probabilistic classifiers were tested on the “Enron Dataset” without Boosting and thereafter, with the help of Boosting algorithms. The Genetic Search Method was used for selecting the most informative 375 features out of 1359 features created at the outset. The results show that, in identifying complex Spam massages, “Bayesian classifier” performs better than “Naive Bayes” with or without boosting. Amongst boosting algorithms, „Boosting with Resample‟ has brought significant performance improvement to the “Probabilistic classifiers”.

Index Terms—Unsolicited emails, probabilistic classifiers, boosting algorithms.

The authors are with Indian Institute of Management, Indore, India (email:f10shrawank@iimidr.ac.in).


Cite:Shrawan Kumar Trivedi and Shubhamoy Dey, "Interplay between Probabilistic Classifiers and Boosting Algorithms for Detecting Complex Unsolicited Emails," Journal of Advances in Computer Networks vol. 1, no. 2, pp. 132-136, 2013.

Copyright © 2008-2024. Journal of Advances in Computer Networks.  All rights reserved.
E-mail: jacn@ejournal.net