Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 19
Sivu 11
... apply to a large class of discriminant functions and are therefore of funda- mental importance . The concept of a layered machine is introduced in Chapter 6. Most of the pattern classifiers containing threshold elements that have been ...
... apply to a large class of discriminant functions and are therefore of funda- mental importance . The concept of a layered machine is introduced in Chapter 6. Most of the pattern classifiers containing threshold elements that have been ...
Sivu 90
... apply this rule to each element of Sp to generate the sequence Sz . The final step of the proof is to form a sequence Sy of RD - dimensional weight vectors from the reduced weight - vector sequences , Sŵ ,, . . . , SŴR . Let V be the ...
... apply this rule to each element of Sp to generate the sequence Sz . The final step of the proof is to form a sequence Sy of RD - dimensional weight vectors from the reduced weight - vector sequences , Sŵ ,, . . . , SŴR . Let V be the ...
Sivu 122
... apply the closest - mode method is a means of training a PWL machine such that the modes are identified and the appropriate discriminant functions are set up . This training process should be an iterative one , operating on a sequence ...
... apply the closest - mode method is a means of training a PWL machine such that the modes are identified and the appropriate discriminant functions are set up . This training process should be an iterative one , operating on a sequence ...
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 |