DocumentCode
3398751
Title
A personalized search engine research based on Bloom filter
Author
Mugen Pang ; Guangwei Xu
Author_Institution
Sch. of Comput. Sci. & Technol., Donghua Univ., Shanghai, China
fYear
2011
fDate
19-22 Aug. 2011
Firstpage
2365
Lastpage
2368
Abstract
Personalization of search engines is to achieve retrieval for different users with different interests. In this paper, we propose a personalized search engine based on Bloom filter. Bloom filter, an effective space data structure, is used in the research of personalized search. The user interest model based on Bloom filter contains one standard Bloom filter and multiple Counting Bloom filters, and the design of multi-level structure can accurately represent weights of interest keywords. According to this structure, the interest adjustment algorithm and the keywords matching algorithm are proposed at the same time. After experimental evaluation, the results indicate that this model has not only high space efficiency but high retrieval accuracy as well.
Keywords
Internet; information filtering; search engines; bloom filter; data structure; interest adjustment algorithm; keyword matching algorithm; personalized search engine research; Accuracy; Algorithm design and analysis; Arrays; Filtering algorithms; Matched filters; Radiation detectors; Search engines; Bloom filter; personalized search; user interest model;
fLanguage
English
Publisher
ieee
Conference_Titel
Mechatronic Science, Electric Engineering and Computer (MEC), 2011 International Conference on
Conference_Location
Jilin
Print_ISBN
978-1-61284-719-1
Type
conf
DOI
10.1109/MEC.2011.6025968
Filename
6025968
Link To Document