A Probabilistic Theory of Pattern Recognition (Stochastic Modelling and Applied Probability)

Devroye, Luc, Gy�rfi, Laszlo, Lugosi, Gabor

ISBN 10: 0387946187 / ISBN 13: 9780387946184

Editore: Springer, 1996

Riguardo questo articolo

Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Codice articolo 000325462U

Dati bibliografici

• Titolo: A Probabilistic Theory of Pattern Recognition (Stochastic Modelling and Applied Probability)
• Editore: Springer
• Data di pubblicazione: 1996
• Lingua: Inglese
• ISBN 10: 0387946187
• ISBN 13: 9780387946184
• Rilegatura: hardcover
• Edizione: Corrected.
• Condizione: Good

Descrizione articolo

Riassunto

Pattern recognition presents one of the most significant challenges for scientists and engineers, and many different approaches have been proposed. The aim of this book is to provide a self-contained account of probabilistic analysis of these approaches. The book includes a discussion of distance measures, nonparametric methods based on kernels or nearest neighbors, Vapnik-Chervonenkis theory, epsilon entropy, parametric classification, error estimation, free classifiers, and neural networks. Wherever possible, distribution-free properties and inequalities are derived. A substantial portion of the results or the analysis is new. Over 430 problems and exercises complement the material.

Contenuti

Preface * Introduction * The Bayes Error * Inequalities and alternate distance measures * Linear discrimination * Nearest neighbor rules * Consistency * Slow rates of convergence Error estimation * The regular histogram rule * Kernel rules Consistency of the k-nearest neighbor rule * Vapnik-Chervonenkis theory * Combinatorial aspects of Vapnik-Chervonenkis theory * Lower bounds for empirical classifier selection * The maximum likelihood principle * Parametric classification * Generalized linear discrimination * Complexity regularization * Condensed and edited nearest neighbor rules * Tree classifiers * Data-dependent partitioning * Splitting the data * The resubstitution estimate * Deleted estimates of the error probability * Automatic kernel rules * Automatic nearest neighbor rules * Hypercubes and discrete spaces * Epsilon entropy and totally bounded sets * Uniform laws of large numbers * Neural networks * Other error estimates * Feature extraction * Appendix * Notation * References * Index