Classification of Spam URLs Using Machine Learning Approaches

Omar Husni Odeh, Anas Arram, Murad Njoum
9/10/2023
cs.CRcs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

The Internet is used by billions of users every day because it offers fast and free communication tools and platforms. Nevertheless, with this significant increase in usage, huge amounts of spam are generated every second, which wastes internet resources and, more importantly, users' time. This study investigates the use of machine learning models to classify URLs as spam or nonspam. We first extract the features from the URL as it has only one feature, and then we compare the performance of several models, including k nearest neighbors, bagging, random forest, logistic regression, and others. Experimental results demonstrate that bagging outperformed other models and achieved the highest accuracy of 98.64%. In addition, bagging outperformed the current state-of-the-art approaches which emphasize its effectiveness in addressing spam-related challenges on the Internet. This suggests that bagging is a promising approach for URL spam classification.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{odeh2023classification,
  title  = {Classification of Spam URLs Using Machine Learning Approaches},
  author = {Omar Husni Odeh and Anas Arram and Murad Njoum},
  year   = {2023},
  eprint = {2310.05953},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.05953v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.05953.svg)](https://codeofpaper.com/paper/2310.05953)

Discussion