Bees Swarm Optimization Based Approach for Web Information Retrieval

This paper deals with large scale information retrieval aiming at contributing to web searching. The collections of documents considered are huge and not obvious to tackle with classical approaches. The greater the number of documents belonging to the collection, the more powerful approach required....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Ročník 1; s. 6 - 13
Hlavní autoři: Drias, Habiba, Mosteghanemi, Hadia
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2010
Témata:
BSO
classic approach
Complexity theory
evolutionary algorithms
Heuristic algorithms
Humanities
Indexing
Information retrieval
Metaheuristics
Particle swarm optimization
Scalability
swarm intelligence
Time factors
Vectors
very large collections of documents
web information retrieval
ISBN:9781424484829, 1424484820
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper deals with large scale information retrieval aiming at contributing to web searching. The collections of documents considered are huge and not obvious to tackle with classical approaches. The greater the number of documents belonging to the collection, the more powerful approach required. A Bees Swarm Optimization algorithm called BSO-IR is designed to explore the prohibitive number of documents to find the information needed by the user. Extensive experiments were performed on CACM and RCV1 collections and more large corpuses in order to show the benefit gained from using such approach instead of the classic one. Performances in terms of solutions quality and runtime are compared between BSO and exact algorithms. Numerical results exhibit the superiority of BSO-IR on previous works in terms of scalability while yielding comparable quality.
ISBN:9781424484829
1424484820
DOI:10.1109/WI-IAT.2010.179