Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 58
Sivu 56
... given by the values of the components of the transformed mean vector , ( d + 1 ) th weight is given by the value of the constant , = If R 2 , and if Σ1 g ( X ) can be written as g ( X ) = ΧΣ - ' ( Μι - log pi1⁄2M ; Σ - 1M ; -1M ;; the ...
... given by the values of the components of the transformed mean vector , ( d + 1 ) th weight is given by the value of the constant , = If R 2 , and if Σ1 g ( X ) can be written as g ( X ) = ΧΣ - ' ( Μι - log pi1⁄2M ; Σ - 1M ; -1M ;; the ...
Sivu 66
... given in terms of the weight - space representation . • 9 Wa , Wa + 1 . Suppose that the TLU has d + 1 weights , W1 , W2 , This set of weights can be represented by a point in a ( d + 1 ) -dimensional weight space . The rectangular ...
... given in terms of the weight - space representation . • 9 Wa , Wa + 1 . Suppose that the TLU has d + 1 weights , W1 , W2 , This set of weights can be represented by a point in a ( d + 1 ) -dimensional weight space . The rectangular ...
Sivu 121
... given the training subsets . Suppose the modes for the various categories , as established by a training procedure , are given by the points P. ) for i = 1 , 1 , . . . , R and j = 1 , , L. That is , there are Li typical patterns ...
... given the training subsets . Suppose the modes for the various categories , as established by a training procedure , are given by the points P. ) for i = 1 , 1 , . . . , R and j = 1 , , L. That is , there are Li typical patterns ...
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 |