{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:46:25Z","timestamp":1725453985887},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642337031"},{"type":"electronic","value":"9783642337048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33704-8_17","type":"book-chapter","created":{"date-parts":[[2012,10,9]],"date-time":"2012-10-09T13:12:43Z","timestamp":1349788363000},"page":"191-202","source":"Crossref","is-referenced-by-count":6,"title":["Using Behavioral Modeling and Customized Normalcy Profiles as Protection against Targeted Cyber-Attacks"],"prefix":"10.1007","author":[{"given":"Andrey","family":"Dolgikh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Nykodym","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Skormin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary","family":"Birnbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Percoco, N., Ilyas, J.: Malware Freakshow 2010: White paper for Black Hat USA (2010)"},{"key":"17_CR2","unstructured":"Falliere, N., Murchu, L., Chien, E.: W32.Stuxnet Dossier: Symantec security response version 1.4 (2011)"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D.J. Cook","year":"2000","unstructured":"Cook, D.J., Holder, L.B.: Graph-based data mining. IEEE Intelligent Systems and their Applications\u00a015(2), 32\u201341 (2000)","journal-title":"IEEE Intelligent Systems and their Applications"},{"key":"17_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Peshkin, L.: Structure induction by lossless graph compression. In: Data Compression Conference, DCC, pp. 53\u201362 (2007)","DOI":"10.1109\/DCC.2007.73"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Hayashida, M., Akutsu, T.: Comparing Biological Networks via Graph Compression. In: Symposium on Optimization and Systems Biology (2009)","DOI":"10.1186\/1752-0509-4-S2-S13"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Choi, Y., Szpankowski, W.: Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments. IEEE Transactions on Information Theory (2012)","DOI":"10.1109\/TIT.2011.2173710"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.3390\/a5020214","volume":"5","author":"S. Maruyama","year":"2012","unstructured":"Maruyama, S., Sakamoto, H., Takeda, M.: An Online Algorithm for Lightweight Grammar-Based Compression. Algorithms\u00a05(2), 214\u2013235 (2012)","journal-title":"Algorithms"},{"key":"17_CR9","unstructured":"Offensive Computing, \n                    \n                      http:\/\/offensivecomputing.net\/\n                    \n                    \n                   (accessed, November 2011)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Dolgikh, A., Nykodym, T., Skormin, V., Antonakos, J.: Colored Petri nets as the enabling technology in intrusion detection systems. In: Military Communications Conference, MILCOM 2011, pp. 1297\u20131301 (2011)","DOI":"10.1109\/MILCOM.2011.6127481"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Chen, C., Lin, C.X., Fredrikson, M., Christodorescu, M., Yan, X.: Mining graph patterns efficiently via randomized summaries. In: Proceedings VLDB Endow, vol.\u00a02(1), pp. 742\u2013753 (2009)","DOI":"10.14778\/1687627.1687711"}],"container-title":["Lecture Notes in Computer Science","Computer Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33704-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:19:27Z","timestamp":1620130767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33704-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642337031","9783642337048"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33704-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}