{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T21:04:41Z","timestamp":1725915881089},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319697086"},{"type":"electronic","value":"9783319697109"}],"license":[{"start":{"date-parts":[[2017,11,11]],"date-time":"2017-11-11T00:00:00Z","timestamp":1510358400000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-69710-9_7","type":"book-chapter","created":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T14:25:34Z","timestamp":1510323934000},"page":"94-103","source":"Crossref","is-referenced-by-count":2,"title":["Multi-centroid Cluster Analysis in Malware Research"],"prefix":"10.1007","author":[{"given":"Ciprian","family":"Opri\u015fa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Cab\u0103u","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gheorghe","family":"Sebestyen Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,11]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abou-Assaleh, T., Cercone, N., Ke\u0161elj, V., Sweidan, R.: N-gram-based detection of new malicious code. In: Proceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004, vol. 2, pp. 41\u201342. IEEE (2004)","DOI":"10.1109\/CMPSAC.2004.1342667"},{"key":"7_CR2","unstructured":"Bayer, U., Comparetti, P.M., Hlauschek, C., Kruegel, C., Kirda, E.: Scalable, behavior-based malware clustering. In: NDSS, vol. 9, pp. 8\u201311. Citeseer (2009)"},{"issue":"2","key":"7_CR3","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1504\/IJESDF.2007.016865","volume":"1","author":"D Bilar","year":"2007","unstructured":"Bilar, D.: Opcodes as predictor for malware. Int. J. Electr. Secur. Digit. Forensics 1(2), 156\u2013168 (2007)","journal-title":"Int. J. Electr. Secur. Digit. Forensics"},{"key":"7_CR4","volume-title":"Computer Security: Art and Science","author":"M Bishop","year":"2002","unstructured":"Bishop, M.: Computer Security: Art and Science. Addison-Wesley, Reading (2002)"},{"issue":"4","key":"7_CR5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0167-4048(89)90089-8","volume":"8","author":"F Cohen","year":"1989","unstructured":"Cohen, F.: Computational aspects of computer viruses. Comput. Secur. 8(4), 297\u2013298 (1989)","journal-title":"Comput. Secur."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Colesa, A.: Fast creation of short-living virtual machines using copy-on-write ram-disks. In: 2014 IEEE International Conference on Automation, Quality and Testing, Robotics, pp. 1\u20136. IEEE (2014)","DOI":"10.1109\/AQTR.2014.6857854"},{"issue":"4","key":"7_CR7","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"7_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","volume":"86","author":"ST Hedetniemi","year":"1990","unstructured":"Hedetniemi, S.T., Laskar, R.C.: Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Math. 86(1), 257\u2013277 (1990)","journal-title":"Discrete Math."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 38\u201349. ACM (1973)","DOI":"10.1145\/800125.804034"},{"key":"7_CR10","unstructured":"Kann, V.: On the approximability of NP-complete optimization problems. Ph.d. thesis, Royal Institute of Technology Stockholm (1992)"},{"key":"7_CR11","unstructured":"MacQueen, J., et\u00a0al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, California, USA, pp. 281\u2013297 (1967)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Oprisa, C., Cabau, G., Colesa, A.: From plagiarism to malware detection. In: 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 227\u2013234. IEEE (2013)","DOI":"10.1109\/SYNASC.2013.37"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Oprisa, C., Checiches, M., Nandrean, A.: Locality-sensitive hashing optimizations for fast malware clustering. In: 2014 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP), pp. 97\u2013104. IEEE (2014)","DOI":"10.1109\/ICCP.2014.6936960"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"van Rooij, J.M., Nederlof, J., van Dijk, T.C.: Inclusion\/exclusion meets measure and conquer. In: Algorithms-ESA 2009, pp. 554\u2013565. Springer (2009)","DOI":"10.1007\/978-3-642-04128-0_50"},{"issue":"1","key":"7_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/2190-8532-1-1","volume":"1","author":"A Shabtai","year":"2012","unstructured":"Shabtai, A., Moskovitch, R., Feher, C., Dolev, S., Elovici, Y.: Detecting unknown malicious code by applying classification techniques on opcode patterns. Secur. Inf. 1(1), 1\u201322 (2012)","journal-title":"Secur. Inf."},{"issue":"1","key":"7_CR16","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson, R.: Slink: an optimally efficient algorithm for the single-link cluster method. Comput. J. 16(1), 30\u201334 (1973)","journal-title":"Comput. J."},{"issue":"345\u2013363","key":"7_CR17","first-page":"5","volume":"58","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. J. Math. 58(345\u2013363), 5 (1936)","journal-title":"J. Math."},{"issue":"4","key":"7_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s11416-012-0166-z","volume":"8","author":"C Vatamanu","year":"2012","unstructured":"Vatamanu, C., Gavrilu\u0163, D., Benchea, R.: A practical approach on clustering malicious pdf documents. J. Comput. Virol. 8(4), 151\u2013163 (2012)","journal-title":"J. Comput. Virol."}],"container-title":["Advances in Intelligent Systems and Computing","EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69710-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T12:39:49Z","timestamp":1603283989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69710-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,11]]},"ISBN":["9783319697086","9783319697109"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69710-9_7","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,11,11]]}}}