Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 36
Sivu 28
0 equal to zero only for X = 0 When these conditions are met , both the matrix A and the quadratic form are called positive definite . If A has one or more of its eigenvalues equal to zero and all the others positive , then the ...
0 equal to zero only for X = 0 When these conditions are met , both the matrix A and the quadratic form are called positive definite . If A has one or more of its eigenvalues equal to zero and all the others positive , then the ...
Sivu 54
Patterns selected according to this joint proba- bility distribution will be called multivariate normal patterns or , more simply , normal patterns . The expression for the d - variate normal proba- bility distribution is almost ...
Patterns selected according to this joint proba- bility distribution will be called multivariate normal patterns or , more simply , normal patterns . The expression for the d - variate normal proba- bility distribution is almost ...
Sivu 69
That is , W ' = W + cY ( 4-4 ) where c is a 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 ...
That is , W ' = W + cY ( 4-4 ) where c is a 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 ...
Mitä ihmiset sanovat - Kirjoita arvostelu
Yhtään arvostelua ei löytynyt.
Sisältö
TRAINABLE PATTERN CLASSIFIERS | 1 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
TRAINING THEOREMS | 79 |
Tekijänoikeudet | |
2 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
adjusted apply assume bank called cells changes Chapter cluster column committee machine components consider consists contains correction corresponding covariance decision surfaces define denote density depends described dichotomies 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 classifier pattern hyperplane pattern space pattern vector 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 theorem theory threshold training methods training patterns training procedure training sequence training subsets transformation values weight vectors X1 and X2 Y₁ zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |