Binary classification is the problem of predicting which of two classes an input vector belongs to. This problem can be solved by using genetic programming to evolve discriminant functions which have a threshold output value that distinguishes between the two classes. The standard approach is to have a static threshold value of zero that is fixed throughout the evolution process. Items with a positive function output value are identified as one class and items with a negative function output value as the other class. We investigate a different approach where an optimum threshold is dynamically determined for each candidate function during the fitness evaluation. The optimum threshold is the one that achieves the lowest misclassification cost. It has an associated class translation rule for output values either side of the threshold value. The two approaches have been compared experimentally using four different datasets. Results suggest the dynamic threshold approach consistently achieves higher performance levels than the standard approach after equal numbers of fitness calls. © Springer-Verlag 2013.
CITATION STYLE
De Jong, J., & Neshatian, K. (2013). Binary classification using genetic programming: Evolving discriminant functions with dynamic thresholds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7867 LNAI, pp. 464–474). https://doi.org/10.1007/978-3-642-40319-4_40
Mendeley helps you to discover research relevant for your work.