Using Decision Tree Algorithms in Detecting Spam Emails Written in Malay: A Comparison Study
Abdulrahman Saifuldeen H, Salim Mohammad
ITM Web of Conferences · 2022
doi:10.1051/itmconf/20224201001 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Emails have become the most economical and fastest communication forms. However, during the past few years, the increment of email users has dramatically increased spam emails. Various anti-spam techniques have been developed to minimize if not eliminate the spam problem. In this paper, we study the disparity in the effectiveness of using different decision tree algorithms in email classification and combat spam problems. For that, we have chosen Universiti Utara Malaysia emails as a case study. To achieve the best possible classification accuracy, we compared all chosen algorithms’ performance, which are Random Forest, LMT, Decision Stump, J48, Random Tree, and REP Tree. The experimental results showed that the Decision Stump algorithm is more effective to be used in classifying the emails, and the F-measures, Precision, and recall score for the Decision Stump algorithm are higher than the other comparison algorithms.
Abstract licence: CC BY
References15
15 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.