Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 23
Sivu 16
... consider first the family of discriminant functions of the form g ( X ) = W1X1 + W2X2 + • + waxa + wa + 1 ( 2.2 ) This function is a linear function of the components of X ; we shall denote discriminant functions of this form by the ...
... consider first the family of discriminant functions of the form g ( X ) = W1X1 + W2X2 + • + waxa + wa + 1 ( 2.2 ) This function is a linear function of the components of X ; we shall denote discriminant functions of this form by the ...
Sivu 24
... consider those of a minimum - distance classifier with respect to point sets . i = ངག • Suppose we are given R finite point sets P1 , P2 , . . . , PR . For each .. , R , let the ith point set consist of the L ; points P , ( 1 ) , P ...
... consider those of a minimum - distance classifier with respect to point sets . i = ངག • Suppose we are given R finite point sets P1 , P2 , . . . , PR . For each .. , R , let the ith point set consist of the L ; points P , ( 1 ) , P ...
Sivu 32
... consider the case N = 4 , d 2 as an example . Figure 2-9a shows four points in a two- dimensional space . The lines li , i = 1 , 7 effect all possible linear partitions of these four points . Consider l , in particular . It could be the ...
... consider the case N = 4 , d 2 as an example . Figure 2-9a shows four points in a two- dimensional space . The lines li , i = 1 , 7 effect all possible linear partitions of these four points . Consider l , in particular . It could be the ...
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 assume augmented pattern belonging to category binary called Chapter cluster committee machine components Cornell Aeronautical Laboratory correction increment covariance matrix d-dimensional decision regions decision surfaces denote density function discussed dot products equal error-correction procedure Euclidean distance example Fix and Hodges fixed-increment error-correction function family g₁(X gi(X given hypersphere image-space implemented initial weight vectors layered machine linear dichotomies linear discriminant functions linearly separable loss function Lx(i mean vector minimum-distance classifier number of linear number of patterns optimum classifier parameters partition pattern classifier pattern hyperplane pattern points pattern space pattern vector pattern-classifying machines patterns belonging Perceptron piecewise linear point sets positive probability distributions prototype pattern PWL machine quadratic form quadric discriminant function quadric function sample covariance matrix solution weight vector Stanford subsets X1 Suppose training patterns training sequence training set training subsets values W₁ wa+1 weight point weight space X₁ 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 |