DocumentCode
2273464
Title
Optimization of bloom filter using evolutionary algorithm
Author
Priyadharsini, P. Swathy ; Natarajan, Arulanand ; Natarajan, A.M.
Author_Institution
Dept. of CSE, Bannari Amman Inst. of Technol., Erode, India
fYear
2012
fDate
25-27 April 2012
Firstpage
86
Lastpage
90
Abstract
Spam is an unsolicited e-mail on the internet to a large number of users. A spam filter is used to detect the spam mails and to prevent those mails from user´s inbox. Bloom Filter is used for identifying the spam mails. A Bloom filter is a space efficient data structure used to check membership to a set. By obtaining speed and size improvements, it allows some probability of errors like false positives. Bin Bloom Filter (BBF) has number of bloom filters which allocates different false positive rates to different strings depending upon the significance of spam words. Genetic Algorithm (GA) is employed to optimize the BBF which reduces the total membership invalidation cost.
Keywords
data structures; evolutionary computation; genetic algorithms; information filtering; unsolicited e-mail; BBF; GA; Internet; bin bloom filter; bloom filter optimisation; data structure; evolutionary algorithm; genetic algorithm; spam mails; spam words; unsolicited e-mail; Arrays; Biological cells; Equations; Filtering algorithms; Genetic algorithms; Unsolicited electronic mail; Spam; bit array; genetic algorithm; hash function; premature convergence;
fLanguage
English
Publisher
ieee
Conference_Titel
Recent Advances in Computing and Software Systems (RACSS), 2012 International Conference on
Conference_Location
Chennai
Print_ISBN
978-1-4673-0252-4
Type
conf
DOI
10.1109/RACSS.2012.6212703
Filename
6212703
Link To Document