A comparative study of cuckoo search and bat algorithm for Bloom filter optimisation in spam filtering

摘要: Bloom filter (BF) is a simple but powerful data structure that can check membership to static set. The trade-off use certain configurable risk of false positives. odds positive be made very low if the hash bitmap sufficiently large. Spam an irrelevant or inappropriate message sent on internet large number newsgroups users. A spam word list well-known words often appear in mails. proposed system bin (BBF) groups into bins with different rates based weights words. Cuckoo search (CS) and bat algorithm are bio-inspired algorithms imitate way cuckoo breeding microbat foraging behaviours respectively. This paper demonstrates CS for minimising total invalidation cost BBFs by finding optimal elements stored every bin. experimental results demonstrate application various numbers strings.