Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 54
Sivu 9
... pattern classifier is eventually to achieve must be achieved largely by an adjustment process , which has become ... points in category 1 tend to cluster close to some central cluster point X1 , and that the pattern points in category 2 ...
... pattern classifier is eventually to achieve must be achieved largely by an adjustment process , which has become ... points in category 1 tend to cluster close to some central cluster point X1 , and that the pattern points in category 2 ...
Sivu 32
... patterns that its members could effect . We shall show that if the positions of the N pattern points satisfy some quite mild conditions , the number of dichotomies that can be implemented by a ☀ function will depend only on the number ...
... patterns that its members could effect . We shall show that if the positions of the N pattern points satisfy some quite mild conditions , the number of dichotomies that can be implemented by a ☀ function will depend only on the number ...
Sivu 52
... pattern points in a two - dimensional space . Such patterns will be called bivariate normal patterns . They will tend to be grouped in an ellipsoidal cluster centered around the point ( m1 , m2 ) . Several such ellipsoidal clusters of ...
... pattern points in a two - dimensional space . Such patterns will be called bivariate normal patterns . They will tend to be grouped in an ellipsoidal cluster centered around the point ( m1 , m2 ) . Several such ellipsoidal clusters of ...
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 |