citeseer |
(0) (0 Votes)
|
Views: (1011) Date: (13-05-09) Pages: () |
Abstract: We derive an upper bound on the generalization error of classifiers from a certain class of threshold networks. The bound depends on the margin of the classifier and the average complexity of the hidden units (where the average is over the weights assigned to each hidden unit). By representing convex combinations of decision trees or mask perceptrons as such threshold networks we obtain similar bounds on the generalization error of these classifiers.