Preprint Article Version 3 Preserved in Portico This version is not peer-reviewed

Case Study Email Spam Detection of Two Metaheuristic Algorithm for Optimal Feature Selection

Version 1 : Received: 25 January 2020 / Approved: 26 January 2020 / Online: 26 January 2020 (07:07:23 CET)
Version 2 : Received: 5 May 2020 / Approved: 5 May 2020 / Online: 5 May 2020 (16:31:19 CEST)
Version 3 : Received: 28 November 2020 / Approved: 30 November 2020 / Online: 30 November 2020 (11:08:33 CET)

How to cite: Mohmmadzadeh, H. Case Study Email Spam Detection of Two Metaheuristic Algorithm for Optimal Feature Selection. Preprints 2020, 2020010309. https://doi.org/10.20944/preprints202001.0309.v3 Mohmmadzadeh, H. Case Study Email Spam Detection of Two Metaheuristic Algorithm for Optimal Feature Selection. Preprints 2020, 2020010309. https://doi.org/10.20944/preprints202001.0309.v3

Abstract

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

Keywords

classification; hybrid; Whale Optimization Algorithm; email spam

Subject

Computer Science and Mathematics, Algebra and Number Theory

Comments (1)

Comment 1
Received: 30 November 2020
Commenter: Hekmat Mohmmadzadeh
Commenter's Conflict of Interests: Author
Comment: Title and results
+ Respond to this comment

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 1
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.