Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 19
Sivu 56
3.9 Some special cases involving identical covariance matrices gi ( X ) = For the optimum discriminant functions for normal patterns , expansion of Eq . ( 3:31 ) yields -12X42 - X + X'2 ; -M , – 12M ; * £ ; -Mi + log pi – 12 log | 2i ...
3.9 Some special cases involving identical covariance matrices gi ( X ) = For the optimum discriminant functions for normal patterns , expansion of Eq . ( 3:31 ) yields -12X42 - X + X'2 ; -M , – 12M ; * £ ; -Mi + log pi – 12 log | 2i ...
Sivu 58
i where N is the number of patterns in the training subset X ;; ( X ) ; is called the sample mean ( or center of gravity ) of the ith category , and ( 2 ) : is called the sample covariance matrix of the ith category .
i where N is the number of patterns in the training subset X ;; ( X ) ; is called the sample mean ( or center of gravity ) of the ith category , and ( 2 ) : is called the sample covariance matrix of the ith category .
Sivu 59
derived from the training set as if they were the known means and covariance matrices . If we assume appropriate probability distributions for the unknown mean vectors and covariance matrices , we can derive a training process which ...
derived from the training set as if they were the known means and covariance matrices . If we assume appropriate probability distributions for the unknown mean vectors and covariance matrices , we can derive a training process which ...
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 described Development 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 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 regions respect response rule sample mean selection separable shown side solution space 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 |