Abstract
Algorithms for the automated creation of low cost identification keys are described and theoretical and empirical justifications are provided. The algorithms are shown to handle differing test costs, prior probabilities for each potential diagnosis and tests that produce uncertain results. The approach is then extended to cover situations where more than one measure of cost is of importance, by allowing tests to be performed in batches. Experiments are performed on a real-world case study involving the identification of yeasts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Edwards and D.R. Morse. The potential for computer-aided identification in biodiversity research. Trends in Ecology and Evolution, 10(4):153–158, 1995.
T. Wijtzes, M.R. Bruggeman, M.J.R. Nout, and M.H. Zwietering. A computerised system for the identification of lactic acid bacteria. International Journal of Food Microbiology, pages 65–70, 1997.
B. De la Iglesia, V.J. Rayward-Smith, and J.J. Wesselink. Classification/ identification on biological databases. Proc MIC2001, 4th International Metaheuristics Conference, ed. J.P. de Souza, Porto, Portugal, 2001.
R.W. Payne and C.J. Thompson. A study of criteria for constructing identification keys containing tests with unequal costs. Comp. Stats. Quarterly, 1:43–52, 1989.
R.W. Payne and T.J. Dixon. A study of selection criteria for constructing identification keys. In T. Havranek, Z. Sidak, and M. Novak, editors, COMPSTAT 1984: Proceedings in Computational Statistics, pages 148–153. Physica-Verlag, 1984.
R.W. Payne. Genkey: A program for constructing and printing identification keys and diagnostic tables. Technical Report m00/42529, Rothamsted Experimental Station, Harpenden, Hertfordshire, 1993.
R.W. Payne and D.A. Preece. Identification keys and diagnostic tables: a review. Journal of the Royal Statistical Society, Series A, 143(3):253–292, 1980.
C.E. Shannon. A mathematical theory of communication. Bell Systems Technical Journal, 27:379–423 and 623-656, 1949.
J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109–133, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reynolds, A.P. et al. (2003). Algorithms for Identification Key Generation and Optimization with Application to Yeast Identification. In: Cagnoni, S., et al. Applications of Evolutionary Computing. EvoWorkshops 2003. Lecture Notes in Computer Science, vol 2611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36605-9_11
Download citation
DOI: https://doi.org/10.1007/3-540-36605-9_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00976-4
Online ISBN: 978-3-540-36605-8
eBook Packages: Springer Book Archive