By Topic

The use of genetic programming to build queries for information retrieval

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
D. H. Kraft ; Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA ; F. E. Petry ; B. P. Buckles ; T. Sadasivan

Genetic programming is applied to an information retrieval system in order to improve Boolean query formulation via relevance feedback. This approach brings together the concepts of information retrieval and genetic programming. Documents are viewed as vectors in index term space. A Boolean query, viewed as a parse tree, is an organism in the genetic programming sense. Through the mechanisms of genetic programming, the query is modified in order to improve precision and recall. Relevance feedback is incorporated, in part, via user defined measures over a trial set of documents. The fitness of a candidate query can be expressed directly as a function of the relevance of the retrieved set. Preliminary results based on a testbed are given. The form of the fitness function has a significant effect upon performance and the proper fitness functions take into account relevance based on topicality (and perhaps other factors)

Published in:

Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on

Date of Conference:

27-29 Jun 1994