Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 34
Sivu 52
Contours of equal probability density ( 21220122122 +222 constant ) are ellipses , cen- tered on the origin , whose major axes lie along the line z1 = 22. The eccentricities of the ellipses are equal to 2012 VI + 012 When σ12 is zero ...
Contours of equal probability density ( 21220122122 +222 constant ) are ellipses , cen- tered on the origin , whose major axes lie along the line z1 = 22. The eccentricities of the ellipses are equal to 2012 VI + 012 When σ12 is zero ...
Sivu 58
i i i i For ( ) ; to be nonsingular , its rank must be equal to d . Since ( E ) ; has rank equal to rank QQ , which is equal to rank Qi , and since rank Q ; ≤ min ( d , N1 ) , rank ( Σ ) ; < d if N ; < d .
i i i i For ( ) ; to be nonsingular , its rank must be equal to d . Since ( E ) ; has rank equal to rank QQ , which is equal to rank Qi , and since rank Q ; ≤ min ( d , N1 ) , rank ( Σ ) ; < d if N ; < d .
Sivu 90
inaccurately classified as a member of y , when it actually belongs to Y .; Z is then expressed by Zk = Zijl ( k ) ( 5.33 ) That is , Z is a vector whose ith block of D components is set equal to Y , whose 7th 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 ( k ) ( 5.33 ) That is , Z is a vector whose ith block of D components is set equal to Y , whose 7th block of D components is ...
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 |