Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 12
Sivu 106
By partition we mean that the hyperplanes divide TLU 3 O O Origin TLU 2 TLU 3 TLU 1 TLU 2 TLU 1 ( a ) Pattern space ( 6 ) ... The necessity for partitioning the sets X1 and X2 arises because corresponding to each nonempty cell in the ...
By partition we mean that the hyperplanes divide TLU 3 O O Origin TLU 2 TLU 3 TLU 1 TLU 2 TLU 1 ( a ) Pattern space ( 6 ) ... The necessity for partitioning the sets X1 and X2 arises because corresponding to each nonempty cell in the ...
Sivu 107
We know for example that it is necessary that these hyperplanes partition X1 and X2 . A set of conditions that are both necessary and sufficient have not yet been found , but in the next section we shall state some sufficient conditions ...
We know for example that it is necessary that these hyperplanes partition X1 and X2 . A set of conditions that are both necessary and sufficient have not yet been found , but in the next section we shall state some sufficient conditions ...
Sivu 108
2 partition with the property that if any one of the separating hyperplanes is removed , at least two nonempty cells will merge into one cell . Some examples of nonredundant and redundant partitions are shown in Fig . 6.8 .
2 partition with the property that if any one of the separating hyperplanes is removed , at least two nonempty cells will merge into one cell . Some examples of nonredundant and redundant partitions are shown in Fig . 6.8 .
Mitä ihmiset sanovat - Kirjoita arvostelu
Yhtään arvostelua ei löytynyt.
Sisältö
I | 1 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
APPENDIX | 127 |
Tekijänoikeudet | |
1 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
adjusted apply assume bank belonging to category called changes Chapter cluster committee components consider consists contains correction corresponding covariance decision surfaces define denote density depends derivation described discriminant functions discussed distance distribution element equal error-correction estimates example exists expression FIGURE fixed given implemented important initial layered machine linear dichotomies linear machine linearly separable matrix measurements negative normal Note optimum origin parameters partition pattern classifier pattern hyperplane pattern space pattern vector piecewise linear plane points positive presented probability problem proof properties proved PWL machine quadric reduced regions respect response rule sample mean selection separable shown side solution space specific Stanford step Suppose theorem theory threshold training methods training patterns training procedure training sequence training subsets transformation values weight vectors zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |