Johnson, Colin G. (2001) Finding Diverse Examples with Genetic Algorithms. In: Developments in Soft Computing, 2000, Leicester, England.
A number of real-world problems can be seen as instances of the general problem of emphfinding qualitative examples. In such a problem we know how to classify objects from a set into a large number of classes, and we would like to find one specific example for each class. In this paper we outline a number of problems which fit into this category, and analyse some of the requirements for a general heuristic for this category of problem. We then develop a heuristic for this type of problem, based on genetic algorithms, and investigate the application of this heuristic to some test problems.
|Item Type:||Conference or workshop item (Paper)|
|Uncontrolled keywords:||classification, qualitative examples, evolutionary computing|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 17:59|
|Last Modified:||06 Sep 2011 01:10|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13591 (The current URI for this page, for reference purposes)|
- Depositors only (login required):