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

• Autores: Natarajan, Rathika, Mehbodniya, Abolfazl, Ganapathy, Murugesan, Neware, Rahul, Pahuja, Swimpy, Vives, Luis, Asha
• Formato: artículo
• Fecha de Publicación: 2022
• Institución: Universidad Peruana de Ciencias Aplicadas
• Repositorio: UPC-Institucional
• Lenguaje: inglés
• OAI Identifier: oai:repositorioacademico.upc.edu.pe:10757/660275
• Enlace del recurso: http://hdl.handle.net/10757/660275
• Nivel de acceso: acceso embargado
• Materia: ant colony optimization; ant miner plus; Big bang-big crunch; email spam; email spam detection; meta-heuristic; theory of universe

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.