Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 37
Sivu 37
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 – K ) d L . ( 2:36 ) 2 • 15 The number of o function dichotomies Suppose our ...
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 – K ) d L . ( 2:36 ) 2 • 15 The number of o function dichotomies Suppose our ...
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
The three - dimensional I , space is then a cube , centered about the origin , whose vertices represent the eight possible combinations of responses of three TLUs . This cube is shown in Fig . 6:66 . If we number the coordinate axes of ...
The three - dimensional I , space is then a cube , centered about the origin , whose vertices represent the eight possible combinations of responses of three TLUs . This cube is shown in Fig . 6:66 . If we number the coordinate axes of ...
Mitä ihmiset sanovat - Kirjoita arvostelu
Yhtään arvostelua ei löytynyt.
Sisältö
I | 1 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
APPENDIX | 127 |
Tekijänoikeudet | |
1 muita osia ei näytetty
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 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 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 specific Stanford step Suppose theorem theory threshold training methods training patterns 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 |
Kirjaluettelon tiedot
| Otsikko | Learning Machines: Foundations of Trainable Pattern-classifying Systems McGraw-Hill series in systems science |
| Kirjoittaja | Nils J. Nilsson |
| Painos | kuvitettu |
| Kustantaja | McGraw-Hill, 1965 |
| ISBN | 0070465703, 9780070465701 |
| Pituus | 137 sivua |
| Vie sitaatti | BiBTeX EndNote RefMan |