Third IEEE International Conference on Data Mining (ICDM'03) Learning Rules for Anomaly Detection of Hostile Network Traffic Melbourne, Florida November 19-November 22 ISBN: 0-7695-1978-4
We introduce an algorithm called LERAD that learns rules for finding rare events in nominal time-series data with long range dependencies. We use LERAD to find anomalies in network packets and TCP sessions to detect novel intrusions. We evaluated LERAD on the 1999 DARPA/Lincoln Laboratory intrusion detection evaluation data set and on traffic collected in a university departmental server environment.
Citation:
Matthew V. Mahoney, Philip K. Chan, "Learning Rules for Anomaly Detection of Hostile Network Traffic," icdm, pp.601, Third IEEE International Conference on Data Mining (ICDM'03), 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||