{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:03:16Z","timestamp":1756382596635,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031366215"},{"type":"electronic","value":"9783031366222"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36622-2_9","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"106-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hierarchical Heterogeneous Ant Colony Optimization Based Approach to Optimize File Similarity Searches Using ssDeep"],"prefix":"10.1007","author":[{"given":"N. K.","family":"Sreelaja","sequence":"first","affiliation":[]},{"given":"N. K.","family":"Sreeja","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"9_CR1","unstructured":"Wallace, B.: Optimizing ssDeep for Use at Scale. Cylance, USA (2015). Grooten, M. (ed.)"},{"key":"9_CR2","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Proceedings of the 1997 International Conference on Compression and Complexity of Sequences, pp. 21\u201329, June 1997 (1997)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Breitinger, F., Guttman, B., McCarrin, M., Roussev, V., White, D.: Approximate matching: definition and terminology. Natl. Inst. Stand. Technol. 800, Article ID 168 (2014)","DOI":"10.6028\/NIST.SP.800-168"},{"key":"9_CR4","unstructured":"Wu, G.: String Similarity Metrics, Edit Distance. https:\/\/www.baeldung.com\/cs\/author\/gangwu"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-13136-3_25","volume-title":"Algorithms and Architectures for Parallel Processing","author":"Z Jianzhong","year":"2010","unstructured":"Jianzhong, Z., Kai, P., Yuntao, Y., Jingdong, X.: iCTPH: an approach to publish and lookup CTPH digests in chord. In: Hsu, C.-H., Yang, L.T., Park, J.H., Yeo, S.-S. (eds.) ICA3PP 2010. LNCS, vol. 6082, pp. 244\u2013253. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13136-3_25"},{"key":"9_CR6","unstructured":"Abrahamy, J.: Intezer Community Tip: How to Optimize ssDeep Comparisons with ElasticSearch. https:\/\/www.intezer.com\/blog\/malware-analysis\/intezer-community-tip-ssdeep-comparisons-with-elasticsearch\/. Accessed 19 Sept 2017"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Rusin, M., Zaitseva, E.: Hierarchical heterogeneous ant colony optimization. In: Proceedings of the IEEE Federated Conference on Computer Science and Information Systems, pp. 197\u2013203 (2012)","DOI":"10.1109\/DT.2013.6566300"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-78743-1_28","volume-title":"Advances in Swarm Intelligence","author":"NK Sreelaja","year":"2021","unstructured":"Sreelaja, N.K., Sreeja, N.K.: An ant colony optimization based approach for binary search. In: Tan, Y., Shi, Y. (eds.) ICSI 2021. LNCS, vol. 12689, pp. 311\u2013321. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78743-1_28"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Moia, V.H.G., Henriques, M.A.A.: Similarity digest search: a survey and comparative analysis of strategies to perform known file filtering using approximate matching. Secur. Commun. Netw. 2017, 17 (2017). Article ID 1306802","DOI":"10.1155\/2017\/1306802"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Winter, C., Schneider, M., Yannikos, Y.: F2S2: fast forensic similarity search through indexing piecewise hash signatures. Digit. Investig. 10(4), 361\u2013371 (2013)","DOI":"10.1016\/j.diin.2013.08.003"},{"key":"9_CR11","unstructured":"http:\/\/ssdeep.sourceforge.net\/ (http:\/\/ssdeep.sourceforge.net\/)"},{"key":"9_CR12","unstructured":"https:\/\/www.nist.gov\/itl\/ssd\/software-quality-group\/ssdeep-datasets"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36622-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:15:51Z","timestamp":1710260151000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36622-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366215","9783031366222"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36622-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}