A genetic algorithm approach is de¨eloped to determine the widths and locations of strips by scattering data. The distribution of strips is characterized by the local shape function. Numerical examples show the effecti¨eness of the approach.
Order-based fitness functions for genetic algorithms applied to relevance feedback
✍ Scribed by Cristina López-Pujalte; Vicente P. Guerrero-Bote; Félix de Moya-Anegón
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 112 KB
- Volume
- 54
- Category
- Article
- ISSN
- 1532-2882
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Recently there have been appearing new applications of genetic algorithms to information retrieval, most of them specifically to relevance feedback. The evolution of the possible solutions are guided by fitness functions that are designed as measures of the goodness of the solutions. These functions are naturally the key to achieving a reasonable improvement, and which function is chosen most distinguishes one experiment from another. In previous work, we found that, among the functions implemented in the literature, the ones that yield the best results are those that take into account not only when documents are retrieved, but also the order in which they are retrieved. Here, we therefore evaluate the efficacy of a genetic algorithm with various order‐based fitness functions for relevance feedback (some of them of our own design), and compare the results with the Ide dec‐hi method, one of the best traditional methods.
📜 SIMILAR VOLUMES
We present a theoretical framework for an asymptotically converging, scaled genetic algorithm which uses an arbitrary-size alphabet and common scaled genetic operators. The alphabet can be interpreted as a set of equidistant real numbers and multiple-spot mutation performs a scalable compromise betw