Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 18
Sivu 12
... contains an excellent formulation of the pattern - classification problem and also points out that many schemes currently attracting the attention of engineers have antecedents in the statistical literature . 4 The problem of data ...
... contains an excellent formulation of the pattern - classification problem and also points out that many schemes currently attracting the attention of engineers have antecedents in the statistical literature . 4 The problem of data ...
Sivu 36
... contain all the points of Z. We shall assume that the points of Z are in general position , meaning , in this case , that no ( K – 2 ) -dimensional hyperplane contains all of them . - The set Z The set X The set consists of three points ...
... contain all the points of Z. We shall assume that the points of Z are in general position , meaning , in this case , that no ( K – 2 ) -dimensional hyperplane contains all of them . - The set Z The set X The set consists of three points ...
Sivu 105
... contain pat- tern points . Two of these cells contain one pattern each ; one cell contains four patterns ; and one cell contains two patterns . Each nonempty cell in pattern space corresponds to a vertex in 91 space . Thus , the four ...
... contain pat- tern points . Two of these cells contain one pattern each ; one cell contains four patterns ; and one cell contains two patterns . Each nonempty cell in pattern space corresponds to a vertex in 91 space . Thus , the four ...
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 |