Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 14
Sivu 85
Foundations of Trainable Pattern-classifying Systems Nils J. Nilsson. 5.4 Proof 2 The following proof of Theorem 5.1 results from a simple geometric argument revealing that it is impossible to apply the fixed - increment error ...
Foundations of Trainable Pattern-classifying Systems Nils J. Nilsson. 5.4 Proof 2 The following proof of Theorem 5.1 results from a simple geometric argument revealing that it is impossible to apply the fixed - increment error ...
Sivu 89
Foundations of Trainable Pattern-classifying Systems Nils J. Nilsson. Proof The proof of Theorem 5.2 is accomplished by reformulating the R - category problem as a dichotomy problem in a higher - dimensional space and then applying ...
Foundations of Trainable Pattern-classifying Systems Nils J. Nilsson. Proof The proof of Theorem 5.2 is accomplished by reformulating the R - category problem as a dichotomy problem in a higher - dimensional space and then applying ...
Sivu 108
... Proof - We have P TLUs , each of which implements a hyperplane in the pattern space . In this proof it will be convenient for the TLUS to have 0 , 1 responses rather than 1 , 1 responses . Since exactly P + 1 cells are occupied by ...
... Proof - We have P TLUs , each of which implements a hyperplane in the pattern space . In this proof it will be convenient for the TLUS to have 0 , 1 responses rather than 1 , 1 responses . Since exactly P + 1 cells are occupied by ...
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 |