PARALLEL ADAPTATIVE MEMORY FOR QUERY EXPANSION

Abstract

Searching for any information in any field usually makes use search engines such as google,the technique of this engines use information retrieval; which is retrieve the doc uments relevant for user query .For efficiency information retrieval done applies query expansion; which is adding words to initial query, has been implemented for clarity the initial query; there is two approaches global and local. In our project we use co-occurrence for query expansion; for in order to find the best combination; this combination use large search space.In order to avoid of this space we use adaptive memory algorithm metaheuristic for find to get closer and better combinations and satisfy the user’s query.