Robustness and Evolution in an Adaptive System Application on Classification Task

  • Biondi J
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we proposed an approach to a single-step ClassifierSystem, in which the useful population is built by progressivelyspecializing classifiers. It has been applied to a classificationtask in a medical domain. To permit the system to explore alternativeswithout making decisions earlier in learning stages, all the classifiersthat might be selected are triggered and receive the resulting rewardcorresponding to their action. The payoff function involves the classifier'sperformance, its specificity and the system's performance (its robustness).Genetic operators are activated with a probability which dependson the system's robustness. During the test stages, no further learningtakes place and the system's performance is measured by the percentageof correct classification made on the second set of examples. Whenthe measure of performance is the highest, the population is stabilizedand contains the correct classifiers (the payoff function and geneticoperators have no more effect on classifiers). This approach achievesconvergency more quickly and makes it possible to have a final accuratepopulation without over-specializing.

Cite

CITATION STYLE

APA

Biondi, J. (1993). Robustness and Evolution in an Adaptive System Application on Classification Task. In Artificial Neural Nets and Genetic Algorithms (pp. 463–470). Springer Vienna. https://doi.org/10.1007/978-3-7091-7533-0_67

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free