Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 15
Sivu 20
... and only if a hyperplane exists which has each member of X , on one side and
each member of X2 on the other side . Because the decision regions of a linear
machine are convex 20 SOME IMPORTANT DISCRIMINANT FUNCTIONS.
... and only if a hyperplane exists which has each member of X , on one side and
each member of X2 on the other side . Because the decision regions of a linear
machine are convex 20 SOME IMPORTANT DISCRIMINANT FUNCTIONS.
Sivu 69
That is , W is either on the negative side of or on the pattern hyperplane
corresponding to Y . This error can be rectified by moving W to the positive side of
the pattern hyperplane . The most direct path to the other side is along a line
normal to ...
That is , W is either on the negative side of or on the pattern hyperplane
corresponding to Y . This error can be rectified by moving W to the positive side of
the pattern hyperplane . The most direct path to the other side is along a line
normal to ...
Sivu 71
For i = 0 , the weight point is not moved at all ; for i = 1 , the weight point is moved
to the pattern hyperplane ; and for 1 = 2 , the weight point is reflected across the
pattern hyperplane to a point an equal distance on the other side .
For i = 0 , the weight point is not moved at all ; for i = 1 , the weight point is moved
to the pattern hyperplane ; and for 1 = 2 , the weight point is reflected across the
pattern hyperplane to a point an equal distance on the other side .
Mitä ihmiset sanovat - Kirjoita arvostelu
Yhtään arvostelua ei löytynyt.
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 Development discriminant functions discussed distance distribution element equal error-correction estimates example exists expression FIGURE fixed gi(X given implemented important initial layered machine linear dichotomies linear machine linearly separable matrix measurements networks 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 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 |
Kirjaluettelon tiedot
| Otsikko | Learning Machines: Foundations of Trainable Pattern-classifying Systems McGraw-Hill series in systems science |
| Kirjoittaja | Nils J. Nilsson |
| Painos | kuvitettu |
| Kustantaja | McGraw-Hill, 1965 |
| ISBN | 0070465703, 9780070465701 |
| Pituus | 137 sivua |
| Vie sitaatti | BiBTeX EndNote RefMan |