A Probabilistic Theory of Pattern RecognitionSpringer Science & Business Media, 27.11.2013 - 638 sivua 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. |
Kirjan sisältä
Tulokset 1 - 5 kokonaismäärästä 86
Sivu vi
... obtained his doctoral degree under Laci's supervision in 1991. Gábor had prepared a set of rough course notes on the subject around 1992 and proposed to coordinate the project — this book — in 1993. With renewed energy , we set out to ...
... obtained his doctoral degree under Laci's supervision in 1991. Gábor had prepared a set of rough course notes on the subject around 1992 and proposed to coordinate the project — this book — in 1993. With renewed energy , we set out to ...
Sivu 2
... obtained through an expert or a teacher who filled in the Y ; ' s after having seen the X's . To find a classifier with a small probability of error is hopeless unless there is some assurance that the ( X , Y ) ' s jointly are somehow ...
... obtained through an expert or a teacher who filled in the Y ; ' s after having seen the X's . To find a classifier with a small probability of error is hopeless unless there is some assurance that the ( X , Y ) ' s jointly are somehow ...
Sivu 28
... obtain . As x log ( ( 1 + x ) / ( 1 − x ) ) is convex in x and 1 + 12n - 1 η - ( 2n − 1 ) log = = | 2n − 1 | log 1 ... obtained by Toussaint ( 1974b ) : J≥√1-2LNN log 1+ 1-21NN √1-2LNN ≥ 2 ( 1 - 2LNN ) . The last bound is strictly ...
... obtain . As x log ( ( 1 + x ) / ( 1 − x ) ) is convex in x and 1 + 12n - 1 η - ( 2n − 1 ) log = = | 2n − 1 | log 1 ... obtained by Toussaint ( 1974b ) : J≥√1-2LNN log 1+ 1-21NN √1-2LNN ≥ 2 ( 1 - 2LNN ) . The last bound is strictly ...
Sivu 32
... obtained by choosing f ( x ) = | x − 1 ] , yielding V ( u , v ) = supμ ( A ; ) − v ( A ; ) ] . A = { A ; } j For this divergence , the equivalence of the two definitions is stated by Scheffé's theorem ( see Problem 12.13 ) . Theorem ...
... obtained by choosing f ( x ) = | x − 1 ] , yielding V ( u , v ) = supμ ( A ; ) − v ( A ; ) ] . A = { A ; } j For this divergence , the equivalence of the two definitions is stated by Scheffé's theorem ( see Problem 12.13 ) . Theorem ...
Sivu 34
... obtained by taking ƒ ( x ) = x log x : I ( u , v ) = supμ ( A ; ) log A = { A } } I ( u , v ) is also called the Kullback - Leibler number . μ ( A ; ) v ( Aj ) . Our last example is the x2 - divergence , defined by f ( x ) = ( x − 1 ) ...
... obtained by taking ƒ ( x ) = x log x : I ( u , v ) = supμ ( A ; ) log A = { A } } I ( u , v ) is also called the Kullback - Leibler number . μ ( A ; ) v ( Aj ) . Our last example is the x2 - divergence , defined by f ( x ) = ( x − 1 ) ...
Sisältö
1 | |
4 | |
21 | |
27 | |
54 | |
Nearest Neighbor Rules | 60 |
4 | 67 |
6 | 74 |
Parametric Classification | 263 |
Generalized Linear Discrimination | 279 |
Complexity Regularization | 289 |
Condensed and Edited Nearest Neighbor Rules 303 | 302 |
Tree Classifiers | 315 |
DataDependent Partitioning | 363 |
Splitting the Data 387 | 386 |
The Resubstitution Estimate | 397 |
11 | 81 |
2 | 92 |
6 | 100 |
8 | 106 |
2 | 113 |
Error Estimation | 120 |
The Regular Histogram Rule | 133 |
Kernel Rules | 153 |
Consistency of the kNearest Neighbor Rule | 168 |
VapnikChervonenkis Theory | 187 |
Combinatorial Aspects of VapnikChervonenkis Theory | 214 |
4 | 224 |
1 | 234 |
The Maximum Likelihood Principle | 249 |
Deleted Estimates of the Error Probability | 407 |
Automatic Kernel Rules 423 | 422 |
Automatic Nearest Neighbor Rules | 451 |
Hypercubes and Discrete Spaces 461 | 460 |
Epsilon Entropy and Totally Bounded Sets | 479 |
Uniform Laws of Large Numbers 489 | 488 |
Neural Networks | 507 |
Other Error Estimates | 549 |
Feature Extraction 561 | 560 |
Appendix | 575 |
Notation | 591 |
Author Index | 619 |
Subject Index | 627 |
Muita painoksia - Näytä kaikki
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |
A Probabilistic Theory of Pattern Recognition Luc Devroye,Laszlo Gyorfi,Gábor Lugosi Esikatselu ei käytettävissä - 2014 |
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Esikatselu ei käytettävissä - 2013 |
Yleiset termit ja lausekkeet
a₁ algorithm Assume asymptotic b₁ Bayes error binary Cauchy-Schwarz inequality cells Chapter class of classifiers classification rule condition converges to zero Corollary data points decision defined deleted estimate denotes density Devroye distribution empirical error error estimate error probability example finite fixed function HINT histogram rule Hoeffding's inequality hyperplane hyperrectangles inequality integer Jensen's inequality k-d tree k-nearest k-NN rule kernel rule L(gn Lemma linear classifier maximum likelihood minimizing the empirical nearest neighbor rule neural network node obtained otherwise pairs parameters partition pattern recognition probability of error proof of Theorem Prove random variables rate of convergence rectangles risk minimization rule gn sample selected shatter coefficients Show sigmoid split squared error structural risk minimization subsets tree classifiers universally consistent upper bound values vc dimension vector X₁ Y₁ фес