Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 27
Sivu 3
... response represents a category into which a pattern may be placed , and we shall accordingly label the response values by the integers 1 , . . . , R. It is the purpose of this chapter to develop further this basic model and to introduce ...
... response represents a category into which a pattern may be placed , and we shall accordingly label the response values by the integers 1 , . . . , R. It is the purpose of this chapter to develop further this basic model and to introduce ...
Sivu 72
... response for one pattern may very well undo a correction made on a previous pattern . Eventually , however , one last correction will be made that does not affect the correct response to the other patterns . 4.4 A numerical example of ...
... response for one pattern may very well undo a correction made on a previous pattern . Eventually , however , one last correction will be made that does not affect the correct response to the other patterns . 4.4 A numerical example of ...
Sivu 100
... response will be +1 . Since P is odd , NÅ can never equal zero or be even . P 1 We have assumed that at the kth ... response . The * For simplicity of explanation in describing the operation of a committee machine we assume that a dot ...
... response will be +1 . Since P is odd , NÅ can never equal zero or be even . P 1 We have assumed that at the kth ... response . The * For simplicity of explanation in describing the operation of a committee machine we assume that a dot ...
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 |