Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 18
Sivu 24
2.7 Piecewise linear discriminant functions As a special case of discriminant functions which we shall call piecewise linear , we shall first consider those of a minimum - distance classifier with respect to point sets . i = 1 ,.
2.7 Piecewise linear discriminant functions As a special case of discriminant functions which we shall call piecewise linear , we shall first consider those of a minimum - distance classifier with respect to point sets . i = 1 ,.
Sivu 26
Any machine employing piecewise linear discriminant functions will be called a piecewise linear machine , of which a minimum - distance classi- fier with respect to point sets is a special case . R1 འ R2 ( 2 ) R1 FIGURE 2.7 ( 1 ) P1 ...
Any machine employing piecewise linear discriminant functions will be called a piecewise linear machine , of which a minimum - distance classi- fier with respect to point sets is a special case . R1 འ R2 ( 2 ) R1 FIGURE 2.7 ( 1 ) P1 ...
Sivu 135
... 77 Mean vector of normal patterns , 53 , 54 Measurements , 4 selection of , 4 Miller , 12 , 13 Minimization of Euclidean distances , 132 Minimum - distance classifiers , with respect to point sets , 24 , 121 with respect to points ...
... 77 Mean vector of normal patterns , 53 , 54 Measurements , 4 selection of , 4 Miller , 12 , 13 Minimization of Euclidean distances , 132 Minimum - distance classifiers , with respect to point sets , 24 , 121 with respect to points ...
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 |