Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 21
Sivu 47
... expression gi ( X ) = log p ( Xi ) + log p ( i ) for i = 1 , ... . , ( 3.7a ) R ( 3.76 ) which leads to the same decisions since the log function is a monotonic- increasing function of its argument . 3.5 An example Suppose that we wish ...
... expression gi ( X ) = log p ( Xi ) + log p ( i ) for i = 1 , ... . , ( 3.7a ) R ( 3.76 ) which leads to the same decisions since the log function is a monotonic- increasing function of its argument . 3.5 An example Suppose that we wish ...
Sivu 52
... expression for the bivariate normal density function for the unnormalized and untranslated variables 1 and 2 is more complicated * than that of Eq . ( 3 · 18 ) , but the general properties of the function are easily described . The ...
... expression for the bivariate normal density function for the unnormalized and untranslated variables 1 and 2 is more complicated * than that of Eq . ( 3 · 18 ) , but the general properties of the function are easily described . The ...
Sivu 54
... expression for the d - variate normal proba- bility distribution is almost identical in form to that of Eq . ( 3.21 ) . It is the following : 1 p ( X ) = ( 2π ) d / 2 exp ( -2 ( X - M ) ' Σ − 1 ( X — M ) } ( 3.24 ) The various terms ...
... expression for the d - variate normal proba- bility distribution is almost identical in form to that of Eq . ( 3.21 ) . It is the following : 1 p ( X ) = ( 2π ) d / 2 exp ( -2 ( X - M ) ' Σ − 1 ( X — M ) } ( 3.24 ) The various terms ...
Sisältö
TRAINABLE PATTERN CLASSIFIERS | 1 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
TRAINING THEOREMS | 79 |
Tekijänoikeudet | |
2 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
adjusted apply assume bank called cells changes Chapter cluster column committee machine components consider consists contains correction corresponding covariance decision surfaces define denote density depends described dichotomies discriminant functions discussed distance distributions elements equal error-correction estimates example exist expression FIGURE fixed given implemented important initial layered machine linear machine linearly separable lines majority matrix mean measurements modes negative networks nonparametric normal Note optimum origin parameters partition pattern classifier pattern hyperplane pattern space pattern vector piecewise linear plane points positive presented probability problem properties PWL machine quadric regions respect response rule selection separable sequence side solution space Stanford step subsidiary discriminant Suppose theorem theory threshold training methods training patterns training procedure training sequence training subsets transformation values weight vectors X1 and X2 Y₁ zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |