Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 22
Sivu 10
Suppose the training set consisted of N1 patterns belonging to category 1 and N2 patterns belonging to category 2. Reasonable estimates for X , and X2 might then be the respective sample means ( centers of gravity ) of the patterns in ...
Suppose the training set consisted of N1 patterns belonging to category 1 and N2 patterns belonging to category 2. Reasonable estimates for X , and X2 might then be the respective sample means ( centers of gravity ) of the patterns in ...
Sivu 57
Suppose that a training set of typical patterns belonging to each of the R categories is available . It consists of R subsets denoted by X1 , X2 , ... , XR , where X ; is the training subset of all patterns belonging to category i .
Suppose that a training set of typical patterns belonging to each of the R categories is available . It consists of R subsets denoted by X1 , X2 , ... , XR , where X ; is the training subset of all patterns belonging to category i .
Sivu 75
A linear machine for classifying patterns belonging to more than two categories was defined in Chapter 2. It consists of R linear discriminators and a ... The subset Yi contains all training patterns in y belonging to category i .
A linear machine for classifying patterns belonging to more than two categories was defined in Chapter 2. It consists of R linear discriminators and a ... The subset Yi contains all training patterns in y belonging to category i .
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 |