Generating lookup tables using evolutionary algorithms

  • Tim Hendtlass
3 Formal Tools Divisible Problems

DOI: 10.1007/3-540-64582-9_796

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1415)
Cite this paper as:
Hendtlass T. (1998) Generating lookup tables using evolutionary algorithms. In: Mira J., del Pobil A.P., Ali M. (eds) Methodology and Tools in Knowledge-Based Systems. IEA/AIE 1998. Lecture Notes in Computer Science (Lectures Notes in Artificial Intelligence), vol 1415. Springer, Berlin, Heidelberg

Abstract

This paper describes the use of an evolutionary algorithm to develop lookup tables which consist of an ordered list of regions, each of which encloses training examples of only one category. Compared to a simpler type of lookup table which consists of an unordered list of the training points and their categories, region based tables are smaller and, in general, faster to use. The development of a region based lookup table for the Frey and Slate character recognition problem is described and the size and accuracy achieved are compared with the original Frey and Slate point based lookup table. The reasons why it outperforms the original lookup table are discussed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Tim Hendtlass
    • 1
  1. 1.Centre for Intelligent Systems School of Biophysical Sciences and Electrical EngineeringSwinburne University of TechnologyHawthornAustralia

Personalised recommendations