File:Sample entropy and random forests a methodology for anomaly-based intrusion detection and classification of low-bandwidth malware attacks (IA sampleentropyndr109452633).pdf

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
Go to page
next page →
next page →
next page →

Original file(1,275 × 1,650 pixels, file size: 714 KB, MIME type: application/pdf, 82 pages)

Captions

Captions

Add a one-line explanation of what this file represents

Summary

[edit]
Sample entropy and random forests a methodology for anomaly-based intrusion detection and classification of low-bandwidth malware attacks   (Wikidata search (Cirrus search) Wikidata query (SPARQL)  Create new Wikidata item based on this file)
Author
Hyla, Bret M.
image of artwork listed in title parameter on this page
Title
Sample entropy and random forests a methodology for anomaly-based intrusion detection and classification of low-bandwidth malware attacks
Publisher
Monterey, California. Naval Postgraduate School
Description

Sample Entropy examines changes in the normal distribution of network traffic to identify anomalies. Normalized Information examines the overall probability distribution in a data set. Random Forests is a supervised learning algorithm which is efficient at classifying highlyimbalanced data. Anomalies are exceedingly rare compared to the overall volume of network traffic. The combination of these methods enables low-bandwidth anomalies to easily be identified in high-bandwidth network traffic. Using only low-dimensional network information allows for near real-time identification of anomalies. The data set was collected from 1999 DARPA intrusion detection evaluation data set. The experiments compare a baseline f-score to the observed entropy and normalized information of the network. Anomalies that are disguised in network flow analysis were detected. Random Forests prove to be capable of classifying anomalies using the sample entropy and normalized information. Our experiment divided the data set into five-minute time slices and found that sample entropy and normalized information metrics were successful in classifying bad traffic with a recall of .99 and a f-score .50 which was 185% better than our baseline.


Subjects: Computer science; Entropy; Algorithms; Databases; Computer networks; Methodology; Data mining
Language English
Publication date September 2006
Current location
IA Collections: navalpostgraduateschoollibrary; fedlink
Accession number
sampleentropyndr109452633
Source
Internet Archive identifier: sampleentropyndr109452633
https://archive.org/download/sampleentropyndr109452633/sampleentropyndr109452633.pdf
Permission
(Reusing this file)
Approved for public release, distribution unlimited

Licensing

[edit]
Public domain
This work is in the public domain in the United States because it is a work prepared by an officer or employee of the United States Government as part of that person’s official duties under the terms of Title 17, Chapter 1, Section 105 of the US Code. Note: This only applies to original works of the Federal Government and not to the work of any individual U.S. state, territory, commonwealth, county, municipality, or any other subdivision. This template also does not apply to postage stamp designs published by the United States Postal Service since 1978. (See § 313.6(C)(1) of Compendium of U.S. Copyright Office Practices). It also does not apply to certain US coins; see The US Mint Terms of Use.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current12:20, 24 July 2020Thumbnail for version as of 12:20, 24 July 20201,275 × 1,650, 82 pages (714 KB) (talk | contribs)FEDLINK - United States Federal Collection sampleentropyndr109452633 (User talk:Fæ/IA books#Fork8) (batch 1993-2020 #27058)

Metadata