Loading menu…

An Enhanced Cuckoo Search for Optimization of Bloom Filter in Spam Filtering

§ Bannari Amman Istitute of Technology

Send Message

To: Author

An Enhanced Cuckoo Search for Optimization of Bloom Filter in Spam Filtering

Article Fingerprint

ReserarchID

CST498XJ

An Enhanced Cuckoo Search for Optimization of Bloom Filter in Spam Filtering Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background

References

28 Cites in Article
  1. 1. B Bloom (1970). Space/time tradeoffs in hash coding with allowable errors. Communications of the ACM, 13, 422-426.
  2. 2. W Feng,K Shin,D Kandlur,D Saha (2002). The BLUE active queue management algorithms. IEEE/ACM Transactions on Networking, 10, 513-528.
  3. 3. J Mullin (1990). Optimal Semijoins for Distributed Database Systems. IEEE Trans. Software Eng, 16, 558-560.
  4. 4. L Mackert,G Lohman (1986). Optimizer Validation and Performance Evaluation for Distributed Queries. Proc. 12th Int'l Conf. Very Large Data Bases (VLDB), 149-159.
  5. 5. Andrei Broder,Michael Mitzenmacher (2005). Network Applications of Bloom Filters: A Survey. Internet Mathematics, 1(4), 485-509.
  6. 6. J Kubiatowicz,D Bindel,Chen,Y Czerwinski,S Eaton,P Geels,D (2000). An Architecture for Global-Scale Persistent Storage. ACM SIGPLAN Notices, 35(11), 190-201.
  7. 7. J Li,J Taylor,L Serban,M Seltzer (2002). Self-Organization in Peer-to-Peer System. Proc. ACM SIGOPS
  8. 8. F Cuenca-Acuna,C Peery,R Martin,T Nguyen (2003). PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities. High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on, 236-246.
  9. 9. Rhea Kubiatowicz,J (2004). Probabilistic Location and Routing. Proc. IEEE INFOCOM, 1248-1257.
  10. 10. Todd Hodes,Steven Czerwinski,Ben Zhao,Anthony Joseph,Randy Katz (2002). An Architecture for Secure Wide-Area Service Discovery. Wireless Networks, 8(2-3), 213-230.
  11. 11. P Reynolds,A Vahdat (2003). Efficient Peer-to-Peer Keyword Searching. Proc. ACM Int'l Middleware Conf, 21-40.
  12. 12. D Bauer,P Hurley,R Pletka,M Waldvogel (2004). Bringing Efficient Advanced Queries to Distributed Hash Tables. Proc. IEEE Conf. Local Computer Networks, 6-14.
  13. 13. L Fan,P Cao,J Almeida,A Broder (2000). Summary Cache: A Scalable Wide Area Web Cache Sharing Protocol. IEEE/ACM Trans. Networking, 8(3), 281-293.
  14. 14. C Peter,M Panagiotis (2004). Bloom Filters in An Enhanced Cuckoo Search for Optimization of Bloom Filter in Spam Filtering Global Journal of Computer Science and Technology. US) Probabilistic Verification, Proc. Fifth Int'l Conf. Formal Methods in Computer-Aided Design, XII, 367-381.
  15. 15. C Jin,W Qian,A Zhou (2004). Analysis and Management of Streaming Data: A Survey. J. Software, 15(8), 1172-1181.
  16. 16. Fan Deng,Davood Rafiei (2006). Approximately detecting duplicates for streaming data using stable bloom filters. Proceedings of the 2006 ACM SIGMOD international conference on Management of data, 25-36.
  17. 17. F Bonomi,M Mitzenmacher,R Panigrahy,S Singh (2006). Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines. Proc. ACM SIGCOMM, 315-326.
  18. 18. K Li,Z Zhong (2006). Fast Statistical Spam Filter by Approximate Classifications. Proc. Joint Int'l Conf. Measurement and Modeling of Computer Systems, SIGMETRICS/Performance, 347-358.
  19. 19. M Mitzenmacher (2002). Compressed Bloom filters. IEEE/ACM Transactions on Networking, 10(5), 604-612.
  20. 20. Adam Kirsch,Michael Mitzenmacher (2006). Less Hashing, Same Performance: Building a Better Bloom Filter. Lecture Notes in Computer Science, 456-467.
  21. 21. A Kirsch,M Mitzenmacher (2006). Distance-Sensitive Bloom Filters. Proc. Eighth Workshop Algorithm Eng. and Experiments (ALENEX '06)
  22. 22. A Kumar,Jun Xu,Jia Wang,O Spatschek,Li Li (2004). Space-code bloom filter for efficient per-flow traffic measurement. IEEE INFOCOM 2004, 3, 1762-1773.
  23. 23. S Cohen,Y Matias (2003). Spectral Bloom Filters. Proc. 22nd ACM SIGMOD, 241-252.
  24. 24. R Laufer,P Velloso,O Duarte (2005). GeneralizedBloom Filters. GeneralizedBloom Filters
  25. 25. B Chazelle,J Kilian,R Rubinfeld (2004). Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proc. Fifth Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), 30-39.
  26. 26. Fang Hao,Murali Kodialam,T Lakshman (2007). Building high accuracy bloom filters using partitioned hashing. ACM SIGMETRICS Performance Evaluation Review, 35(1), 277-288.
  27. 27. Xin-She Yang,Suash Deb (2009). Cuckoo Search via Lévy flights. 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 210-214.
  28. 28. K Xie,Y Min,D Zhang,J Wen,G Xie,J Wen (2005). Basket Bloom Filters for Membership Queries. Proceedings of IEEE Tencon, 05, 1-6.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Premalatha, Dr.. Arulanand Natarajan, Subramanian S. 1970. "An Enhanced Cuckoo Search for Optimization of Bloom Filter in Spam Filtering". Global Journal of Computer Science and Technology GJCST Volume 12 (GJCST Volume 12 Issue 1).

More Citation Formats

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Version of record
v1.2

Issue date
January 15, 2012

Language
English
Order Article Reprint
Experience in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 6.3K
Total Downloads: 437
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An Enhanced Cuckoo Search for Optimization of Bloom Filter in Spam Filtering

Premalatha
Premalatha Bannari Amman Istitute of Technology
Dr.. Natarajan
Dr.. Natarajan <p>Bannari Amman Istitute of Technology</p>
Subramanian S
Subramanian S <p>Bannari Amman Istitute of Technology</p>