Gabriel Santos Barbosa, Leonardo da Silva Costa, Ajalmar Rêgo da Rocha Neto
{"title":"A New Genetic Algorithm-Based Pruning Approach for Optimum-Path Forest","authors":"Gabriel Santos Barbosa, Leonardo da Silva Costa, Ajalmar Rêgo da Rocha Neto","doi":"10.1109/bracis.2018.00011","DOIUrl":null,"url":null,"abstract":"Optimum-Path Forest (OPF) is a graph-based supervised classifier that has achieved remarkable performances in many applications. OPF has many advantages when compared to other supervised classifiers, since it is free of parameters, achieves zero classification errors on the training set without overfitting, handles multiple classes without modifications or extensions, and does not make assumptions about the shape and separability of the classes. However, one drawback of the OPF classifier is the fact that its classification computational cost grows proportionally to the size of the training set. To overcome this issue, we propose a novel method based on genetic algorithms (GAs) to prune irrelevant training samples and still preserve or even improve accuracy in OPF classification. We validate the method using public datasets obtained from UCI repository.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/bracis.2018.00011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Optimum-Path Forest (OPF) is a graph-based supervised classifier that has achieved remarkable performances in many applications. OPF has many advantages when compared to other supervised classifiers, since it is free of parameters, achieves zero classification errors on the training set without overfitting, handles multiple classes without modifications or extensions, and does not make assumptions about the shape and separability of the classes. However, one drawback of the OPF classifier is the fact that its classification computational cost grows proportionally to the size of the training set. To overcome this issue, we propose a novel method based on genetic algorithms (GAs) to prune irrelevant training samples and still preserve or even improve accuracy in OPF classification. We validate the method using public datasets obtained from UCI repository.