No. 314 of 500 No. 63 in Machine Learning

Pattern Classification

By Richard O. Duda, Peter E. Hart and David G. Stork

Published
November 9, 2000
Print length
688 pages
Reading level
Advanced
ISBN-13
978-0471056690
Publisher
Wiley-Interscience
Written for
Graduate students, researchers and engineers who want the statistical foundations beneath modern classifiers.

Synopsis

Pattern Classification began in 1973 as Pattern Classification and Scene Analysis, written by Richard Duda and Peter Hart while both worked at SRI International. The 2000 second edition, with David Stork joining as coauthor, drops the scene-analysis material and rebuilds the book around the statistical problem of assigning inputs to categories. After an introductory chapter, it moves from Bayesian decision theory through maximum-likelihood and Bayesian parameter estimation, nonparametric methods such as Parzen windows and nearest-neighbor rules, linear discriminant functions, multilayer neural networks, stochastic search, and decision trees and other nonmetric methods, ending with unsupervised learning and clustering. A chapter on algorithm-independent learning covers the No Free Lunch theorem, the bias-variance tradeoff and resampling methods such as bagging and boosting.

The approach is mathematical and patient. Each method is derived from first principles, illustrated with worked examples and figures, and compared with alternatives, and the chapters close with problems and computer exercises. Readers who work through it gain a precise vocabulary for classifiers, error rates and decision boundaries, which makes later machine learning literature easier to follow. The book assumes comfort with probability, linear algebra and calculus, and its neural network coverage reflects the field as it stood before convolutional and transformer models came to dominate. It is best treated as the theory foundation beneath current practice rather than a guide to today's tools.

Scorecard

Editorial score

How it scored

Editorial score: 74.5 / 1005 weighted criteria

  • Influence30%

    27.0/30
  • Authority25%

    22.5/25
  • Practical value20%

    12.0/20
  • Currency15%

    7.5/15
  • Readability10%

    5.5/10
  • Editorial score

    74.5/100

How the rank was computed

Rank No. 314 of 500 comes from a composite of 52.6: observable signals 19.0 of 55 points plus editorial review 33.6 of 45 points.

All 11 inputs
InputPoints
Observable signals19.0/55
Reach (Amazon ratings volume)7.1/16.5
Consensus across best-of lists5.5/13.8
Awards and bestseller evidence0.0/8.3
Reader rating, sample-adjusted5.7/8.3
Amazon sales rank0.7/5.5
Recency0.0/2.8
Editorial review33.6/45
Author authority10.1/11.3
Influence12.2/13.5
Practical value5.4/9.0
Readability2.5/4.5
Currency3.4/6.8

Each criterion is scored from 1 to 10 and weighted, and the points add up to the editorial score. The rank combines observable signals (55 percent) with this score (45 percent). Read the methodology.

Verdict

A foundational pattern-recognition textbook whose treatment of Bayesian decision theory remains clear, though its coverage stops before modern deep learning.

Strengths

  • Rigorous derivations from first principles
  • Extensive problems and computer exercises
  • Clear figures illustrating decision boundaries

Keep in mind

Its 2000 edition omits deep learning and modern software tooling, and its dense mathematics demands solid grounding in probability, linear algebra and calculus.

Key takeaways

  1. Bayesian decision theory gives the optimal classifier when class probabilities are known, and it serves as the benchmark against which practical methods are judged.
  2. Parametric estimation, maximum-likelihood or Bayesian, trades flexibility for efficiency, while nonparametric methods such as nearest-neighbor rules adapt to data at higher computational cost.
  3. The No Free Lunch theorem shows that no learning algorithm is superior across all problems, so method choice must rest on assumptions about the domain.
  4. The bias-variance tradeoff explains why more flexible classifiers can generalize worse, and why resampling methods such as bagging and boosting improve stability.

Notable facts

  • The 1973 first edition, Pattern Classification and Scene Analysis, stayed in print for more than 25 years before the second edition appeared in 2000. Source (opens in a new tab)
  • Wiley describes the 1973 first edition as a classic reference in the field and dates the second edition to November 2000. Source (opens in a new tab)

About the author

Richard O. Duda, Peter E. Hart and David G. Stork

Richard O. Duda, professor emeritus of electrical engineering at San Jose State University, and Peter E. Hart wrote the 1973 first edition while at SRI International, where Hart coauthored the first description of the A* search algorithm; both were elected IEEE and AAAI Fellows. Hart later founded Ricoh Innovations. David G. Stork, formerly its chief scientist, wrote Pixels & Paintings, a textbook on computer analysis of art.

Questions

Is Pattern Classification still worth reading in 2026?
Yes, for readers who want the statistical foundations of classification. Its treatment of Bayesian decision theory, parameter estimation, nearest-neighbor methods and the bias-variance tradeoff remains accurate and clearly explained. It does not cover deep learning, transformers or modern software libraries, so practitioners should pair it with a current deep learning text and treat this book as the theory layer beneath those methods.
Who should read Pattern Classification by Duda, Hart and Stork?
Graduate students in machine learning, signal processing and computer vision, plus researchers who need rigorous derivations of classical classifiers, will benefit most. Readers should be comfortable with probability, linear algebra and multivariable calculus. Executives and beginners will find it too technical; an accessible introduction should come first, before attempting this book's problem sets and computer exercises.
How does the second edition of Pattern Classification differ from the first?
The 1973 first edition, by Richard Duda and Peter Hart, was titled Pattern Classification and Scene Analysis. The 2000 second edition added David Stork as coauthor, concentrated on classification, and added coverage of neural networks, statistical pattern recognition, machine learning theory and the theory of invariances, along with worked examples, method comparisons, expanded exercises and computer project topics.

Sources

As an Amazon Associate, Best AI Books earns from qualifying purchases. Best AI Books is sponsored by Iternal.ai, whose founder and CEO, John Byron Hanby IV, wrote The AI Strategy Blueprint, our #1 ranked book. How we rank books.