Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 23
Sivu 37
... Corresponding to each point X in the pattern space there is a point F = { fi ( X ) , { ƒı ( X ) , . . . fм ( X ) ) in space ; therefore , corresponding to the set X of N points in Ž general position in the pattern space , there is a set ...
... Corresponding to each point X in the pattern space there is a point F = { fi ( X ) , { ƒı ( X ) , . . . fм ( X ) ) in space ; therefore , corresponding to the set X of N points in Ž general position in the pattern space , there is a set ...
Sivu 67
... Corresponding to the training subsets X1 and X2 there are subsets of D - dimensional , augmented patterns Y1 and Y2 . Each element of y1 and Y2 is obtained by augmenting the patterns in X1 and X2 , respectively . We shall denote the ...
... Corresponding to the training subsets X1 and X2 there are subsets of D - dimensional , augmented patterns Y1 and Y2 . Each element of y1 and Y2 is obtained by augmenting the patterns in X1 and X2 , respectively . We shall denote the ...
Sivu 89
... corresponding sequence of vectors from the set Z. Let us denote this sequence of vectors from Z by the symbol Sz . Corresponding to the kth member , Ŷ of Sy is a vector Z in Sz . We determine Z as follows : Sup- pose that Ŷ belongs to Y ...
... corresponding sequence of vectors from the set Z. Let us denote this sequence of vectors from Z by the symbol Sz . Corresponding to the kth member , Ŷ of Sy is a vector Z in Sz . We determine Z as follows : Sup- pose that Ŷ belongs to Y ...
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 step subsidiary discriminant Suppose terns 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 |