{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:22:48Z","timestamp":1773840168601,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540410850","type":"print"},{"value":"9783540399452","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-39945-3_5","type":"book-chapter","created":{"date-parts":[[2007,4,14]],"date-time":"2007-04-14T02:38:33Z","timestamp":1176518313000},"page":"66-79","source":"Crossref","is-referenced-by-count":19,"title":["Using Finite Automata to Mine Execution Data for Intrusion Detection: A Preliminary Report"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Michael","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anup","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,11,11]]},"reference":[{"key":"5_CR1","series-title":"Applications of Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabalistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"L. Devroye, L. Gy\u00f6rfi, and G. Girosi. A Probabalistic Theory of Pattern Recognition, volume 31 of Applications of Mathematics. Springer-Verlag, New York, 1996."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013128. IEEE Computer Society, IEEE Computer Society Press, May 1996.","DOI":"10.1109\/SECPRI.1996.502675"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"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\u201348, 10 October 1997.","DOI":"10.1006\/inco.1997.2648"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"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\u201312. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0054059"},{"key":"5_CR5","unstructured":"Sandeep Kumar and Eugene Spafford. A pattern matching model for misuse intrusion detection. In Proceedings of the 17th National Computer Security Conference, pages 11\u201321, October 1994."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212\u2013261, 1994.","journal-title":"Information and Computation"},{"key":"5_CR7","unstructured":"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."},{"key":"5_CR8","unstructured":"B. A. Trakhtenbrot and Ya. A. Barzdin. Finite Automata: Behavior and Synthesis. North-Holland, 1973."},{"key":"5_CR9","series-title":"Springer Series in Statistics","volume-title":"Estimating Dependancies Based on Empirical Data","author":"V. Vapnik","year":"1982","unstructured":"V. Vapnik. Estimating Dependancies Based on Empirical Data. Springer Series in Statistics. Springer-Verlag, New York, 1982."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1103\/RevModPhys.65.499","volume":"65","author":"T. L. H. Watkin","year":"1993","unstructured":"T. L. H. Watkin, A. Rau, and M. Biehl. The stastical mechanics of learning a rule. Rev. Mod. Phys., 65:499\u2013556, 1993.","journal-title":"Rev. Mod. Phys."}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Intrusion Detection"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39945-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T05:34:41Z","timestamp":1556343281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39945-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410850","9783540399452"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-39945-3_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}