A new hillclimber for classifier systems
A new hillclimber for classifier systems
- Author(s): Kwok Ching Tsui and M. Plumbley
- DOI: 10.1049/cp:19971162
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Second International Conference on Genetic Algorithms in Engineering Systems — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): Kwok Ching Tsui and M. Plumbley Source: Second International Conference on Genetic Algorithms in Engineering Systems, 1997 p. 97 – 102
- Conference: Second International Conference on Genetic Algorithms in Engineering Systems
- DOI: 10.1049/cp:19971162
- ISBN: 0 85296 693 8
- Location: Glasgow, UK
- Conference date: 2-4 Sept. 1997
- Format: PDF
Multistate artificial environments such as mazes represent a class of tasks that can be solved by many different multistep methods. When different rewards are available in different places of the maze, a problem solver is required to evaluate different positions effectively and remembers the best one. A new hillclimbing strategy for the Michigan style classifier system is suggested which is able to find the shortest path and discarding suboptimal solutions. Knowledge reuse is also shown to be possible.
Inspec keywords: genetic algorithms; minimisation; pattern classification
Subjects: Optimisation techniques; Optimisation techniques; Pattern recognition
Related content
content/conferences/10.1049/cp_19971162
pub_keyword,iet_inspecKeyword,pub_concept
6
6