Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 60
Sivu 9
Discriminant functions are then chosen , by methods to be discussed in general below and more specifically later , which perform adequately on the training set . We shall say that these discriminant functions are obtained by training .
Discriminant functions are then chosen , by methods to be discussed in general below and more specifically later , which perform adequately on the training set . We shall say that these discriminant functions are obtained by training .
Sivu 11
Chapter 3 will investigate decision - theoretic parametric training methods . The mathematical foundation underlying these training methods seems to be more extensive than the theory supporting the nonparametric training methods .
Chapter 3 will investigate decision - theoretic parametric training methods . The mathematical foundation underlying these training methods seems to be more extensive than the theory supporting the nonparametric training methods .
Sivu 122
In the next section we shall present a candidate training method . 7.6 Mode - seeking and related training methods for PWL machines a > To apply the closest - mode decision method , we need a training procedure to locate the modes or ...
In the next section we shall present a candidate training method . 7.6 Mode - seeking and related training methods for PWL machines a > To apply the closest - mode decision method , we need a training procedure to locate the modes or ...
Mitä ihmiset sanovat - Kirjoita arvostelu
Yhtään arvostelua ei löytynyt.
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
adjusted apply assume bank belonging to category called changes Chapter cluster committee components consider consists contains correction corresponding covariance decision surfaces define denote density depends derivation Development discriminant functions discussed distance distribution element equal error-correction estimates example exists expression FIGURE fixed given implemented important initial layered machine linear dichotomies linear machine linearly separable matrix measurements negative networks normal Note optimum origin parameters partition pattern classifier pattern hyperplane pattern space pattern vector piecewise linear plane points positive presented probability problem proof properties proved PWL machine quadric reduced regions respect response rule sample mean selection separable shown side solution space Stanford step Suppose theorem theory threshold training methods training procedure training sequence training subsets transformation values weight vectors zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |