Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 15
Sivu 102
... shown in Fig . 6 · 5 . The arrows indicate the positive sides of the lines . In this figure is shown the history of weight - vector adjustments produced by presenting the patterns in the order Y1 , Y2 , Yз , Y1 , Y2 , Yз , Y1 , Y2 , Yз ...
... shown in Fig . 6 · 5 . The arrows indicate the positive sides of the lines . In this figure is shown the history of weight - vector adjustments produced by presenting the patterns in the order Y1 , Y2 , Yз , Y1 , Y2 , Yз , Y1 , Y2 , Yз ...
Sivu 106
... shown in Fig . 6 · 7a . In this figure the points marked repre- sent patterns belonging to X1 , and the points marked O represent pat- terns belonging to X2 . Clearly the TLUs in the first layer of the desired layered machine must at ...
... shown in Fig . 6 · 7a . In this figure the points marked repre- sent patterns belonging to X1 , and the points marked O represent pat- terns belonging to X2 . Clearly the TLUs in the first layer of the desired layered machine must at ...
Sivu 108
... shown in Fig . 6.8 . Note that the partition shown in Fig . 6-7a is also nonredundant . A nonredundant partition is not necessarily one that uses a minimum number of hyperplanes , however . Thus in Fig . 6-8a , one hyperplane ( line ) ...
... shown in Fig . 6.8 . Note that the partition shown in Fig . 6-7a is also nonredundant . A nonredundant partition is not necessarily one that uses a minimum number of hyperplanes , however . Thus in Fig . 6-8a , one hyperplane ( line ) ...
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 |