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 ) ( 2 : 36
) 2 : 15 The number of o function dichotomies Suppose our discriminant function
...
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 ) ( 2 : 36
) 2 : 15 The number of o function dichotomies Suppose our discriminant function
...
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 Il space ...
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 Il space ...
Sivu 105
Suppose that these three TLUs comprise the first layer of a layered machine . 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 .
Suppose that these three TLUs comprise the first layer of a layered machine . 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 .
Mitä ihmiset sanovat - Kirjoita arvostelu
Yhtään arvostelua ei löytynyt.
Sisältö
Preface vii | 1 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
TRAINING THEOREMS | 79 |
Tekijänoikeudet | |
2 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 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
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 |
| Pituus | 137 sivua |
| Vie sitaatti | BiBTeX EndNote RefMan |