School of Computing

Finding diverse examples with genetic algorithms

Colin G. Johnson

In Robert John and Ralph Birkenhead, editors, Developments in Soft Computing, Advances in Soft Computing, pages 182-196. Physica/Springer-Verlag, July 2001.

Abstract

A number of real-world problems can be seen as instances of the general problem of \emph{finding 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.

Download publication 3816 kbytes (PostScript)

Bibtex Record

@inproceedings{1211,
author = {Colin G. Johnson},
title = {Finding Diverse Examples with Genetic Algorithms},
month = {July},
year = {2001},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2001/1211},
    publication_type = {inproceedings},
    submission_id = {4157_995282219},
    ISBN = {3-7908-1361-3},
    booktitle = {Developments in Soft Computing},
    editor = {Robert John and Ralph Birkenhead},
    series = {Advances in Soft Computing},
    publisher = {Physica/Springer-Verlag},
    ISSN = {1615-3871},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014