Learning Machines: Foundations of Trainable Pattern-classifying SystemsMcGraw-Hill, 1965 - 137 sivua |
Kirjan sisältä
Tulokset 1 - 3 kokonaismäärästä 5
Sivu 120
... Fix and Hodges method.2 To determine the discriminant functions by the Fix and Hodges method , we first select some large positive integer k , which is small com- pared to the number of patterns in each of the training subsets . Next ...
... Fix and Hodges method.2 To determine the discriminant functions by the Fix and Hodges method , we first select some large positive integer k , which is small com- pared to the number of patterns in each of the training subsets . Next ...
Sivu 121
... Fix and Hodges method render it impractical in most pattern - classification tasks . To classify any pat- tern X , the distance between X and each of the patterns in the training subsets must be computed . If these computations are to ...
... Fix and Hodges method render it impractical in most pattern - classification tasks . To classify any pat- tern X , the distance between X and each of the patterns in the training subsets must be computed . If these computations are to ...
Sivu 122
... Fix and Hodges method . The concept of distance still plays an important role in a way which preserves some of the features of the Fix and Hodges method . It seems reasonable to assume that the k closest training patterns to a given ...
... Fix and Hodges method . The concept of distance still plays an important role in a way which preserves some of the features of the Fix and Hodges method . It seems reasonable to assume that the k closest training patterns to a given ...
Sisältö
TRAINABLE PATTERN CLASSIFIERS | 1 |
SOME NONPARAMETRIC TRAINING METHODS | 65 |
TRAINING THEOREMS | 79 |
Tekijänoikeudet | |
3 muita osia ei näytetty
Muita painoksia - Näytä kaikki
Yleiset termit ja lausekkeet
assume augmented pattern belonging to category Chapter cluster committee machine committee TLUS correction increment covariance matrix d-dimensional decision surfaces denote diagonal matrix discussed dot products error-correction procedure Euclidean distance example Fix and Hodges function g(X g₁(X given Hodges method hypersphere image-space implemented initial weight vectors ith bank layer of TLUS layered machine linear dichotomies linear discriminant functions linearly separable loss function mean vector minimum-distance classifier mode-seeking networks nonparametric number of patterns p₁ parameters partition pattern classifier pattern hyperplane pattern space pattern vector patterns belonging perceptron piecewise linear plane point sets positive probability distributions prototype pattern PWL machine quadratic form quadric function rule sample covariance matrix shown in Fig solution weight vectors Stanford subsets X1 subsidiary discriminant functions Suppose terns TLU response training patterns training sequence training set training subsets transformation two-layer machine values W₁ weight point weight space weight-vector sequence X1 and X2 zero
Viitteet tähän teokseen
A Probabilistic Theory of Pattern Recognition Luc Devroye,László Györfi,Gabor Lugosi Rajoitettu esikatselu - 1997 |