Skip to main content

Maximum Entropy Analysis for Pattern Recognition

  • Chapter

Part of the book series: Fundamental Theories of Physics ((FTPH,volume 39))

Abstract

Feature extraction, classification, clustering and learning in pattern recognition are closely related to the maximum or minimum entropy principles. Such relationships are reviewed in this paper. The need for adaptive pattern recognition using neural networks is then emphasized. A comparison between neural networks and conventional statistical classifiers is also presented.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.H. Chen, “Statistical pattern recognition — early development and recent progress”, International Journal of Pattern Recognition and Artificial Intelligence, vol. 1, no. l, p. 43, April 1987.

    Article  Google Scholar 

  2. A. Wald, “Statistical Decision Functions”, Wiley, New York, 1950.

    MATH  Google Scholar 

  3. S. Kullback, “Information Theory and Statistics”, Wiley, New York, 1959. Also published in paper back by Dover Publications, New York, 1968.

    MATH  Google Scholar 

  4. E.T. Jaynes, “Information theory and statistical mechanics, Part I”, Physics Review, vol. 106, p. 620; Part II, ibid, vol. 108, p. 171, 1957.

    Article  MathSciNet  Google Scholar 

  5. E.T. Jaynes, “Prior probabilities”, IEEE Trans, on Systems Science and Cybernetics, vol. SSC-4, no. 3, p. 227, September 1968.

    Article  Google Scholar 

  6. Y.H. Pao, “Adaptive Pattern Recognition and Neural Networks”, Addison-Wesley, Reading, MA 1989.

    MATH  Google Scholar 

  7. D. Hestenes, “Inductive inference by neural networks”, Proc. of the 7th Annual Workshop on Maximum Entropy and Bayesian Methods in Applied Statistics, Reidel Publication Col, Dordrecht/Boston 1988.

    Google Scholar 

  8. C.H. Chen, “On information and distance measures, error bounds, and feature selection”, Information Science Journal, vol. 10, 1976.

    Google Scholar 

  9. M.E. Jernigan and F.D’Astoud, “Entropy-based texture analysis in the spatial frequency domain”, IEEE Trans, on Pattern Analysis and Machine Intelligence, vol. PAMI-6, no. 2, p. 237, March 1984.

    Article  Google Scholar 

  10. C.H. Chen, “Nonlinear Maximum Entropy Spectral Analysis Methods for Signal Recognition”, Research Studies Press, Wiley, Chichester, U.K., 1982.

    Google Scholar 

  11. C.H. Chen, “A study of texture classification using spectral features”, Proc. of the 6th International Conference on Pattern Recognition, Munich, Germany, p. 1074, Oct. 1982.

    Google Scholar 

  12. I. Drydal, Teleseismic discrimination of earthquakes and nuclear detonations with features derived from MESA”, International Journal of Pattern Recognition and Artificial Intelligence, vol. 1, no. 3, p. 323, 1987.

    Article  Google Scholar 

  13. W. Siedlecki and J. Sklansky, “On automatic feature selection”, vol. 2., no. 2, p. 221, 1988.

    Google Scholar 

  14. J. E. Shore and R.M. Gray, “Minimum cross-entropy pattern classification and cluster analysis”, IEEE Trans, on Pattern Analysis and Machine Intelligence, vol. PAMI-4, no. 1, p. 11, January 1982.

    Article  Google Scholar 

  15. R.O. Duda and P.E. Hart, “Pattern Classification and Scene Analysis”, Wiley, New York, 1972.

    Google Scholar 

  16. W.Y. Huang and R.P. Lippmann, “Comparison between neural nets and conventional classifiers”, Proc. of the First International Conference on Neural Networks, San Diego, vol. IV, p. 485, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Kluwer Academic Publishers

About this chapter

Cite this chapter

Chen, C.H. (1990). Maximum Entropy Analysis for Pattern Recognition. In: Fougère, P.F. (eds) Maximum Entropy and Bayesian Methods. Fundamental Theories of Physics, vol 39. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-0683-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-0683-9_27

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-6792-8

  • Online ISBN: 978-94-009-0683-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics