ACM Home Page
Please provide us with feedback. Feedback
Mining intrusion detection alarms for actionable knowledge
Full text PdfPdf (1.05 MB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Edmonton, Alberta, Canada
SESSION: Industry track papers table of contents
Pages: 366 - 375  
Year of Publication: 2002
ISBN:1-58113-567-X
Authors
Klaus Julisch  IBM Research
Marc Dacier  IBM Research
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
: AAAI
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 83,   Citation Count: 19
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775047.775101
What is a DOI?

ABSTRACT

In response to attacks against enterprise networks, administrators increasingly deploy intrusion detection systems. These systems monitor hosts, networks, and other resources for signs of security violations. The use of intrusion detection has given rise to another difficult problem, namely the handling of a generally large number of alarms. In this paper, we mine historical alarms to learn how future alarms can be handled more efficiently. First, we investigate episode rules with respect to their suitability in this approach. We report the difficulties encountered and the unexpected insights gained. In addition, we introduce a new conceptual clustering technique, and use it in extensive experiments with real-world data to show that intrusion detection alarms can be handled efficiently by using previously mined knowledge.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Allen, A. Christie, W. Fithen, J. McHugh, J. Pickel, and E. Stoner. State of the Practice of Intrusion Detection Technologies. Technical report, Carnegie Mellon University, January 2000. http://www.cert.org/archive/pdf/99tr028.pdf.
 
2
 
3
D. Barbará, J. Couto, S. Jajodia, L. Popyack, and N. Wu. ADAM: Detecting Intrusions by Data Mining. In IEEE Workshop on Information Assurance and Security, 2001.
 
4
 
5
D. Barbará, N. Wu, and S. Jajodia. Detecting Novel Network Intrusions Using Bayes Estimators. In First SIAM Int'l Conf. on Data Mining (SDM'01), 2001.
6
 
7
 
8
E. Bloedorn, B. Hill, A. Christiansen, C. Skorupka, L. Talboot, and J. Tivel. Data Mining for Improving Intrusion Detection, 2000. http://www.mitre.org/support/papers/tech_papers99_00/.
 
9
J. Broderick -- Editor. IBM Outsourced Solution, 1998. http://www.infoworld.com/cgi-bin/displayTC.pl?/980504sb3-ibm.htm.
 
10
P. Chan and S. Stolfo. Toward Scalable Learning with Non-Uniform Class and Cost Distributions: A Case Study in Credit Card Fraud Detection. In 4th Int'l Conf. on Knowledge Discovery and Data Mining, pages 164--168, 1998.
 
11
C. Clifton and G. Gengo. Developing Custom Intrusion Detection Filters Using Data Mining. In Military Communications Int'l Symposium (MILCOM2000), October 2000.
 
12
O. Dain and R. K. Cunningham. Fusing Heterogeneous Alert Streams into Scenarios. In Barbará and Jajodia {4}.
 
13
H. Debar, M. Dacier, and A. Wespi. A Revised Taxonomy for Intrusion Detection Systems. Annales des Télécommunications, 55(7--8):361--378, 2000.
 
14
 
15
 
16
17
 
18
M. Carofalakis and R. Rastogi. Data Mining Meets Network Management: The Nemesis Project. In ACM SIGMOD Int'l Workshop on Research Issues in Data Mining and Knowledge Discovery, May 2001.
 
19
A. Gordon. Classification. Chapman and Hall, 1999
 
20
 
21
 
22
J. Han and Y. Fu. Dynamic Generation and Refinement of Concept Hierarchies for Knowledge Discovery in Databases. In Workshop on Knowledge Discovery in Databases, pages 157--168, 1994.
 
23
 
24
P. Hansen, B. Jaumard, and N. Mladenovic. How to Choose K Entries Among N. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 19:105--116, 1995.
 
25
O. Heinonen and H. Mannila. Attribute-Oriented Induction and Conceptual Clustering. Technical Report C-1996-2, University of Helsinki, 1996.
 
26
J. L. Hellerstein and S. Ma. Mining Event Data for Actionable Patterns. In The Computer Measurement Group, 2000.
 
27
28
 
29
H. S. Javitz and A. Valdes. The SRI IDES Statistical Anomaly Detector. In IEEE Symposium on Security and Privacy, Oakland, CA. SRI International, May 1991.
 
30
 
31
M. Klemettinen. A Knowledge Discovery Methodology for Telecommunication Network Alarm Data. PhD thesis, University of Helsinky (Finland), 1999.
32
 
33
 
34
H. Mannila and H. Toivonen. Discovering Generalized Episodes Using Minimal Occurences. In 2nd Int'l Conf. on Knowledge Discovery and Data Mining, pages 146--151, 1996.
 
35
 
36
 
37
R. S. Michalski and R. E. Stepp. Automated Construction of Classifications: Conceptual Clustering Versus Numerical Taxonomy. IEEE Transactions on Pattern Analysis and Machine Intelligence, 5(4):396--410, 1983.
 
38
 
39
 
40
S. Staniford, J. A. Hoagland, and J. M. McAlerney. Practical Automated Detection of Stealthy Portscans. In ACM Computer and Communications Security IDS Workshop, pages 1--7, 2000.
 
41
 
42

CITED BY  19

Collaborative Colleagues:
Klaus Julisch: colleagues
Marc Dacier: colleagues