{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:15:13Z","timestamp":1778494513721,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2020,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>A Bloom filter is a special case of an artificial neural network with two layers. Traditionally, it is seen as a simple data structure supporting membership queries on a set. The standard Bloom filter does not support the delete operation, and therefore, many applications use a counting Bloom filter to enable deletion. This paper proposes a generalization of the counting Bloom filter approach, called \u201cautoscaling Bloom filters\u201d, which allows adjustment of its capacity with probabilistic bounds on false positives and true positives. Thus, by relaxing the requirement on perfect true positive rate, the proposed autoscaling Bloom filter addresses the major difficulty of Bloom filters with respect to their scalability. In essence, the autoscaling Bloom filter is a binarized counting Bloom filter with an adjustable binarization threshold. We present the mathematical analysis of its performance and provide a procedure for minimizing its false positive rate.<\/jats:p>","DOI":"10.1007\/s00521-019-04397-1","type":"journal-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T12:03:30Z","timestamp":1565352210000},"page":"3675-3684","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Autoscaling Bloom filter: controlling trade-off between true and false positives"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6032-6155","authenticated-orcid":false,"given":"Denis","family":"Kleyko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abbas","family":"Rahimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ross W.","family":"Gayler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evgeny","family":"Osipov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"issue":"188","key":"4397_CR1","first-page":"5","volume":"2","author":"V Gritsenko","year":"2017","unstructured":"Gritsenko V, Rachkovskij D, Frolov A, Gayler R, Kleyko D, Osipov E (2017) Neural distributed autoassociative memories: a survey. Cybern Comput Eng 2(188):5\u201335","journal-title":"Cybern Comput Eng"},{"issue":"3","key":"4397_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1207\/s15516709cog1203_4","volume":"12","author":"D Touretzky","year":"1988","unstructured":"Touretzky D, Hinton G (1988) A distributed connectionist production system. Cognit Sci 12(3):423\u2013466","journal-title":"Cognit Sci"},{"issue":"3","key":"4397_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan L, Cao P, Almeida J, Broder A (2000) Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans Netw 8(3):281\u2013293","journal-title":"IEEE\/ACM Trans Netw"},{"key":"4397_CR4","doi-asserted-by":"crossref","unstructured":"Donnet B, Baynat B, Friedman T (2006) Retouched Bloom filters: allowing networked applications to trade off selected false positives against false negatives. In: ACM CoNEXT conference, pp 1\u201312","DOI":"10.1145\/1368436.1368454"},{"key":"4397_CR5","doi-asserted-by":"crossref","unstructured":"Akhlaghi V, Rahimi A, Gupta RK (2016) Resistive Bloom filters: from approximate membership to approximate computing with bounded errors. In: Conference on Design, Automation and Test in Europe (DATE), pp 1\u20134","DOI":"10.3850\/9783981537079_0530"},{"issue":"2","key":"4397_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/69.917565","volume":"3","author":"DA Rachkovskij","year":"2001","unstructured":"Rachkovskij DA (2001) Representation and processing of structures with binary sparse distributed codes. IEEE Trans Knowl Data Eng 3(2):261\u2013276","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"4397_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s12559-009-9009-8","volume":"1","author":"P Kanerva","year":"2009","unstructured":"Kanerva P (2009) Hyperdimensional computing: an introduction to computing in distributed representation with high-dimensional random vectors. Cognit Comput 1(2):139\u2013159","journal-title":"Cognit Comput"},{"key":"4397_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ipl.2017.09.004","volume":"129","author":"F Grandi","year":"2018","unstructured":"Grandi F (2018) On the analysis of Bloom filters. Inf Process Lett 129:35\u201339","journal-title":"Inf Process Lett"},{"issue":"1","key":"4397_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","volume":"14","author":"S Tarkoma","year":"2012","unstructured":"Tarkoma S, Rothenberg CE, Lagerspetz E (2012) Theory and practice of Bloom filters for distributed systems. IEEE Commun Surv Tutor 14(1):131\u2013155","journal-title":"IEEE Commun Surv Tutor"},{"issue":"4","key":"4397_CR10","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder A, Mitzenmacher M (2004) Network applications of Bloom filters: a survey. Internet Math 1(4):485\u2013509","journal-title":"Internet Math"},{"issue":"1","key":"4397_CR11","first-page":"506","volume":"12","author":"SMR Kazemi","year":"2018","unstructured":"Kazemi SMR, Bidgoli BM, Shamshirband S, Karimi SM, Ghorbani MA, Chau KW, Pour RK (2018) Novel genetic-based negative correlation learning for estimating soil temperature. Eng Appl Comput Fluid Mech 12(1):506\u2013516","journal-title":"Eng Appl Comput Fluid Mech"},{"key":"4397_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.jhydrol.2011.01.017","volume":"399","author":"CL Wu","year":"2011","unstructured":"Wu CL, Chau KW (2011) Rainfall-runoff modeling using artificial neural network coupled with singular spectrum analysis. J Hydrol 399:394\u2013409","journal-title":"J Hydrol"},{"issue":"4","key":"4397_CR13","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TDSC.2015.2467385","volume":"14","author":"K Rabieh","year":"2017","unstructured":"Rabieh K, Mahmoud M, Akkaya K, Tonyali S (2017) Scalable certificate revocation schemes for smart grid AMI networks using Bloom filters. IEEE Trans Dependable Secure Comput 14(4):420\u2013432","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"7","key":"4397_CR14","doi-asserted-by":"publisher","first-page":"1959","DOI":"10.1007\/s00521-015-1989-6","volume":"27","author":"H Ma","year":"2016","unstructured":"Ma H, Tseng YC, Chen LI (2016) A CMAC-based scheme for determining membership with classification of text strings. Neural Comput Appl 27(7):1959\u20131967","journal-title":"Neural Comput Appl"},{"issue":"1","key":"4397_CR15","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s00521-016-2358-9","volume":"28","author":"M Anbar","year":"2017","unstructured":"Anbar M, Abdullah R, Munther A, Al-Betar MA, Saad RMA (2017) NADTW: new approach for detecting TCP worm. Neural Comput Appl 28(1):525\u2013538","journal-title":"Neural Comput Appl"},{"key":"4397_CR16","doi-asserted-by":"crossref","unstructured":"Lu J, Wan Y, Li Y, Zhang C, Dai H, Wang Y, Zhang G, Liu B (2017) Ultra-fast Bloom filters using SIMD techniques. In: 2017 IEEE\/ACM 25th International Symposium on Quality of Service (IWQoS), pp 1\u20136","DOI":"10.1109\/IWQoS.2017.7969125"},{"issue":"11","key":"4397_CR17","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1049\/iet-com.2016.0641","volume":"11","author":"Y Zhang","year":"2017","unstructured":"Zhang Y, Zheng Z, Zhang X (2017) Efficient Bloom filter for network protocols using AES instruction set. IET Commun 11(11):1815\u20131821","journal-title":"IET Commun"},{"issue":"4","key":"4397_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.ipl.2013.11.015","volume":"114","author":"S Pontarelli","year":"2014","unstructured":"Pontarelli S, Reviriego P, Mitzenmacher M (2014) Improving the performance of invertible bloom lookup tables. Inf Process Lett 114(4):185\u2013191","journal-title":"Inf Process Lett"},{"issue":"11","key":"4397_CR19","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.14778\/2350229.2350275","volume":"5","author":"M Bender","year":"2012","unstructured":"Bender M, Farach-Colton M, Johnson R, Kraner R, Kuszmaul B, Medjedovic D, Montes P, Shetty P, Spillane RP, Zadok E (2012) Don\u2019t thrash: how to cache your hash on flash. Proc VLDB Endow 5(11):1627\u20131637","journal-title":"Proc VLDB Endow"},{"key":"4397_CR20","doi-asserted-by":"crossref","unstructured":"Pandey P, Bender M, Johnson R, Patro R (2017) A general-purpose counting filter: making every bit count. In: SIGMOD\u201917 Proceedings of the 2017 ACM international conference on management of data, pp 775\u2013787","DOI":"10.1145\/3035918.3035963"},{"issue":"4","key":"4397_CR21","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1109\/TNET.2017.2685530","volume":"25","author":"G Einziger","year":"2017","unstructured":"Einziger G, Friedman R (2017) TinySet\u2014an access efficient self adjusting Bloom filter construction. IEEE\/ACM Trans Netw 25(4):2295\u20132307","journal-title":"IEEE\/ACM Trans Netw"},{"key":"4397_CR22","doi-asserted-by":"crossref","unstructured":"Fan B, Andersen D, Kaminsky M, Mitzenmacher M (2014) Cuckoo filter: practically better than bloom. In: CoNEXT\u201914 Proceedings of the 10th ACM international on conference on emerging networking experiments and technologies, pp 75\u201388","DOI":"10.1145\/2674005.2674994"},{"issue":"2","key":"4397_CR23","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/LCOMM.2016.2624286","volume":"21","author":"H Lim","year":"2017","unstructured":"Lim H, Lee J, Byun H, Yim C (2017) Ternary Bloom filter replacing counting Bloom filter. IEEE Commun Lett 21(2):278\u2013281","journal-title":"IEEE Commun Lett"},{"issue":"6","key":"4397_CR24","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1109\/LCOMM.2010.06.100344","volume":"14","author":"CE Rothenberg","year":"2010","unstructured":"Rothenberg CE, Macapuna CAB, Verdi FL, Magalhaes MF (2010) The deletable Bloom filter: a new member of the Bloom family. IEEE Commun Lett 14(6):557\u2013559","journal-title":"IEEE Commun Lett"},{"issue":"11","key":"4397_CR25","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1109\/LCOMM.2015.2478462","volume":"19","author":"H Lim","year":"2015","unstructured":"Lim H, Lee J, Yim C (2015) Complement Bloom filter for identifying true positiveness of a Bloom Filter. IEEE Commun Lett 19(11):1905\u20131908","journal-title":"IEEE Commun Lett"},{"key":"4397_CR26","unstructured":"Carrea L, Vernitski A, Reed M (2016) Yes-no Bloom filter: a way of representing sets with fewer false positives. ArXiv 160301060:1\u201328"},{"issue":"4","key":"4397_CR27","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.ipl.2015.11.002","volume":"116","author":"S Pontarelli","year":"2016","unstructured":"Pontarelli S, Reviriego P, Maestro J (2016) Improving counting Bloom filter performance with fingerprints. Inf Process Lett 116(4):304\u2013309","journal-title":"Inf Process Lett"},{"issue":"4","key":"4397_CR28","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.12785\/amis\/080445","volume":"8","author":"H Lim","year":"2014","unstructured":"Lim H, Lee N, Lee J, Yim C (2014) Reducing false positives of a Bloom filter using cross-checking Bloom filters. Appl Math Inf Sci 8(4):1865\u20131877","journal-title":"Appl Math Inf Sci"},{"issue":"6","key":"4397_CR29","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ipl.2006.10.007","volume":"101","author":"P Almeida","year":"2007","unstructured":"Almeida P, Baquero C, Preguica N, DHutchison (2007) Scalable Bloom filters. Inf Process Lett 101(6):255\u2013261","journal-title":"Inf Process Lett"},{"issue":"4","key":"4397_CR30","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TNET.2013.2272604","volume":"22","author":"O Rottenstreich","year":"2014","unstructured":"Rottenstreich O, Kanizo Y, Keslassy I (2014) The variable-increment counting Bloom filter. IEEE\/ACM Trans Netw 22(4):1092\u20131105","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"4397_CR31","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ipl.2008.05.018","volume":"108","author":"P Bose","year":"2008","unstructured":"Bose P, Guo H, Kranakis E, Maheshwari A, Morin P, Morrison J, Smid M, Tang Y (2008) On the false-positive rate of Bloom filters. Inf Process Lett 108(4):210\u2013213","journal-title":"Inf Process Lett"},{"issue":"21","key":"4397_CR32","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1016\/j.ipl.2010.07.024","volume":"110","author":"K Christensen","year":"2010","unstructured":"Christensen K, Roginsky A, Jimeno M (2010) A new analysis of the false positive rate of a Bloom filter. Inf Process Lett 110(21):944\u2013949","journal-title":"Inf Process Lett"},{"key":"4397_CR33","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1162\/neco_a_01084","volume":"30","author":"EP Frady","year":"2018","unstructured":"Frady EP, Kleyko D, Sommer FT (2018) A theory of sequence indexing and working memory in recurrent neural networks. Neural Comput 30:1449\u20131513","journal-title":"Neural Comput"},{"key":"4397_CR34","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett T (2006) An introduction to ROC analysis. Pattern Recognit Lett 27:861\u2013874","journal-title":"Pattern Recognit Lett"},{"key":"4397_CR35","doi-asserted-by":"crossref","unstructured":"Bonomi F, Mitzenmacher M, Panigrahy R, Singh S, Varghese G (2006) An improved construction for counting Bloom filters. In: 14th Annual European Symposium on Algorithms, LNCS 4168, pp 684\u2013695","DOI":"10.1007\/11841036_61"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04397-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-019-04397-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-019-04397-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T09:37:51Z","timestamp":1778492271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-019-04397-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,9]]},"references-count":35,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["4397"],"URL":"https:\/\/doi.org\/10.1007\/s00521-019-04397-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,9]]},"assertion":[{"value":"2 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}