{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T21:10:48Z","timestamp":1768425048638,"version":"3.49.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/coins49042.2020.9191381","type":"proceedings-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T21:18:24Z","timestamp":1599772704000},"page":"1-7","source":"Crossref","is-referenced-by-count":9,"title":["HAC-T and Fast Search for Similarity in Security"],"prefix":"10.1109","author":[{"given":"Jonathan","family":"Oliver","sequence":"first","affiliation":[]},{"given":"Muqeet","family":"Ali","sequence":"additional","affiliation":[]},{"given":"Josiah","family":"Hagen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046742"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66332-6_9"},{"key":"ref12","first-page":"5","article-title":"Hacga: An artifacts-based clustering approach for malware classification","author":"bo?ocan","year":"2017","journal-title":"2017 13th IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2015.04.001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2018.00010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CCST.2017.8167802"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5234"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRITO.2016.7784976"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45670-5_19"},{"key":"ref19","year":"2020","journal-title":"Locality Sensitive Hashing"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2017.12.004"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3268966.3268974"},{"key":"ref6","article-title":"Fishdbc: Flexible, incremental, scalable, hierarchical density-based clustering for arbitrary data and distance","author":"dell\u2019amico","year":"2019","journal-title":"arXiv preprint arXiv 1910 07283"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098196"},{"key":"ref8","first-page":"8","article-title":"Scalable, behavior-based malware clustering","volume":"9","author":"bayer","year":"2009","journal-title":"NDSS"},{"key":"ref7","article-title":"Experimental study of fuzzy hashing in malware clustering analysis","author":"li","year":"2015","journal-title":"8th Workshop on Cyber Security Experimentation and Test (CSET 15)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3176258.3176306"},{"key":"ref9","first-page":"187","article-title":"Mutantx-s: Scalable malware clustering based on static features","author":"hu","year":"0","journal-title":"Presented As Part of the 2013 USENIX Annual Technical Conference"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CTC.2013.9"},{"key":"ref20","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"malkov","year":"2018","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"ref21","author":"weber","year":"1997","journal-title":"An approximation-based data structure for similarity search"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"ref23","article-title":"On criteria for evaluating similarity digest schemes","author":"oliver","year":"0","journal-title":"2015 presented at DFRWS Europe"},{"key":"ref26","first-page":"226","article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume":"96","author":"ester","year":"1996","journal-title":"KDD"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033770"}],"event":{"name":"2020 International Conference on Omni-layer Intelligent Systems (COINS)","location":"Barcelona, Spain","start":{"date-parts":[[2020,8,31]]},"end":{"date-parts":[[2020,9,2]]}},"container-title":["2020 International Conference on Omni-layer Intelligent Systems (COINS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9186550\/9191368\/09191381.pdf?arnumber=9191381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:55:28Z","timestamp":1656345328000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9191381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/coins49042.2020.9191381","relation":{},"subject":[],"published":{"date-parts":[[2020,8]]}}}