A Particle Swarm Optimization Algorithm for Web Information Retrieval: A Novel Approach

A Particle Swarm Optimization Algorithm for Web Information Retrieval: A Novel Approach

Tarek Alloui (Constantine 2 University, Algeria), Imane Boussebough (Constantine 2 University, Algeria) and Allaoua Chaoui (Constantine 2 University, Algeria)
DOI: 10.4018/978-1-5225-5191-1.ch052
OnDemand PDF Download:
No Current Special Offers


The Web has become the largest source of information worldwide and the information, in its various forms, is growing exponentially. So obtaining relevant and up-to-date information has become hard and tedious. This situation led to the emergence of search engines which index today billions of pages. However, they are generic services and they try to aim the largest number of users without considering their information needs in the search process. Moreover, users use generally few words to formulate their queries giving incomplete specifications of their information needs. So dealing this problem within Web context using traditional approaches is vain. This paper presents a novel particle swarm optimization approach for Web information retrieval. It uses relevance feedback to reformulate user query and thus improve the number of relevant results. In the authors' experimental results, they obtained a significant improvement of relevant results using their proposed approach comparing to what is obtained using only the user query into a search engine.
Chapter Preview

Query Reformulation

Query reformulation is a process which generates, from the initial user query, a new query more appropriate to his needs. There are two main approaches: query expansion (Araujo and Pérez-Agüera, 2008; Chang et al., 2003; Qiu and Frei, 1993) and reweighting query keywords (Horng et al., 2003; Kim et al., 2001; Kraft et al., 1994).

Complete Chapter List

Search this Book: