Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 33
Sivu 32
... number of dichotomies of N 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 ... number of linear dichotomies of N points dimensions, 1.
... number of dichotomies of N 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 ... number of linear dichotomies of N points dimensions, 1.
Sivu 33
... linear dichotomies of X ' . We wish to find out by how much this number of linear dichotomies is increased if the set X ' is enlarged to - 2 2 X. 1 13 4 5 6 X 4 -13 27 ( a ) Points in general position 4 16 ( b ) Three points collinear ...
... linear dichotomies of X ' . We wish to find out by how much this number of linear dichotomies is increased if the set X ' is enlarged to - 2 2 X. 1 13 4 5 6 X 4 -13 27 ( a ) Points in general position 4 16 ( b ) Three points collinear ...
Sivu 41
... number of linear dichotomies and the extension of these results to surfaces are also due to Cover.7 Based on experimental and theoretical results on the number of linear dichotomies , both Koford12 and Brown13 suggested that the ...
... number of linear dichotomies and the extension of these results to surfaces are also due to Cover.7 Based on experimental and theoretical results on the number of linear dichotomies , both Koford12 and Brown13 suggested that the ...
Sisältö
TRAINABLE PATTERN CLASSIFIERS | 1 |
PARAMETRIC TRAINING METHODS | 43 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
Tekijänoikeudet | |
4 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
assume augmented pattern belonging to category Chapter cluster committee machine committee TLUS components correction increment covariance matrix d-dimensional decision surfaces denote diagonal matrix discussed dot products error-correction procedure Euclidean distance example Fix and Hodges gi(X given Hodges method hypersphere image-space implemented initial weight vectors ith bank layer of TLUS layered machine linear dichotomies linear discriminant functions linearly separable loss function mean vector minimum-distance classifier mode-seeking networks nonparametric number of patterns p₁ parameters parametric training partition pattern hyperplane pattern points pattern space pattern vector pattern-classifying patterns belonging perceptron piecewise linear plane point sets positive probability distributions prototype pattern PWL machine quadratic form quadric function rule sample covariance matrix shown in Fig solution weight vectors Stanford subsets X1 subsidiary discriminant functions Suppose terns TLU response training patterns training sequence training set training subsets transformation two-layer machine values W₁ weight point weight space weight-vector sequence X1 and X2 zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |