Johnson, Colin G. (2001) Finding Diverse Examples with Genetic Algorithms. In: John, Robert and Birkenhead, Ralph, eds. Developments in Soft Computing. Advances in Soft Computing . Physica, Heidelberg, Germany, pp. 92-99. ISBN 978-3-7908-1361-6. E-ISBN 978-3-7908-1829-1. (doi:10.1007/978-3-7908-1829-1_11) (KAR id:13591)
PDF
Language: English |
|
Download this file (PDF/199kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Postscript
Language: English |
|
Download this file (Postscript/3MB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1007/978-3-7908-1829-1_11 |
Abstract
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: | Book section |
---|---|
DOI/Identification number: | 10.1007/978-3-7908-1829-1_11 |
Uncontrolled keywords: | classification, qualitative examples, evolutionary computing |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Mark Wheadon |
Date Deposited: | 24 Nov 2008 17:59 UTC |
Last Modified: | 05 Nov 2024 09:47 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/13591 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):