Using finite automata to mine execution data for intrusion detection: A preliminary report

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1907, Issue , 2000, Pages 66-79

  Michael, Christoph ^a   Ghosh, Anup ^a  

^a RST Res Labs   (United States)

Author keywords

Data mining; Feature detection; Finite automata; Machine learning

Indexed keywords

ANOMALY DETECTION; DATA MINING; FINITE AUTOMATA; INTRUSION DETECTION; LEARNING SYSTEMS;

ANOMALY DETECTION SYSTEMS; AUTOMATICALLY GENERATED; EXISTING SYSTEMS; FEATURE DETECTION; INTERNET EXPLORERS; MALICIOUS BEHAVIOR; MALICIOUS EXECUTABLES; PROGRAM EXECUTION;

WEB BROWSERS;

EID: 84944239503     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39945-3_5     Document Type: Conference Paper

References (10)

1. L. Devroye, L. Györfi, and G. Girosi. A Probabalistic Theory of Pattern Recognition, volume 31 of Applications of Mathematics. Springer-Verlag, New York, 1996. 67
2. Stephanie Forrest, Steven A. Hofmeyr, Anil Somayaji, and Thomas A. Longstaff. A sense of self for unix processes. In Proceedinges of the 1996 IEEE Symposium on Research in Security and Privacy, pages 120–128. IEEE Computer Society, IEEE Computer Society Press, May 1996. 66
3. Yoav Freund, Michael Kearns, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, and Linda Sellie. Efficient learning of typical finite automata from random walks. Information and Computation, 138(1):23–48, 10 October 1997. 70
4. R. Price K. Lang, B. Pearlmutter. Results of the abbadingo one dfa learning competition and a new evidence driven state merging algorithm. In Proceedings of the International Colloquium on Grammatical Inference (ICGA-98), volume 1433 of Lecture Notes in Artificial Intelligence, pages 1–12. Springer-Verlag, 1998. 69
5. Sandeep Kumar and Eugene Spafford. A pattern matching model for misuse intrusion detection. In Proceedings of the 17th National Computer Security Conference, pages 11–21, October 1994. 66
6. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212–261, 1994. 79
7. S. Staniford-Chen, S. Cheung, R. Crawford, M. Dilger, J. Frank, J. Hoagland, K. Levitt, C. Wee, R. Yip, and D. Zerkle. GrIDS – A Graph Based Intrusion Detection System for Large Networks. In Proceedings of the 19th National Information Systems Security Conference, 1996. 66
8. B. A. Trakhtenbrot and Ya. A. Barzdin. Finite Automata: Behavior and Synthesis. North-Holland, 1973. 70
9. V. Vapnik. Estimating Dependancies Based on Empirical Data. Springer Series in Statistics. Springer-Verlag, New York, 1982. 79
10. T. L. H. Watkin, A. Rau, and M. Biehl. The stastical mechanics of learning a rule. Rev. Mod. Phys., 65:499–556, 1993. 67