Evolution and generalization of a single neurone:: II. Complexity of statistical classifiers and sample size considerations

✍ Scribed by Šarūnas Raudys

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 288 KB
• Volume: 11
• Category: Article
• ISSN: 0893-6080
• DOI: 10.1016/s0893-6080(97)00136-6

✦ Synopsis

Unlike many other investigations on this topic, the present one does not consider the nonlinear SLP as a single special type of the classification rule. In SLP training we can obtain seven statistical classifiers of differing complexity: (1) the Euclidean distance classifier; (2) the standard Fisher linear discriminant function (DF); (3) the Fisher linear DF with pseudo-inversion of the covariance matrix; (4) regularized linear discriminant analysis; (5) the generalized Fisher DF; (6) the minimum empirical error classifier; and (7) the maximum margin classifier. A survey of earlier and new results, referring to relationships between the complexity of six classifiers, generalization error, and the number of learning examples, is presented. These relationships depend on the complexities of both the classifier and the data. This knowledge indicates how to control the SLP classifier complexity purposefully by determining optimal values of the targets, learning-step and its change in the training process, the number of iterations, and addition or subtraction of a regularization term. A correct initialization of weights, and a simplifying data structure can help to reduce the generalization error.