Skip to main content

Decision Trees, Tables, and Lattices

  • Chapter
Pattern Recognition

Abstract

The use of small built-in processors in pattern recognition machines is becoming much more widespread, with the advent of very cheap processing power in the form of LSI microprocessors and other devices. It is therefore quite reasonable to design systems which evaluate rather complicated features according to the dictates of an “intelligent” computer program and arrive at a decision by branching and sequential feature extraction, rather than by deriving several features in parallel and then classifying by hypersurface separation.

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

  • Bell, D. A., 1973, Decision Trees in Pattern Recognition, Ph.D. Thesis, University of Southampton.

    Google Scholar 

  • Breuer, M. A., 1968, Heuristic switching expression simplification, Proc. Assoc. Comp. Mach.Natl Conf., p. 241.

    Google Scholar 

  • King, P. J. H., 1966, Conversion of decision tables to computer programs by rule mask techniques, Comm. Assoc. Comp. Mach. 9: 796.

    Google Scholar 

  • Kirk, H. W., 1965, Use of decision tables in computer programming, Comm. Assoc. Comp. Mach. 8: 385.

    Google Scholar 

  • McCluskey, E. J., 1965, Introduction to the Theory of Switching Circuits, McGraw-Hill, New York.

    Google Scholar 

  • Pollack, S. L., 1965, Conversion of limited entry decision tables to computer programs, Comm. Assoc. Comp. Mach. 11: 677.

    Google Scholar 

  • Pollack, S. L., Hicks, H. T., and Harrison, W. J., 1971, Decision Tables: Theory and Practice, Wiley-Interscience, New York.

    Google Scholar 

  • Press, L. I., 1965, Conversion of decision tables to computer programs, Comm. Assoc. Comp. Mach. 8: 385.

    Google Scholar 

  • Rabin, J., 1971, Conversion of limited entry decision tables to optimal decision trees: Fundamental concepts, SIGPLAN Notices, Sept., p. 68.

    Google Scholar 

  • Schmidt, D. T., and Kavanagh, T. F., 1964, Using decision structure tables, Datamation, Feb., p. 42; March, p. 48.

    Google Scholar 

  • Schwayder, K., 1971, Conversion of limited entry decision tables to computer programs — A proposed modification to Pollack’s algorithm, Comm. Assoc. Comp. Mach. 14: 69.

    Google Scholar 

  • Yasui, T., 1971, Some aspects of decision table conversion techniques, SIGPLAN Notices, Sept., p. 104.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Plenum Press, New York

About this chapter

Cite this chapter

Bell, D.A. (1978). Decision Trees, Tables, and Lattices. In: Batchelor, B.G. (eds) Pattern Recognition. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-4154-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-4154-3_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-4156-7

  • Online ISBN: 978-1-4613-4154-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics