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

International Journal of Bio-Inspired Computation

Volumn 4, Issue 2, 2012, Pages 89-99

  Natarajan, Arulanand ^a   Subramanian, S ^b   Premalatha, K ^c  

^a ANNA UNIVERSITY   (India)

^b SRI KRISHNA COLLEGE OF ENGINEERING AND TECHNOLOGY   (India)

^c BANNARI AMMAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Bat algorithm; BBF; BF; Bin Bloom filter; Bloom filter; CS; Cuckoo search; False positive rate; Hash function; Spam word

Indexed keywords

BIOMIMETICS; CESIUM; DATA STRUCTURES; ECONOMIC AND SOCIAL EFFECTS; HASH FUNCTIONS; INTELLIGENT COMPUTING; OPTIMIZATION;

BAT ALGORITHMS; BIN BLOOM FILTERS; BLOOM FILTERS; CUCKOO SEARCHES; FALSE POSITIVE RATES; SPAM WORDS;

ELECTRONIC MAIL FILTERS;

EID: 84861882160     PISSN: 17580366     EISSN: 17580374     Source Type: Journal    
DOI: 10.1504/IJBIC.2012.047179     Document Type: Article

References (36)

1. Bauer, D., Hurley, P., Pletka, R. and Waldvogel, M. (2004) 'Bringing efficient advanced queries to distributed hash tables', Proc. IEEE Conf. Local Computer Networks, pp. 6-14. (Pubitemid 40845188)
2. Bloom, B. (1970) 'Space/time tradeoffs in hash coding with allowable errors', Communications of the ACM, Vol. 13, No. 7, pp. 422-426.
3. Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S. and Varghese, G. (2006) 'Beyond bloom filters: from approximate membership checks to approximate state machines', Proc. ACM SIGCOMM, pp. 315-326. (Pubitemid 44623737)
4. Broder, A. and Mitzenmacher, M. (2005) 'Network applications of bloom filters: a survey', Internet Math., Vol. 1, No. 4, pp. 485-509.
5. Chazelle, B., Kilian, J., Rubinfeld, R. and Tal, A. (2004) 'The Bloomier filter: an efficient data structure for static support lookup tables', Proc. Fifth Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 30-39.
6. Chen, H., Jin, H., Chen, L., Liu, Y. and Ni, L. (2011) 'Optimizing bloom filter settings in peer-to-peer multi-keyword searching', IEEE Transactions on Knowledge and Data Engineering, Vol. PP, No. 99, p.1.
7. Cohen, S. and Matias, Y. (2003) 'Spectral bloom filters', Proc. 22nd ACM SIGMOD, pp. 241-252.
8. Cuena-Acuna, F.M., Peery, C., Martin, R.P. and Nguyen, T.D. (2003) 'PlantP: using gossiping to build content addressable peer-to-peer information sharing communities', Proc. 12th IEEE Int'l. Symp. High Performance Distributed Computing, pp. 236-249.
9. Deng, F. and Rafiei, D. (2006) 'Approximately detecting duplicates for streaming data using stable bloom filters', Proc. 25th ACMSIGMOD, pp. 25-36. (Pubitemid 46946501)
10. Fan, L., Cao, P., Almeida, J. and Broder, A. (2000) 'Summary cache: a scalable wide area web cache sharing protocol', IEEE/ACM Trans. Networking, Vol. 8, No. 3, pp. 281-293.
11. Guo, D., Wu, J., Chen, H., Yuan, Y. and Luo, X. (2010) 'The dynamic bloom filters', IEEE Transactions on Knowledge and Data Engineering, Vol. 22, No. 1, pp. 120-123.
12. Hao, F., Kodialam, M. and Lakshman, T.V. (2007) 'Building high accuracy bloom filters using partitioned hashing', Proc. SIGMETRICS/Performance, pp. 277-287.
13. Hodes, T.D., Czerwinski, S.E. and Zhao, B.Y. (2002) 'An architecture for secure wide area service discovery', Wireless Networks, Vol. 8, Nos. 2/3, pp. 213-230. (Pubitemid 34168128)
14. Jin, C., Qian, W. and Zhou, A. (2004) 'Analysis and management of streaming data: a survey', J. Software, Vol. 15, No. 8, pp. 1172-1181.
15. Kirsch, A. and Mitzenmacher, M. (2006a) 'Building a better bloom filter', Technical Report tr-02-05.pdf, Dept. of Computer Science, Harvard Univ.
16. Kirsch, A. and Mitzenmacher, M. (2006b) 'Distance-sensitive bloom filters', Proc. Eighth Workshop Algorithm Eng. and Experiments (ALENEX '06).
17. Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P. and Geels, D. (2000) 'Oceanstore: an architecture for global-scale persistent storage', ACM SIGPLAN Notices, Vol. 35, No. 11, pp. 190-201. (Pubitemid 32470898)
18. Kumar, A., Xu, J., Wang, J., Spatschek, O. and Li, L. (2004) 'Space-code bloom filter for efficient per-flow traffic measurement', Proc. 23rd IEEE INFOCOM, pp. 1762-1773.
19. Lauber, P. (1968) Bats: Wings in the Night, Random House, New York.
20. Laufer, R.P., Velloso, P.B. and Duarte, O.C.M.B. (2005) 'Generalized bloom filters', Technical Report Research Report GTA-05-43, Univ. of California, Los Angeles (UCLA).
21. Li, J., Taylor, J., Serban, L. and Seltzer, M. (2002) 'Self-organization in peer-to-peer system', Proc. ACM SIGOPS.
22. Li, K. and Zhong, Z. (2006) 'Fast statistical spam filter by approximate classifications', Proc. Joint Int'l. Conf. Measurement and Modeling of Computer Systems, SIGMETRICS/Performance, pp. 347-358. (Pubitemid 44619104)
23. Mackert, L.F. and Lohman, G.M. (1986) 'Optimizer validation and performance evaluation for distributed queries', Proc. 12th Int'l. Conf. Very Large Data Bases (VLDB), pp. 149-159.
24. Mitzenmacher, M. (2002) 'Compressed bloom filters', IEEE/ACM Trans. Networking, Vol. 10, No. 5, pp. 604-612. (Pubitemid 35312139)
25. Mullin, J.K. (1990) 'Optimal semijoins for distributed database systems', IEEE Trans. Software Eng., Vol. 16, pp. 558-560.
26. Payne, R.B. (1997) 'Family cuculidae (cuckoos)', in del Hoyo, J., Elliott, A., Sargatal, J. (Eds.): Handbook of the Birds of the World, Vol. 4, pp. 508-545.
27. Payne, R.B. (2007) The Cuckoos, Oxford University Press.
28. Paynter, M. and Kocak, T. (2008) 'Fully pipelined bloom filter architecture', Communications Letters, Vol. 12, No. 11, pp. 855-857, IEEE.
29. Peter, C.D. and Panagiotis, M. (2004) 'Bloom filters in probabilistic verification', Proc. Fifth Int'l. Conf. Formal Methods in Computer-Aided Design, pp. 367-381.
30. Reynolds, P. and Vahdat, A. (2003) 'Efficient peer-to-peer keyword searching', Proc. ACM Int'l. Middleware Conf., pp. 21-40.
31. Rhea, S.C. and Kubiatowicz, J. (2004) 'Probabilistic location and routing', Proc. IEEE INFOCOM, pp. 1248-1257.
32. Tuba, M., Subotic, M. and Stanarevic, N. (2010) 'Modified cuckoo search algorithm for unconstrained optimization problems', Proceedings of the 5th European Computing Conference, pp. 263-268.
33. Valian, E., Mohanna, S. and Tavakoli, S. (2011) 'Improved cuckoo search algorithm for feedforward neural network training', International Journal of Artificial Intelligence & Applications, Vol. 2, No. 3, pp. 36-43.
34. Xie, K., Min, Y., Zhang, D., Wen, J., Xie, G. and Wen, J. (2005) 'Basket bloom filters for membership queries', Proceedings of IEEE Tencon'05, pp. 1-6.
35. Yang, X.S. (2010) 'A new metaheuristic bat-inspired algorithm', in Gonzalez, J.R. et al. (Eds.): Nature Inspired Cooperative Strategies for Optimization (NISCO 2010) Studies in Computational Intelligence, Springer, Berlin, Vol. 284, pp. 65-74.
36. Yang, X.S. and Deb, S. (2009) 'Cuckoo search via Lévy flights', World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), IEEE Publications, pp. 210-214.