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 6 - 10 kokonaismäärästä 45
Sivu 18
... risk in- creases . ) PROBLEM 2.2 . Let X ' be independent of ( X , Y ) . Prove that Lix.x = Lx . PROBLEM 2.3 . Show ... minimizing L1 ) has the form of ge for some c . Note that g * is like that . PROBLEM 2.5 . DECISIONS WITH REJECTION ...
... risk in- creases . ) PROBLEM 2.2 . Let X ' be independent of ( X , Y ) . Prove that Lix.x = Lx . PROBLEM 2.3 . Show ... minimizing L1 ) has the form of ge for some c . Note that g * is like that . PROBLEM 2.5 . DECISIONS WITH REJECTION ...
Sivu 49
... Risk Minimization In this section we present an algorithm that yields a classifier whose error probabil- ity is very close to the minimal error probability L achievable by linear ... Risk Minimization 49 5 Empirical Risk Minimization.
... Risk Minimization In this section we present an algorithm that yields a classifier whose error probabil- ity is very close to the minimal error probability L achievable by linear ... Risk Minimization 49 5 Empirical Risk Minimization.
Sivu 50
... risk minimization . Theorem 4.5 just gives you a taste of things to come . Other - more involved , but also more general - proofs go back to Vapnik and Chervonenkis ( 1971 ; 1974c ) . Theorem 4.5 . Assume that X has a density . If is ...
... risk minimization . Theorem 4.5 just gives you a taste of things to come . Other - more involved , but also more general - proofs go back to Vapnik and Chervonenkis ( 1971 ; 1974c ) . Theorem 4.5 . Assume that X has a density . If is ...
Sivu 51
... Ya ) . Define Then ( X , Y ) : = ( X " , Y ' ' ) if i ≤ d ( Xi , Yi ) if i > d . € Xd PL ( 1 ) E ( 1 ) > XX - Ź > n 1 < PL ( 1 ) - I { $ 1 ( X ; ) 7Y ; } n € X1 Xd 2 < PL ( 1 ) = P { L ( i = d + 1 4.5 Empirical Risk Minimization 51.
... Ya ) . Define Then ( X , Y ) : = ( X " , Y ' ' ) if i ≤ d ( Xi , Yi ) if i > d . € Xd PL ( 1 ) E ( 1 ) > XX - Ź > n 1 < PL ( 1 ) - I { $ 1 ( X ; ) 7Y ; } n € X1 Xd 2 < PL ( 1 ) = P { L ( i = d + 1 4.5 Empirical Risk Minimization 51.
Sivu 53
... risk minimization above performs even better as the size of the error improves to O ( d logn / n ) from 0 ( √d logn / n ) . Clearly , the data points are linearly separable as well , that is , Î , ( * ) = 0 with ... Risk Minimization 53.
... risk minimization above performs even better as the size of the error improves to O ( d logn / n ) from 0 ( √d logn / n ) . Clearly , the data points are linearly separable as well , that is , Î , ( * ) = 0 with ... Risk Minimization 53.
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₁ фес