The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
An intelligent system for spam detection and identification of the most relevant features based on evolutionary Random Weight Networks
Abstract
Abstract With the incremental use of emails as an essential and popular communication mean over the Internet, there comes a serious threat that impacts the Internet and the society. This problem is known as spam. By receiving spam messages, Internet users are exposed to security issues, and minors are exposed to inappropriate contents. Moreover, spam messages waste resources in terms of storage, bandwidth, and productivity. What makes the problem worse is that spammers keep inventing new techniques to dodge spam filters. On the other side, the massive data flow of hundreds of millions of individuals, and the large number of attributes make the problem more cumbersome and complex. Therefore, proposing evolutionary and adaptable spam detection models becomes a necessity. In this paper, an intelligent detection system that is based on Genetic Algorithm (GA) and Random Weight Network (RWN) is proposed to deal with email spam detection tasks. In addition, an automatic identification capability is also embedded in the proposed system to detect the most relevant features during the detection process. The proposed system is intensively evaluated through a series of extensive experiments based on three email corpora. The experimental results confirm that the proposed system can achieve remarkable results in terms of accuracy, precision, and recall. Furthermore, the proposed detection system can automatically identify the most relevant features of the spam emails.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Extreme learning machine: a new learning scheme of feedforward neural networks
Huang, G.-B., Zhu, Q.-Y., & Siew, C.-K. (2005) · 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541) · doi:10.1109/ijcnn.2004.1380068 · Cited by 4,084
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
Goldberg, D. E., & Deb, K. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50008-2 · Cited by 2,407
Support vector machines for spam categorization
Drucker, H., Wu, D., & Vapnik, V. N. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788645 · Cited by 1,471
A Bayesian Approach to Filtering Junk E-Mail
Sahami, M., Dumais, S., Heckerman, D. E., & Horvitz, E. (1998) · Cited by 1,206
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
Mühlenbein, H., & Schlierkamp-Voosen, D. (1993) · Evolutionary Computation · doi:10.1162/evco.1993.1.1.25 · Cited by 1,199
Hybrid Whale Optimization Algorithm with simulated annealing for feature selection
Mafarja, M. M., & Mirjalili, S. (2017) · Neurocomputing · doi:10.1016/j.neucom.2017.04.053 · Cited by 1,148
Self-citationLearning and generalization characteristics of the random vector functional-link net
Pao, Y.-H., Park, G.-H., & Sobajic, D. J. (1994) · Neurocomputing · doi:10.1016/0925-2312(94)90053-1 · Cited by 1,138
Stochastic choice of basis functions in adaptive function approximation and the functional-link net
Igelnik, B., & Pao, Y.-H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.471375 · Cited by 955
Genetic algorithm optimization applied to electromagnetics: a review
Weile, D. S., & Michielssen, E. (1997) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.558650 · Cited by 881
Cited by
Harris hawks optimization: Algorithm and applications
Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & Chen, H. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2019.02.028 · Cited by 6,324
Self-citationJia, H., Peng, X., & Lang, C. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.115665 · Cited by 417
Explainable Artificial Intelligence in CyberSecurity: A Survey
Capuano, N., Fenza, G., Loia, V., & Stanzione, C. (2022) · IEEE Access · doi:10.1109/access.2022.3204171 · Cited by 330
Chen, H., Heidari, A. A., Chen, H., Wang, M., Pan, Z., & Gandomi, A. H. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.04.008 · Cited by 322
Self-citationAn intensify Harris Hawks optimizer for numerical and engineering optimization problems
Kamboj, V. K., Nandi, A., Bhadoria, A., & Sehgal, S. (2020) · Applied Soft Computing · doi:10.1016/j.asoc.2019.106018 · Cited by 288
Chen, H., Jiao, S., Heidari, A. A., Wang, M., Chen, X., & Zhao, X. (2019) · Energy Conversion and Management · doi:10.1016/j.enconman.2019.05.057 · Cited by 287
Self-citationOnline social networks security and privacy: comprehensive review and analysis
Jain, A. K., Sahoo, S. R., & Kaubiyal, J. (2021) · Complex & Intelligent Systems · doi:10.1007/s40747-021-00409-7 · Cited by 276
Mafarja, M., Thaher, T., Al-Betar, M. A., Too, J., Awadallah, M. A., Abu Doush, I., & Turabieh, H. (2023) · Applied Intelligence · doi:10.1007/s10489-022-04427-x · Cited by 91
Self-citationUnderstanding the Landscape of Online Deception
Hage, H., Aïmeur, E., & Guedidi, A. (2020) · Advances in Media, Entertainment, and the Arts · doi:10.4018/978-1-7998-2543-2.ch014 · Cited by 7
Metadata
- Authors
- Faris, H., Al-Zoubi, A. M., Heidari, A. A., Aljarah, I., Mafarja, M., Hassonah, M. A., & Fujita, H.
- Venue
- Information Fusion
- Publisher
- Elsevier BV
- Published
- 2019-08
- Volume
- 48
- Pages
- 67-83
- ISSN
- 1566-2535 (ISSN-L)
- OpenAlex
- W2914128779
- Cited by
- 270
- References
- 41
- FWCI
- 60.26
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.