IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v33y2022i04ns0129183122500516.html
   My bibliography  Save this article

Hybrid big bang–big crunch with ant colony optimization for email spam detection

Author

Listed:
  • Rathika Natarajan

    (Department of Electronics and Communication Engineering, Jaya Institute of Technology, Thiruthani, Thiruvallur, Tamilnadu, India)

  • Abolfazl Mehbodniya

    (Department of Electronics and Communications Engineering, Kuwait College of Science and Technology, Doha Area, 7th Ring Road, Kuwait)

  • Murugesan Ganapathy

    (Department of Computer Science and Engineering, St. Joseph’s College of Engineering, Chennai 600119, Tamil Nadu, India)

  • Rahul Neware

    (Department of Computing, Mathematics and Physics, Western Norway University of Applied Sciences, Bergen, Norway)

  • Swimpy Pahuja

    (Department of Computer Science and Engineering, School of Engineering and Technology, CMR University, Bangalore, Karnataka 560043, India)

  • Luis Vives

    (Department of Computer Science, Peruvian University of Applied Sciences, Lima 15023, Peru)

  • Asha

    (Department of Computer Science, Bhaskaracharya College of Applied Sciences (University of Delhi), Sector-2, Phase-1, Dwarka, New Delhi 110075, India)

Abstract

Electronic mails (emails) have been widely adapted by organizations and individuals as efficient communication means. Despite the pervasiveness of alternate means like social networks, mobile SMS, electronic messages, etc. email users are continuously growing. The higher user growth attracts more spammers who send unsolicited emails to anonymous users. These spam emails may contain malware, misleading information, phishing links, etc. that can imperil the privacy of benign users. The paper proposes a self-adaptive hybrid algorithm of big bang–big crunch (BB–BC) with ant colony optimization (ACO) for email spam detection. The BB–BC algorithm is based on the physics-inspired evolution theory of the universe, and the collective interaction behavior of ants is the inspiration for the ACO algorithm. Here, the ant miner plus (AMP) variant of the ACO algorithm is adapted, a data mining variant efficient for the classification. The proposed hybrid algorithm (HB3C-AMP) adapts the attributes of B3C (BB–BC) for local exploitation and AMP for global exploration. It evaluates the center of mass along with the consideration of pheromone value evaluated by the best ants to detect email spam efficiently. The experiments for the proposed HB3C-AMP algorithm are conducted with the Ling Spam and CSDMC2010 datasets. Different experiments are conducted to determine the significance of the pre-processing modules, iterations, and population size on the proposed algorithm. The results are also evaluated for the AM (ant miner), AM2 (ant miner2), AM3 (ant miner3), and AMP algorithms. The performance comparison demonstrates that the proposed HB3C-AMP algorithm is superior to the other techniques.

Suggested Citation

  • Rathika Natarajan & Abolfazl Mehbodniya & Murugesan Ganapathy & Rahul Neware & Swimpy Pahuja & Luis Vives & Asha, 2022. "Hybrid big bang–big crunch with ant colony optimization for email spam detection," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-21, April.
  • Handle: RePEc:wsi:ijmpcx:v:33:y:2022:i:04:n:s0129183122500516
    DOI: 10.1142/S0129183122500516
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183122500516
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183122500516?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:33:y:2022:i:04:n:s0129183122500516. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.