Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 33
Sivu 29
... is of somewhat lesser importance and is discussed in detail in the Appendix .
To explain the more important implementation we first define the M - dimensional
vector F whose components f1 , f2 , . . . , fm are functions of the Xi , i = 1 , . . . , d .
... is of somewhat lesser importance and is discussed in detail in the Appendix .
To explain the more important implementation we first define the M - dimensional
vector F whose components f1 , f2 , . . . , fm are functions of the Xi , i = 1 , . . . , d .
Sivu 50
ties might then be : number of typical patterns belonging to category 1 for which
the ith component equals one - Ni number of typical ... 5 , we assumed that the
pattern components were statistically independent , binary , random variables .
ties might then be : number of typical patterns belonging to category 1 for which
the ith component equals one - Ni number of typical ... 5 , we assumed that the
pattern components were statistically independent , binary , random variables .
Sivu 111
Since U is a binary vector with P components there are 2P distinct U vectors . For
some of these U vectors , H ( U ) = 1 , and for the remaining , H ( U ) = - 1 . Let Hi
be a matrix whose rows consist of those U vectors for which H ( U ) = + 1 . Let Hy
...
Since U is a binary vector with P components there are 2P distinct U vectors . For
some of these U vectors , H ( U ) = 1 , and for the remaining , H ( U ) = - 1 . Let Hi
be a matrix whose rows consist of those U vectors for which H ( U ) = + 1 . Let Hy
...
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 |