Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 10
Sivu 101
... dot products closest to zero . ( Ties are resolved arbitrarily . ) These , in one sense , are the easiest to adjust . The adjustment is achieved by the familiar process of adding ( or subtracting ) the pattern vector to ( or from ) the ...
... dot products closest to zero . ( Ties are resolved arbitrarily . ) These , in one sense , are the easiest to adjust . The adjustment is achieved by the familiar process of adding ( or subtracting ) the pattern vector to ( or from ) the ...
Sivu 102
... dot products with each of the pattern vectors Y1 , Y2 , Ys ; then , adjustments to the weight vector ( s ) are made whenever Nx < 0. ( The reader could assume , for example , that Y1 contains Y2 and that Y2 contains - Y1 and -Y3 . ) k 1 ...
... dot products with each of the pattern vectors Y1 , Y2 , Ys ; then , adjustments to the weight vector ( s ) are made whenever Nx < 0. ( The reader could assume , for example , that Y1 contains Y2 and that Y2 contains - Y1 and -Y3 . ) k 1 ...
Sivu 103
... dot products with Y1 ) . At the next stage , examining the weight - vector positions with respect to the Y2 pattern hyperplane we see that all of them ( hence , again , the majority ) are on the correct side ; thus , no adjustments are ...
... dot products with Y1 ) . At the next stage , examining the weight - vector positions with respect to the Y2 pattern hyperplane we see that all of them ( hence , again , the majority ) are on the correct side ; thus , no adjustments are ...
Sisältö
TRAINABLE PATTERN CLASSIFIERS | 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 called cells changes Chapter cluster column committee machine components consider consists contains correction corresponding covariance decision surfaces define denote density depends described dichotomies discriminant functions discussed distance distributions elements equal error-correction estimates example exist expression FIGURE fixed given implemented important initial layered machine linear machine linearly separable lines majority matrix mean measurements modes negative networks nonparametric normal Note optimum origin parameters partition pattern classifier pattern hyperplane pattern space pattern vector piecewise linear plane points positive presented probability problem properties PWL machine quadric regions respect response rule selection separable sequence side solution space Stanford step subsidiary discriminant Suppose theorem theory threshold training methods training patterns training procedure training sequence training subsets transformation values weight vectors X1 and X2 Y₁ zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |