Preprint
Article

TF-IDF Feature-Based Spam Filtering of Mobile SMS Using Machine Learning Approach

This version is not peer-reviewed.

Submitted:

13 September 2021

Posted:

15 September 2021

You are already at the latest version

Abstract
Short Message Service (SMS) is becoming the secure medium of communication due to large-scale global coverage, reliability, and power efficiency. As person--to--person (P2P) messaging is less secure than application-to-person (A2P) messaging, anyone can send a message, leading to the attack. Attackers mistreat this opportunity to spread malicious content, perform harmful activities, and abuse other people, commonly known as spam. Moreover, such messages can waste a lot of time, and important messages are sometimes overlooked. As a result, accurate spam detection in SMS and its computational time are burning issues. In this paper, we conduct six different experiments to detect SMS spam from the dataset of 5574 messages using machine learning classifiers such as Multinomial Naïve Bayes (MNB) and Support Vector Machine (SVM), considering variations of \textit{Term Frequency-- Inverse Document Frequency (TF--IDF)} features for exploring the trade-off among accuracy, F1-score and computational time. The experiments achieve the best result of the accuracy of 98.50\%, F1--score of 98\%, and area under roc curve (AUC) of 0.97 for multinomial naïve bayes classifier with TF--IDF after stemming.
Keywords: 
;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

Downloads

648

Views

646

Comments

0

Subscription

Notify me about updates to this article or when a peer-reviewed version is published.

Email

Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2025 MDPI (Basel, Switzerland) unless otherwise stated