Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 35
Sivu 37
... pattern space satisfying the equations g ( X ) = 0 are families of surfaces . The separations that these surfaces ( called surfaces ) effect on a set X of N points are called dichotomies . If there is no surface in the pattern space ...
... pattern space satisfying the equations g ( X ) = 0 are families of surfaces . The separations that these surfaces ( called surfaces ) effect on a set X of N points are called dichotomies . If there is no surface in the pattern space ...
Sivu 104
... pattern space is trans- formed into one of the vertices of a P1 - dimensional hypercube . This hypercube we shall call the first image space or the I1 space . The trans- formation between the pattern space and the I1 space depends on ...
... pattern space is trans- formed into one of the vertices of a P1 - dimensional hypercube . This hypercube we shall call the first image space or the I1 space . The trans- formation between the pattern space and the I1 space depends on ...
Sivu 105
... Pattern space 1,4,5,8 3 TLU 3 Origin TLU 2 * 3,7 TLU 1 ( b ) Image space 2 FIGURE 6.6 Pattern - space to image ... space . Thus , the four patterns 1 , 4 , 5 , and 8 all map into the same image vertex because they all belong to the ...
... Pattern space 1,4,5,8 3 TLU 3 Origin TLU 2 * 3,7 TLU 1 ( b ) Image space 2 FIGURE 6.6 Pattern - space to image ... space . Thus , the four patterns 1 , 4 , 5 , and 8 all map into the same image vertex because they all belong to the ...
Sisältö
TRAINABLE PATTERN CLASSIFIERS | 1 |
PARAMETRIC TRAINING METHODS | 43 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
Tekijänoikeudet | |
3 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
adjusted apply assume bank called cells changes Chapter classifier cluster column committee machine components consider consists contains correction corresponding covariance decision surfaces define denote density depends described discriminant functions discussed distance distributions elements equal error-correction estimates example exist expression FIGURE fixed given implemented initial layered machine linear machine linearly separable lines majority matrix mean measurements modes negative networks nonparametric normal Note optimum origin parameters partition pattern hyperplane pattern space pattern vector pattern-classifying 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 |