probabilistic theory pattern recognition von devroye luc (9 Ergebnisse)

Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Zustand: New. pp. 660 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Zustand: Sehr gut. 636 Seiten Zustand: Einband etwas berieben, Name auf fliegendem Vorsatzblatt // Mit 99 Abbildungen. Englische Ausgabe /// Versand gratis Innerhalb Deutschlands - Portofrei in Deutschland- ab 20 Euro mit Post ID - Gratisversand deutschlandweit innerhalb Deutschlands gratis Versand -Versandkostenfrei innerhalb Deutschlands /// Sprache: Englisch Gewicht in Gramm: 1030 24,5 x 16,0 cm, Hardcover/Pappeinband.

Taschenbuch. Zustand: Neu. A Probabilistic Theory of Pattern Recognition | Luc Devroye (u. a.) | Taschenbuch | xv | Englisch | 2013 | Springer | EAN 9781461268772 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Zustand: Brand New. reprint edition. 653 pages. 9.25x6.10x1.42 inches. In Stock.

Taschenbuch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 660 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Buch. Zustand: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 660 pp. Englisch.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.