{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:08:30Z","timestamp":1765544910200,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031342035"},{"type":"electronic","value":"9783031342042"}],"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-34204-2_5","type":"book-chapter","created":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T23:04:18Z","timestamp":1686092658000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Critical Analysis of\u00a0Classifier Selection in\u00a0Learned Bloom Filters: The Essentials"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7574-697X","authenticated-orcid":false,"given":"Dario","family":"Malchiodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8171-8302","authenticated-orcid":false,"given":"Davide","family":"Raimondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2068-9293","authenticated-orcid":false,"given":"Giacomo","family":"Fumagalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6286-8871","authenticated-orcid":false,"given":"Raffaele","family":"Giancarlo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4170-0922","authenticated-orcid":false,"given":"Marco","family":"Frasca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"issue":"7","key":"5_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"5_CR2","first-page":"636","volume":"1","author":"A Broder","year":"2002","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters, a survey. Internet Math. 1, 636\u2013646 (2002)","journal-title":"Internet Math."},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J Carter","year":"1979","unstructured":"Carter, J., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Cho, K., van Merri\u00ebnboer, B., Bahdanau, D., Bengio, Y.: On the properties of neural machine translation: Encoder-decoder approaches. In: Proceedings of SSST-8, Eighth Workshop on Syntax, Semantics and Structure in Statistical Translation, pp. 103\u2013111. Association for Computational Linguistics, Doha, Qatar, October 2014","DOI":"10.3115\/v1\/W14-4012"},{"issue":"2","key":"5_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/j.2517-6161.1958.tb00292.x","volume":"20","author":"DR Cox","year":"1958","unstructured":"Cox, D.R.: The regression analysis of binary sequences. J. Roy. Stat. Soc.: Ser. B (Methodol.) 20(2), 215\u2013232 (1958)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Methodol.)"},{"key":"5_CR6","unstructured":"Dai, Z.: Adaptive learned bloom filter (ADA-BF): efficient utilization of the classifier (2022). https:\/\/github.com\/DAIZHENWEI\/Ada-BF. Checked 8 Nov 2022"},{"key":"5_CR7","unstructured":"Dai, Z., Shrivastava, A.: Adaptive Learned Bloom Filter (Ada-BF): efficient utilization of the classifier with application to real-time information filtering on the web. In: Advances in Neural Information Processing Systems, vol. 33, pp. 11700\u201311710. Curran Associates, Inc. (2020)"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/LES.2022.3156019","volume":"14","author":"Z Dai","year":"2022","unstructured":"Dai, Z., Shrivastava, A., Reviriego, P., Hern\u00e1ndez, J.A.: Optimizing learned bloom filters: how much should be learned? IEEE Embed. Syst. Lett. 14(3), 123\u2013126 (2022). https:\/\/doi.org\/10.1109\/LES.2022.3156019","journal-title":"IEEE Embed. Syst. Lett."},{"key":"5_CR9","volume-title":"Pattern Classification and Scene Analysis","author":"RO Duda","year":"1973","unstructured":"Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Willey, New York (1973)"},{"key":"5_CR10","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification. Wiley, New York (2000)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Freedman, D.: Statistical Models: Theory and Practice. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9781139165495"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Fumagalli, G., Raimondi, D., Giancarlo, R., Malchiodi, D., Frasca, M.: On the choice of general purpose classifiers in learned bloom filters: an initial analysis within basic filters. In: Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods (ICPRAM), pp. 675\u2013682 (2022)","DOI":"10.5220\/0010889000003122"},{"issue":"6","key":"5_CR13","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1093\/bioinformatics\/btaa911","volume":"37","author":"M Kirsche","year":"2020","unstructured":"Kirsche, M., Das, A., Schatz, M.C.: Sapling: accelerating suffix array queries with learned data models. Bioinformatics 37(6), 744\u2013749 (2020)","journal-title":"Bioinformatics"},{"issue":"12","key":"5_CR14","doi-asserted-by":"publisher","first-page":"3222","DOI":"10.14778\/3476311.3476392","volume":"14","author":"T Kraska","year":"2021","unstructured":"Kraska, T.: Towards instance-optimized data systems. Proc. VLDB Endow. 14(12), 3222\u20133232 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of the 2018 International Conference on Management of Data, SIGMOD 2018, pp. 489\u2013504. Association for Computing Machinery, New York, NY, USA (2018)","DOI":"10.1145\/3183713.3196909"},{"issue":"5","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3347711","volume":"52","author":"AC Lorena","year":"2019","unstructured":"Lorena, A.C., Garcia, L.P.F., Lehmann, J., Souto, M.C.P., Ho, T.K.: How complex is your classification problem? A survey on measuring classification complexity. ACM Comput. Surv. 52(5), 1\u201334 (2019)","journal-title":"ACM Comput. Surv."},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Malchiodi, D., Raimondi, D., Fumagalli, G., Giancarlo, R., Frasca, M.: A critical analysis of classifier selection in learned bloom filters (2022). https:\/\/doi.org\/10.48550\/ARXIV.2211.15565, https:\/\/arxiv.org\/abs\/2211.15565","DOI":"10.48550\/ARXIV.2211.15565"},{"key":"5_CR18","unstructured":"Maltry, M., Dittrich, J.: A critical analysis of recursive model indexes. CoRR abs\/2106.16166 (2021). https:\/\/arxiv.org\/abs\/2106.16166"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.neucom.2022.11.072","volume":"520","author":"GC Marin\u00f2","year":"2023","unstructured":"Marin\u00f2, G.C., Petrini, A., Malchiodi, D., Frasca, M.: Deep neural networks compression: a comparative survey and choice recommendations. Neurocomputing 520, 152\u2013170 (2023)","journal-title":"Neurocomputing"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: A model for learned bloom filters and optimizing by sandwiching. In: Advances in Neural Information Processing Systems, vol. 31 (2018)","DOI":"10.1007\/978-1-4614-8265-9_751"},{"issue":"4","key":"5_CR21","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1089\/cmb.2020.0431","volume":"28","author":"A Rahman","year":"2021","unstructured":"Rahman, A., Medevedev, P.: Representation of k-Mer sets using spectrum-preserving string sets. J. Comput. Biol. 28(4), 381\u2013394 (2021)","journal-title":"J. Comput. Biol."},{"key":"5_CR22","unstructured":"Raudys, S.: On the problems of sample size in pattern recognition. In: Detection, Pattern Recognition and Experiment Design. Proceedings of the 2nd All-Union Conference Statistical Methods in Control Theory. Publ. House \u201cNauka\u201d (1970)"},{"key":"5_CR23","unstructured":"Vaidya, K., Knorr, E., Kraska, T., Mitzenmacher, M.: Partitioned learned bloom filters. In: International Conference on Learning Representations (2021)"},{"issue":"3","key":"5_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, J.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"103077","DOI":"10.1016\/j.jnca.2021.103077","volume":"186","author":"Q Wu","year":"2021","unstructured":"Wu, Q., Wang, Q., Zhang, M., Zheng, R., Zhu, J., Hu, J.: Learned bloom-filter for the efficient name lookup in information-centric networking. J. Netw. Comput. Appl. 186, 103077 (2021)","journal-title":"J. Netw. Comput. Appl."}],"container-title":["Communications in Computer and Information Science","Engineering Applications of Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34204-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T21:44:27Z","timestamp":1729547067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34204-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031342035","9783031342042"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34204-2_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Engineering Applications of Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Le\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eann2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eannconf.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easyacademia","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","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":"41","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":"8","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":"33% - 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.4","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.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}