Skip to main content

A Study of Selection Criteria for Constructing Identification Keys

  • Conference paper
Compstat 1984

Summary

Selection criteria used in heuristic algorithms for key construction were compared using simulations based on real and artificial data. Similar results were obtained from each type of data. These showed some criteria to be better than others but, nevertheless, each of the criteria produced the best key at least some of the time. Programs for key construction should thus offer users a choice of criteria.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Barnett, J.A., Payne, R.W. & Yarrow, D. (1983). Yeasts: Characteristics and identification. Cambridge: Cambridge University Press.

    Google Scholar 

  • Dallwitz,M.J. (1974). A flexible computer program for generating identification keys. Systematic Zoology 27, 50–57.

    Article  Google Scholar 

  • Garey, M.R. Optimal binary identification procedures, SIAM J. Appl. Math. 23 (1972) 173–186.

    Google Scholar 

  • Garey, M.R. Simple binary identification problems, I. E.E.E. Trans. Computers C-21 (1972) 588–590.

    Google Scholar 

  • Gower, J.C. & Barnett, J.A. (1971). Selecting tests in daignostic keys with unknown responses. Nature 232, 491–493.

    Article  Google Scholar 

  • Gower, J.C. & Payne, R.W. (1975). A comparison of different criteria forselecting binary tests in diagnostic keys. Biometrika, 62, 665–671.

    Article  Google Scholar 

  • Huffman, D.A. A method of construction of minimum-redundancy codes, Proc. I.R.E. 40 (1952) 1098–1101.

    Google Scholar 

  • Payne,R.W. (1975). Genkey: a program for constructing diagnostic keys. In Biological Identification with Computers, pp. 65–72. Edited by R.J. Pankhurst. London: Academic Press.

    Google Scholar 

  • Payne,R.W. (1978). Genkey: a program for constructing and printing identification keys and diagnostic tables. Rothamsted Experimental Station.

    Google Scholar 

  • Payne, R.W. & Preece, D.A. (1980). Identification Keys and Diagnostic Tables: A

    Google Scholar 

  • Review (with discussion). Journal of the Royal Statistical Society, Series A, 143, 253–292.

    Google Scholar 

  • Payne, R.W. (1981). Selection criteria for the construction of efficient diagnostic keys. Journal of Statistical Planning and Inference, 5, 27–36.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

T. Havránek Z. Šidák M. Novák

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Payne, R.W., Dixon, T.J. (1984). A Study of Selection Criteria for Constructing Identification Keys. In: Havránek, T., Šidák, Z., Novák, M. (eds) Compstat 1984. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-51883-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-51883-6_20

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7051-0007-7

  • Online ISBN: 978-3-642-51883-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics