Learning Machines: Foundations of Trainable Pattern-classifying Systems |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 13
Sivu
An example of a deliberate omission is the subject of measurement selection ,
sometimes called preprocessing . The selection of the measurements or
properties on which recognition is based is one of the most important problems in
pattern ...
An example of a deliberate omission is the subject of measurement selection ,
sometimes called preprocessing . The selection of the measurements or
properties on which recognition is based is one of the most important problems in
pattern ...
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 situation .
Before ...
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 situation .
Before ...
Sivu 8
In the following sections we shall discuss a class of methods by which this
selection might be made . 1 : 6 The selection of discriminant functions
Discriminant functions can be selected in a variety of ways . Sometimes they are
calculated with ...
In the following sections we shall discuss a class of methods by which this
selection might be made . 1 : 6 The selection of discriminant functions
Discriminant functions can be selected in a variety of ways . Sometimes they are
calculated with ...
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 |