作者: Arulanand Natarajan , S Subramanian
DOI: 10.1109/ICCCI.2012.6158857
关键词:
摘要: Bloom Filter (BF) is a simple but powerful data structure that can check membership to static set. The trade-off use filter certain configurable risk of false positives. odds positive be made very low if the hash bitmap sufficiently large. Bin (BBF) has number BFs with different rates based on their significance. Cuckoo Search (CS) employed assign which minimize total invalidation cost. experimental results have demonstrated for spam filtering using CS various numbers bins.