Article ID: | iaor20073397 |
Country: | United Kingdom |
Volume: | 34 |
Issue: | 1 |
Start Page Number: | 91 |
End Page Number: | 106 |
Publication Date: | Jan 2007 |
Journal: | Computers and Operations Research |
Authors: | Salcedo-Sanz Sancho, Su Jing |
Keywords: | optimization: simulated annealing |
In this paper we present two strategies for reducing the time of convergence of two metaheuristics (genetic algorithms and simulated annealing) in inductive query by example (IQBE), which is a process for assisting the users of a given information retrieval system in the formulation of queries. Both strategies are based on a reduction of the search space size of the metaheuristics. The first strategy that we introduce is a compression–expansion strategy, where the terms are arranged into sets of a given size. The second strategy we consider is the so-called restricted search, where the number of terms in the genetic algorithm and simulated annealing encodings is fixed to be a given number