Prototype Generation with the sUpervised Classifier System on kNN Matching

This paper focuses on “prototypes” as representative samples that can serve as a summary of the original dataset and proposes a novel Learning Classifier System (LCS) to generate a small number of prototypes that can achieve high classification accuracy in class classification. Concretely kNNUCS-PG is proposed to improve the sUpervised Classifier System (UCS) as one of LCSs by changing from the interval (rule) representation to the point representation to represent a prototype by employing k-nearest neighbors (kNN) to match the neighborhood prototypes. For a high classification accuracy with data reduction, selecting and generating prototypes that can maintain decision boundaries is necessary. Since UCS has generalization mechanisms, including rule merging, unnecessary rule deletion, and new rule discovery using niche Genetic Algorithm (GA), such techniques are highly useful for evolving indispensable prototypes as generalized prototypes. This paper compared conventional prototype-based methods with kNNUCS-PG in experiments using three benchmark problems and eight table datasets. kNNU CS-PG can maintain high classification accuracy even for complex problems with much overlap in the datasets. The results show that kNNUCS-PG is a robust PG that can maintain high classification accuracy while reducing data for various complex problems.