Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 36
Sivu 52
Contours of equal probability density ( z12 20122122 +222 = constant ) are ellipses , cen- tered on the origin , whose major axes lie along the line 21 eccentricities of the ellipses are equal to 2012 VI + 012 = 22.
Contours of equal probability density ( z12 20122122 +222 = constant ) are ellipses , cen- tered on the origin , whose major axes lie along the line 21 eccentricities of the ellipses are equal to 2012 VI + 012 = 22.
Sivu 58
Since ( Σ ) ; has rank equal to rank Q.Q , which is equal to rank Q. , and since rank Q ; ≤ min ( d , N ; ) ... If N ; ≥ d , Q ; will have rank equal to d if and only if there are no linear dependencies among the rows of Qi .
Since ( Σ ) ; has rank equal to rank Q.Q , which is equal to rank Q. , and since rank Q ; ≤ min ( d , N ; ) ... If N ; ≥ d , Q ; will have rank equal to d if and only if there are no linear dependencies among the rows of Qi .
Sivu 90
inaccurately classified as a member of y , when it actually belongs to Y .; Z is then expressed by Zk Zijl ( Y ) ( 5.33 ) That is , Z is a vector whose ith block of D components is set equal to Ŷk , whose Ith block of D components is ...
inaccurately classified as a member of y , when it actually belongs to Y .; Z is then expressed by Zk Zijl ( Y ) ( 5.33 ) That is , Z is a vector whose ith block of D components is set equal to Ŷk , whose Ith block of D components is ...
Mitä ihmiset sanovat - Kirjoita arvostelu
Yhtään arvostelua ei löytynyt.
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 apply assume bank called cells changes Chapter classifier cluster column committee machine components consider consists contains correction corresponding covariance decision surfaces define denote density depends described discriminant functions discussed distance distributions elements equal error-correction estimates example exist expression FIGURE fixed given implemented initial layered machine linear machine linearly separable lines majority matrix mean measurements modes negative networks nonparametric normal Note optimum origin parameters partition pattern hyperplane pattern space pattern vector pattern-classifying piecewise linear plane points positive presented probability problem properties PWL machine quadric regions respect response rule selection separable sequence side solution space step subsidiary discriminant Suppose terns 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 |