Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 35
Sivu 37
Foundations of Trainable Pattern-classifying Systems Nils J. Nilsson. We see then that the effect of the K constraints imposed by Z is to reduce the dimensionality of the space by K. We then have Lz ( N , d ) = L ( N , d L ( N , d – K ) ...
Foundations of Trainable Pattern-classifying Systems Nils J. Nilsson. We see then that the effect of the K constraints imposed by Z is to reduce the dimensionality of the space by K. We then have Lz ( N , d ) = L ( N , d L ( N , d – K ) ...
Sivu 104
Thus , each point in the pattern space is transformed into one of the vertices of a Pi - dimensional hypercube . This hypercube we shall call the first image space or the I , space . The transformation between the pattern space and the ...
Thus , each point in the pattern space is transformed into one of the vertices of a Pi - dimensional hypercube . This hypercube we shall call the first image space or the I , space . The transformation between the pattern space and the ...
Sivu 105
If we number the coordinate axes of the image - space cube in accordance with the TLU TLU 3 5 7 6 TLU 3 8 TLU 1 1 Origin Origin TLU 2 X2 * 1,4,5,8 TLU 2 3,7 4 TLU 1 ( a ) Pattern space ( b ) Image space FIGURE 6.6 Pattern - space to ...
If we number the coordinate axes of the image - space cube in accordance with the TLU TLU 3 5 7 6 TLU 3 8 TLU 1 1 Origin Origin TLU 2 X2 * 1,4,5,8 TLU 2 3,7 4 TLU 1 ( a ) Pattern space ( b ) Image space FIGURE 6.6 Pattern - space to ...
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 described 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 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 |