Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 20
Sivu 52
... zero , the contours of equal probability are circles ( zero eccentricity ) . The expression for the bivariate normal density function for the unnormalized and untranslated variables x and x2 is more complicated * than that of Eq ...
... zero , the contours of equal probability are circles ( zero eccentricity ) . The expression for the bivariate normal density function for the unnormalized and untranslated variables x and x2 is more complicated * than that of Eq ...
Sivu 70
... zero . In one case , c is taken to be the smallest integer which will make the value of W Y cross the threshold of zero . That is , we desire that • WY ( W + cY ) . Y > 0 = for W. Y erroneously nonpositive and · W ' . Y = ( WcY ) Y < 0 ...
... zero . In one case , c is taken to be the smallest integer which will make the value of W Y cross the threshold of zero . That is , we desire that • WY ( W + cY ) . Y > 0 = for W. Y erroneously nonpositive and · W ' . Y = ( WcY ) Y < 0 ...
Sivu 100
... zero components . The patterns are arranged in a train- ing sequence and presented to the machine , one at a time ... zero and the machine response will be +1 . Since P is odd , Nk can never equal zero or be even . . " - We have assumed ...
... zero components . The patterns are arranged in a train- ing sequence and presented to the machine , one at a time ... zero and the machine response will be +1 . Since P is odd , Nk can never equal zero or be even . . " - We have assumed ...
Sisältö
TRAINABLE PATTERN CLASSIFIERS | 1 |
PARAMETRIC TRAINING METHODS | 43 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
Tekijänoikeudet | |
2 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
adjusted apply assume bank belonging to category called changes Chapter cluster committee components consider consists contains correction corresponding decision surfaces define denote density depends derivation described Development discriminant functions discussed distance distribution element equal error-correction estimates example exists expression FIGURE fixed given implemented important initial layered machine linear dichotomies linear discriminant functions linear machine linearly separable measurements negative networks normal Note optimum origin parameters partition pattern classifier pattern hyperplane pattern space pattern vector piecewise linear plane points positive presented probability problem proof properties proved PWL machine quadric reduced regions respect response rule sample mean selection separable shown side space Stanford step subsidiary discriminant Suppose theorem theory threshold training methods training procedure training sequence training subsets transformation values weight vectors zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |