Classiiers That Approximate Functions Classiiers That Approximate Functions
نویسنده
چکیده
A classiier system, XCSF, is introduced in which the prediction estimation mechanism is used to learn approximations to functions. The addition of weight vectors to the classiiers allows piecewise-linear approximation, where the classiier's prediction is calculated instead of being a xed scalar. The weight vector and the classiier's condition co-adapt. Results on functions of up to six dimensions show high accuracy. The idea of calculating the prediction leads to the concept of a generalized classiier in which the payoo prediction approximates the environmental payoo function over a subspace deened by the classiier condition and an action restriction speciied in the classiier, permitting continuous-valued actions.
منابع مشابه
Bounding the Generalization Error of Convex Combinations of Classiiers: Balancing the Dimensionality and the Margins
A problem of bounding the generalization error of a classiier f 2 conv(H); where H is a "base" class of functions (classiiers), is considered. This problem frequently occurs in computer learning, where eecient algorithms of combining simple classiiers into a complex one (such as boosting and bagging) have attracted a lot of attention. Using Talagrand's concentration inequalities for empirical p...
متن کاملBuilding Ensembles of Classi ers for Loss Minimization
One of the most active areas of research in supervised learning has been the study of methods for constructing good ensembles of classiiers, that is, a set of classi-ers whose individual decisions are combined to increase overall accuracy of classifying new examples. In many applications classiiers are required to minimize an asym-metric loss function rather than the raw misclassiication rate. ...
متن کاملA contribution to approximate analytical evaluation of Fourier series via an Applied Analysis standpoint; an application in turbulence spectrum of eddies
In the present paper, we shall attempt to make a contribution to approximate analytical evaluation of the harmonic decomposition of an arbitrary continuous function. The basic assumption is that the class of functions that we investigate here, except the verification of Dirichlet's principles, is concurrently able to be expanded in Taylor's representation, over a particular interval of their do...
متن کاملFrankenstein Classiiers: Some Experiments
We present some empirical results on the use of two methods for integrating diierent classiiers into a hybrid classiier that should perform better than each of its constituent classiiers. The main point of these methods is that instead of combining full classiiers, they combine pieces of them. One of the methods is based on ROC analysis; the other is based on augmenting the data with features d...
متن کاملOn Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کامل