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

α
Premalatha
Premalatha
σ
Dr.. Arulanand Natarajan
Dr.. Arulanand Natarajan
ρ
Subramanian
Subramanian
Ѡ
Premalatha K
Premalatha K
α Anna University, Chennai Anna University, Chennai

Send Message

To: Author

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

Article Fingerprint

ReserarchID

498XJ

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

AI TAKEAWAY

Connecting with the Eternal Ground
  • 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

References

28 Cites in Article
  1. B Bloom (1970). Space/time tradeoffs in hash coding with allowable errors.
  2. W Feng,K Shin,D Kandlur,D Saha (2002). The BLUE active queue management algorithms.
  3. J Mullin (1990). Optimal Semijoins for Distributed Database Systems.
  4. L Mackert,G Lohman (1986). Optimizer Validation and Performance Evaluation for Distributed Queries.
  5. Andrei Broder,Michael Mitzenmacher (2005). Network Applications of Bloom Filters: A Survey.
  6. J Kubiatowicz,D Bindel,Chen,Y Czerwinski,S Eaton,P Geels,D (2000). An Architecture for Global-Scale Persistent Storage.
  7. J Li,J Taylor,L Serban,M Seltzer (2002). Self-Organization in Peer-to-Peer System.
  8. F Cuenca-Acuna,C Peery,R Martin,T Nguyen (2003). PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities.
  9. Rhea Kubiatowicz,J (2004). Probabilistic Location and Routing.
  10. Todd Hodes,Steven Czerwinski,Ben Zhao,Anthony Joseph,Randy Katz (2002). An Architecture for Secure Wide-Area Service Discovery.
  11. P Reynolds,A Vahdat (2003). Efficient Peer-to-Peer Keyword Searching.
  12. D Bauer,P Hurley,R Pletka,M Waldvogel (2004). Bringing Efficient Advanced Queries to Distributed Hash Tables.
  13. L Fan,P Cao,J Almeida,A Broder (2000). Summary Cache: A Scalable Wide Area Web Cache Sharing Protocol.
  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.
  15. C Jin,W Qian,A Zhou (2004). Analysis and Management of Streaming Data: A Survey.
  16. Fan Deng,Davood Rafiei (2006). Approximately detecting duplicates for streaming data using stable bloom filters.
  17. F Bonomi,M Mitzenmacher,R Panigrahy,S Singh (2006). Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines.
  18. K Li,Z Zhong (2006). Fast Statistical Spam Filter by Approximate Classifications.
  19. M Mitzenmacher (2002). Compressed Bloom filters.
  20. Adam Kirsch,Michael Mitzenmacher (2006). Less Hashing, Same Performance: Building a Better Bloom Filter.
  21. A Kirsch,M Mitzenmacher (2006). Distance-Sensitive Bloom Filters.
  22. A Kumar,Jun Xu,Jia Wang,O Spatschek,Li Li (2004). Space-code bloom filter for efficient per-flow traffic measurement.
  23. S Cohen,Y Matias (2003). Spectral Bloom Filters.
  24. R Laufer,P Velloso,O Duarte (2005). GeneralizedBloom Filters.
  25. B Chazelle,J Kilian,R Rubinfeld (2004). Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
  26. Fang Hao,Murali Kodialam,T Lakshman (2007). Building high accuracy bloom filters using partitioned hashing.
  27. Xin-She Yang,Suash Deb (2009). Cuckoo Search via Lévy flights.
  28. K Xie,Y Min,D Zhang,J Wen,G Xie,J Wen (2005). Basket Bloom Filters for Membership Queries.

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. 1970. \u201cAn Enhanced Cuckoo Search for Optimization of Bloom Filter in Spam Filtering\u201d. Unknown Journal GJCST Volume 12 (GJCST Volume 12 Issue 1): .

Download Citation

Journal Specifications
Version of record

v1.2

Issue date

January 15, 2012

Language
en
Experiance 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: 20738
Total Downloads: 10951
2026 Trends
Related Research

Published Article

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

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

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

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

Dr.. Arulanand Natarajan
Dr.. Arulanand Natarajan
Subramanian
Subramanian
Premalatha K
Premalatha K

Research Journals