Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 28
Sivu 69
... positive number called the correction increment . It controls the extent of the adjustment . For sufficiently large c , the weight point will cross the pattern hyperplane , and Y. W ' will be correctly positive . If W were incorrectly ...
... positive number called the correction increment . It controls the extent of the adjustment . For sufficiently large c , the weight point will cross the pattern hyperplane , and Y. W ' will be correctly positive . If W were incorrectly ...
Sivu 101
... positive ) dot products with Y. If the weight vector W ( ) is among this set of 1⁄2 ( N1 | + 1 ) weight vectors , it is adjusted by the rule k W ; ( k + 1 ) = W1 ( k ) + c , ( k ) Yk ( 6 · 7 ) where c ) is the correction increment which ...
... positive ) dot products with Y. If the weight vector W ( ) is among this set of 1⁄2 ( N1 | + 1 ) weight vectors , it is adjusted by the rule k W ; ( k + 1 ) = W1 ( k ) + c , ( k ) Yk ( 6 · 7 ) where c ) is the correction increment which ...
Sivu 127
... positive and negative parts Consider the quadric function g ( X ) = X'AX + B'X + C ( A ∙ 1 ) where A is a real , d X d , symmetric matrix , B is a d - dimensional column vector , and C is a scalar . The first term on the right - hand ...
... positive and negative parts Consider the quadric function g ( X ) = X'AX + B'X + C ( A ∙ 1 ) where A is a real , d X d , symmetric matrix , B is a d - dimensional column vector , and C is a scalar . The first term on the right - hand ...
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
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 function g(X g₁(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 subsets X1 subsidiary discriminant functions Suppose terns 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 |