{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:43:38Z","timestamp":1743043418643,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030645793"},{"type":"electronic","value":"9783030645809"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64580-9_37","type":"book-chapter","created":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T18:17:02Z","timestamp":1609957022000},"page":"448-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Text Processing via Context Triggered Piecewise Hashing Algorithm for Spam Detection"],"prefix":"10.1007","author":[{"given":"Alexey","family":"Marchenko","sequence":"first","affiliation":[]},{"given":"Alexey","family":"Utki-Otki","sequence":"additional","affiliation":[]},{"given":"Dmitry","family":"Golubev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"unstructured":"Damage caused by spam, Kaspersky IT Encyclopedia, https:\/\/encyclopedia.kaspersky.com\/knowledge\/damage-caused-by-spam\/. Accessed 10 Jun 2020","key":"37_CR1"},{"unstructured":"Spam delivered through your company website, Kaspersky business blog, https:\/\/www.kaspersky.com\/blog\/contact-form-spam\/27880\/. Accessed 10 Jun 2020","key":"37_CR2"},{"doi-asserted-by":"crossref","unstructured":"Kornblum, J.: Identifying almost identical files using context triggered piecewise hashing, In: Proceedings of DFRWS 2006, pp. 91\u201397, Lafayette, Indiana (2006)","key":"37_CR3","DOI":"10.1016\/j.diin.2006.06.015"},{"unstructured":"Ester, M., Kriegel, H.-P., Sander, J., and Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis, E., Han, J., Fayyad, U. (eds.) Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, pp. 226\u2013231, AAAI Press, Portland, Oregon (1996)","key":"37_CR4"},{"unstructured":"Reaction to the DEC Spam of 1978, https:\/\/www.templetons.com\/brad\/spamreact.html. Accessed 10 Jun 2020","key":"37_CR5"},{"doi-asserted-by":"crossref","unstructured":"Chen, J., Fontugne, R., Kato, A., Fukuda, K.: Clustering spam campaigns with fuzzy hashing, In: Proceedings of AINTEC Asian Internet Eng. Conf., pp. 66, Chiang Mai, Thailand (2014)","key":"37_CR6","DOI":"10.1145\/2684793.2684803"},{"unstructured":"Usage of fuzzy hashes, https:\/\/rspamd.com\/doc\/fuzzy_storage.html. Accessed 10 Jun 2020","key":"37_CR7"},{"key":"37_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"unstructured":"Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, \u201cLevenshtein distance\u201d, Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 May 2019, https:\/\/www.nist.gov\/dads\/HTML\/Levenshtein.html. Accessed 10 Jun 2020","key":"37_CR9"},{"unstructured":"Benkovich, N., Dedenok, R., Golubev, D.: Deepquarantine for suspicious mail, arXiv 305 preprint arXiv:2001.04168 (2020)","key":"37_CR10"},{"unstructured":"Broder, A.Z.: On the resemblance and containment of documents, In: Proceedings of Compression and Complexity of SEQUENCES 1997, pp. 21\u201329, IEEE Computer Society, Los Alamitos, California (1998)","key":"37_CR11"},{"unstructured":"Wallace, B.: Optimizing ssDeep for use at scale, Grooten, M. (ed.), Virus Bulletin, Cylance, USA (2015)","key":"37_CR12"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64580-9_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T18:46:11Z","timestamp":1609958771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64580-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030645793","9783030645809"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64580-9_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"7 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siena","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2020.icas.xyz\/","order":11,"name":"conference_url","label":"Conference URL","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":"in-house system and easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"209","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":"116","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":"56% - 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":"5-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":"1-2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}