Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 26
Sivu 5
... consider the sets shown in Fig . 1.2 where d 2 and R = 3. A point in the plane is mapped into the numbers 1 , 2 , or 3 , according to its membership in R1 , R2 , or R3 , respectively . For example , the pattern ( 5 , -3 ) would be ...
... consider the sets shown in Fig . 1.2 where d 2 and R = 3. A point in the plane is mapped into the numbers 1 , 2 , or 3 , according to its membership in R1 , R2 , or R3 , respectively . For example , the pattern ( 5 , -3 ) would be ...
Sivu 24
... consider those of a minimum - distance classifier with respect to point sets . i = 1 ,. Suppose we are given R finite point sets P1 , P2 , . . . , PR . For each R , let the ith point set consist of the L points P ( 1 ) , P , ( 2 ) , P ...
... consider those of a minimum - distance classifier with respect to point sets . i = 1 ,. Suppose we are given R finite point sets P1 , P2 , . . . , PR . For each R , let the ith point set consist of the L points P ( 1 ) , P , ( 2 ) , P ...
Sivu 97
... Consider the three pattern hyperplanes ( lines ) in Fig . 6.3 for the case D = d + 1 = 2. The arrows attached to the lines point toward the posi- tive sides of the lines . These lines divide the weight space into six regions ; thus ...
... Consider the three pattern hyperplanes ( lines ) in Fig . 6.3 for the case D = d + 1 = 2. The arrows attached to the lines point toward the posi- tive sides of the lines . These lines divide the weight space into six regions ; thus ...
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 |