KeyGraphs, small-worlds, and interactive GAs

This is the presentation about using DISCUS interactive genetic algorithms to tune the KeyGraph algorithm for a given document. The paper was published in the First European Workshop on Chance Discovery, EWCD 2004 (Valencia, Spain). The paper may be found here (PDF, 0.7Mb) and the presentation slides here (PDF, 0.5Mb).

Related posts:

  1. Chance discovery and marketing
  2. GE498-ECI, Lecture 10: Innovation and visual concept maps
  3. Combating user fatigue in iGA: partial ordering, support vector machines, and synthetic fitness

About this entry

You’re currently reading “KeyGraphs, small-worlds, and interactive GAs,” an entry on Xavier Llorà

Published:
Monday, August 23rd, 2004 at 4:00 pm
Author:
Xavier
Category:
DISCUS, Presentations