Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 29
Sivu 5
... point in a d - dimensional Euclidean space Ed called the pattern space . The rectangu- lar coordinates of the point ... sets in E2 which map into category numbers " points in Ed which are mapped into the number i . Then , for each category ...
... point in a d - dimensional Euclidean space Ed called the pattern space . The rectangu- lar coordinates of the point ... sets in E2 which map into category numbers " points in Ed which are mapped into the number i . Then , for each category ...
Sivu 24
... point sets . Suppose we are given R finite point sets P1 , P2 , i = 1 , · " ... " PR . " For each R , let the ith point set consist of the L points P , ( 1 ) , P , ( 2 ) , P ( L ) . Let us define the Euclidean distance d ( X , P ...
... point sets . Suppose we are given R finite point sets P1 , P2 , i = 1 , · " ... " PR . " For each R , let the ith point set consist of the L points P , ( 1 ) , P , ( 2 ) , P ( L ) . Let us define the Euclidean distance d ( X , P ...
Sivu 26
... point sets is a special case . ( 2 ) 2 R1 P 1 = ( 1 ) { P , P2 ) } = 2 { Pa1 ) , p ( 2 ) } ( 1 ) 1 2 ( 2 ) R , FIGURE 2.7 Decision regions for a minimum - distance classifier with respect to the point sets P1 , P2 The structure of Fig ...
... point sets is a special case . ( 2 ) 2 R1 P 1 = ( 1 ) { P , P2 ) } = 2 { Pa1 ) , p ( 2 ) } ( 1 ) 1 2 ( 2 ) R , FIGURE 2.7 Decision regions for a minimum - distance classifier with respect to the point sets P1 , P2 The structure of Fig ...
Sisältö
Preface vii | 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 belonging to category Chapter cluster committee machine committee TLUS components correction increment covariance matrix 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 Stanford subsets X1 subsidiary discriminant functions Suppose terns training patterns training sequence training set training subsets transformation two-layer machine values W₁ wa+1 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 |