{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:31:06Z","timestamp":1725525066824},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642003981"},{"type":"electronic","value":"9783642003998"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00399-8_12","type":"book-chapter","created":{"date-parts":[[2009,2,7]],"date-time":"2009-02-07T01:51:04Z","timestamp":1233971464000},"page":"134-142","source":"Crossref","is-referenced-by-count":5,"title":["An Automata Based Authorship Identification System"],"prefix":"10.1007","author":[{"given":"Tsau Young","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shangxuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1093\/llc\/fqm020","volume":"22","author":"J. Grieve","year":"2007","unstructured":"Grieve, J.: Quantitative Authorship Attribution: An evaluation of Techniques. Literary and Linguistic Computing\u00a022(3), 251\u2013270 (2007)","journal-title":"Literary and Linguistic Computing"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Baliga, P., Lin, T.Y.: Kolmogorov Complexity Based Automata Modeling for Intrusion Detection. In: Proceeding of the 2005 IEEE International Conference on Granular Computing, Beijing, China, July 25-27, pp. 387\u2013392 (2005)","DOI":"10.1109\/GRC.2005.1547318"},{"issue":"3-4","key":"12_CR3","first-page":"225","volume":"18","author":"T.Y. Lin","year":"1993","unstructured":"Lin, T.Y.: Rough Patterns in Data-Rough Sets and Foundation of Intrusion Detection Systems. Journal of Foundation of Computer Science and Decision Support\u00a018(3-4), 225\u2013241 (1993)","journal-title":"Journal of Foundation of Computer Science and Decision Support"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-540-48061-7_62","volume-title":"New Directions in Rough Sets, Data Mining, and Granular-Soft Computing","author":"T.Y. Lin","year":"1999","unstructured":"Lin, T.Y.: Patterns in Numerical Data: Practical Approximations to Kolmogorov Complexity. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS, vol.\u00a01711, pp. 509\u2013513. Springer, Heidelberg (1999)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-58473-0_144","volume-title":"Grammatical Inference and Applications","author":"R.C. Carraso","year":"1994","unstructured":"Carraso, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS (LNAI), vol.\u00a0862, pp. 139\u2013152. Springer, Heidelberg (1994)"},{"key":"12_CR6","volume-title":"Introduction to Automata Theory, Language, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Language, and Computation. Addison Wesley, Reading (2001)"},{"key":"12_CR7","unstructured":"Paek, T., Chandrasekar, R.: Windows as a Second Language: An Overview of the Jargon Project. In: Proceedings of the First International Conference on Augmented Cognition (2005)"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1093\/llc\/17.4.401","volume":"17","author":"M. Koppel","year":"2002","unstructured":"Koppel, M., Argamon, S., Shimoni, A.: Automatically categorizing written texts by author gender. Literary and Linguistic Computing\u00a017(4), 401\u2013412 (2002)","journal-title":"Literary and Linguistic Computing"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Sekar, R., Bendre, M., Dhurjati, D., Bollineni, P.: A Fast Automaton-Based Method for Detecting Anomalous Program Behaviors. In: Proceedings. 2001 IEEE Symposium on Security and Privacy (2001)","DOI":"10.1109\/SECPRI.2001.924295"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Young-Lai, M., Tompa, F.: Stochastic Grammatical Inference of Text Database Structure. Machine Learning, 111\u2013137 (2000)","DOI":"10.1023\/A:1007653929870"},{"key":"12_CR11","volume-title":"Inference and disputed authorship: The Federalist","author":"F. Mosteller","year":"1964","unstructured":"Mosteller, F., Wallace, D.L.: Inference and disputed authorship: The Federalist. Addison-Wesley, Reading (1964)"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Applied Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00399-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T17:17:36Z","timestamp":1558113456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00399-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642003981","9783642003998"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00399-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}