Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 8
Sivu 23
... Euclidean distance from the origin to the hyperplane . We shall denote this distance by the symbol Aw , which we set equal to wa + 1 / w ) . ( If A > 0 , the origin is on the positive side of the hyperplane . ) The equation X. n + Aw ...
... Euclidean distance from the origin to the hyperplane . We shall denote this distance by the symbol Aw , which we set equal to wa + 1 / w ) . ( If A > 0 , the origin is on the positive side of the hyperplane . ) The equation X. n + Aw ...
Sivu 24
... Euclidean distance d ( X , P , ) from an arbi- trary point X to the point set P ; by d ( X , Pi ) = i min j = 1 , ... , Li | X — P , ( ~ | ( 2 · 16 ) That is , the distance between X and P , is the smallest of the distances between X ...
... Euclidean distance d ( X , P , ) from an arbi- trary point X to the point set P ; by d ( X , Pi ) = i min j = 1 , ... , Li | X — P , ( ~ | ( 2 · 16 ) That is , the distance between X and P , is the smallest of the distances between X ...
Sivu 119
... distances between a pattern to be classified and members of the training subsets . Sometimes the distance used is not simple Euclidean distance , but some function that depends on the geometric arrangement of the patterns PIECEWISE ...
... distances between a pattern to be classified and members of the training subsets . Sometimes the distance used is not simple Euclidean distance , but some function that depends on the geometric arrangement of the patterns PIECEWISE ...
Sisältö
TRAINABLE PATTERN CLASSIFIERS | 1 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
TRAINING THEOREMS | 79 |
Tekijänoikeudet | |
2 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
adjusted apply assume bank called cells changes Chapter cluster column committee machine components consider consists contains correction corresponding covariance decision surfaces define denote density depends described dichotomies 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 classifier pattern hyperplane pattern space pattern vector 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 |