Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 16
Sivu 4
1 : 3 The problem of what to measure In assuming that the data to be classified consist of d real numbers , we are obliged to mention , at least briefly , the difficulties that attend selecting these numbers from any given physical ...
1 : 3 The problem of what to measure In assuming that the data to be classified consist of d real numbers , we are obliged to mention , at least briefly , the difficulties that attend selecting these numbers from any given physical ...
Sivu 12
A paper by Kanal et al.3 contains an excellent formulation of the pattern - classification problem and also points out that many schemes currently attracting the attention of engineers have antecedents in the statistical literature .
A paper by Kanal et al.3 contains an excellent formulation of the pattern - classification problem and also points out that many schemes currently attracting the attention of engineers have antecedents in the statistical literature .
Sivu 89
Proof The proof of Theorem 5.2 is accomplished by reformulating the R - category problem as a dichotomy problem in a higher - dimensional space and then applying Theorem 5.1 . The first step is to generate a new set Z of higher ...
Proof The proof of Theorem 5.2 is accomplished by reformulating the R - category problem as a dichotomy problem in a higher - dimensional space and then applying Theorem 5.1 . The first step is to generate a new set Z of higher ...
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 classifier cluster committee components consider consists contains correction corresponding decision surfaces define denote density depends derivation described discriminant functions discussed distance distribution element equal error-correction estimates example exists expression FIGURE fixed gi(X given illustrated implemented important initial known layered machine linear dichotomies linear machine linearly separable 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 selected separable shown side 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 |
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 |