Learning to detect malicious URLs
Open accessThe DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Abstract
Malicious Web sites are a cornerstone of Internet criminal activities. The dangers of these sites have created a demand for safeguards that protect end-users from visiting them. This article explores how to detect malicious Web sites from the lexical and host-based features of their URLs. We show that this problem lends itself naturally to modern algorithms for online learning. Online algorithms not only process large numbers of URLs more efficiently than batch algorithms, they also adapt more quickly to new features in the continuously evolving distribution of malicious URLs. We develop a real-time system for gathering URL features and pair it with a real-time feed of labeled URLs from a large Web mail provider. From these features and labels, we are able to train an online classifier that detects malicious Web sites with 99% accuracy over a balanced dataset.
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
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
The perceptron: A probabilistic model for information storage and organization in the brain.
Rosenblatt, F. (1958) · Psychological Review · doi:10.1037/h0042519 · Cited by 12,280
Pattern Recognition and Machine Learning
(2006) · doi:10.1007/978-0-387-45528-0 · Cited by 9,824
Adaptive Algorithms and Stochastic Approximations
Benveniste, A., Métivier, M., & Priouret, P. (1990) · Springer eBooks · doi:10.1007/978-3-642-75894-2 · Cited by 2,006
Domain names - implementation and specification
Mockapetris, P. V. (1987) · doi:10.17487/rfc1035 · Cited by 1,698 · cited 1×
“The Domain Name System (DNS) is a hierarchical network of servers responsible for translating domain names into IP addresses and other kinds of information [Mockapretis 1987a; 1987b].”
Online Passive-Aggressive Algorithms
Crammer, K., Dekel, O., Keshet, J., Shalev‐Shwartz, S., & Singer, Y. (2003) · Cited by 1,661
Internet Protocol, Version 6 (IPv6) Specification
Deering, S., & Hinden, R. (1998) · doi:10.17487/rfc2460 · Cited by 1,524
Internet Protocol, Version 6 (IPv6) Specification
Deering, S., & Hinden, R. (2017) · doi:10.17487/rfc8200 · Cited by 1,520
Domain names - concepts and facilities
Mockapetris, P. V. (1987) · doi:10.17487/rfc1034 · Cited by 1,467
Dynamic Host Configuration Protocol
Droms, R. (1993) · doi:10.17487/rfc1531 · Cited by 1,025
Cited by
Malicious URL Detection using Machine Learning: A Survey
Sahoo, D., Liu, C., & Hoi, S. C. H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.07179 · Cited by 274
Example-dependent cost-sensitive decision trees
Correa Bahnsen, A., Aouada, D., & Ottersten, B. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.04.042 · Cited by 223
“Lastly, in the case of intrusion detection, classifying a benign connection as malicious have a different cost than when a malicious connection is accepted (Ma et al., 2011).”
Background
Metadata
- Authors
- Ma, J., Saul, L. K., Savage, S., & Voelker, G. M.
- Venue
- ACM Transactions on Intelligent Systems and Technology
- Published
- 2011-04
- Volume
- 2
- Issue
- 3
- Pages
- 1-24
- ISSN
- 2157-6904 (ISSN-L)
- 2157-6912
- OpenAlex
- W1975909792
- Cited by
- 225
- References
- 39
- FWCI
- 30.52
- Type
- journal article
- Language
- en
- Open access
- green
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.