Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 4
Sivu 122
... Fix and Hodges method . The concept of distance still plays an important role in a way which preserves some of the features of the Fix and Hodges method . It seems reasonable to assume that the k closest training patterns to a given ...
... Fix and Hodges method . The concept of distance still plays an important role in a way which preserves some of the features of the Fix and Hodges method . It seems reasonable to assume that the k closest training patterns to a given ...
Sivu 125
... Fix and Hodges method , presented in Sec . 7-4 , is the obvious R - category generalization of the two - category method whose properties were studied by Fix and Hodges.2 Achieving a reduction in storage re- quirements by ignoring all ...
... Fix and Hodges method , presented in Sec . 7-4 , is the obvious R - category generalization of the two - category method whose properties were studied by Fix and Hodges.2 Achieving a reduction in storage re- quirements by ignoring all ...
Sivu 134
... Fix and Hodges method , 120 , 125 Fixed - increment rule , 70 proof of convergence of , 82 , 85 Fractional correction rule , 70 , 91 proof of convergence of , 91 Fundamental training theorem , 79 Gaussian probability - density function ...
... Fix and Hodges method , 120 , 125 Fixed - increment rule , 70 proof of convergence of , 82 , 85 Fractional correction rule , 70 , 91 proof of convergence of , 91 Fundamental training theorem , 79 Gaussian probability - density function ...
Sisältö
Preface vii | 11 |
PARAMETRIC TRAINING METHODS | 43 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
Tekijänoikeudet | |
5 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 important 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 terns theorem theory threshold training methods training patterns training procedure training sequence training subsets transformation values weight vectors Y₁ zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |