Random forest explorations for URL classification

    Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

    6 Downloads (Pure)

    Abstract

    Phishing is a major concern on the Internet today and many users are falling victim because of criminal‘s deceitful tactics. Blacklisting is still the most common defence users have against such phishing websites, but is failing to cope with the increasing number. In recent years, researchers have devised modern ways of detecting such websites using machine learning. One such method is to create machine learnt models of URL features to classify whether URLs are phishing. However, there are varying opinions on what the best approach is for features and algorithms. In this paper, the objective is to evaluate the performance of the Random Forest algorithm using a lexical only dataset. The performance is benchmarked against other machine learning algorithms and additionally against those reported in the literature. Initial results from experiments indicate that the Random Forest algorithm performs the best yielding an 86.9% accuracy.
    Original languageEnglish
    Title of host publication2017 International Conference On Cyber Situational Awareness, Data Analytics And Assessment (Cyber SA)
    Editors. .
    PublisherInstitute of Electrical and Electronics Engineers, Inc.
    ISBN (Print)9781509050604
    DOIs
    Publication statusPublished - 19 Jun 2017

    Bibliographical note

    Note: Published version of Weedon, Martyn, Tsaptsinos, Dimitris and Denholm-Price, James (2017) Random forest explorations for URL classification. In: 2017 International Conference On Cyber Situational Awareness, Data Analytics And Assessment (Cyber SA); 19-20 2017, London, UK

    Keywords

    • Computer science and informatics
    • Random Forest
    • URL
    • lexical features
    • machine learning
    • phishing

    Fingerprint

    Dive into the research topics of 'Random forest explorations for URL classification'. Together they form a unique fingerprint.

    Cite this