We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Cyber Security/Unsupervised anomaly detection using an evolutionary extension of k-means algorithm
PeriodicalsCyber Security

Unsupervised anomaly detection using an evolutionary extension of k-means algorithm

Checking your access to this record.

Abstract & Overview

In this paper, we propose a new unsupervised anomaly detection framework for network intrusions. The framework consists of a new clustering algorithm named I-means and new anomalousness metrics named IP Weights. I-means is an evolutionary extension of k means algorithm that estimates automatically the number of clusters for a set of data. IP Weights allow the automatic conversion of regular packet features into a 3-dimensional numerical feature space. Online and offline evaluations show not only strong detection effectiveness, but also strong runtime efficiency, with response times falling within a few seconds ranges.

Cite this record

Wei Lu, Issa Traoré (2008). Unsupervised anomaly detection using an evolutionary extension of k-means algorithm. International Journal of Information and Computer Security, 2(2), 107–107. https://doi.org/10.1504/ijics.2008.018513

Copy in another style

Lu, W., & Traoré, I. (2008). Unsupervised anomaly detection using an evolutionary extension of k-means algorithm. International Journal of Information and Computer Security, 2(2), 107–107. https://doi.org/10.1504/ijics.2008.018513
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.