DSpace Repository

2. Strategies for scaling up evolutionary instance reduction algorithms for data ,ining

Show simple item record

dc.contributor.author Canol Jose Ramon
dc.contributor.author Herrera2 Fi-Ancisco
dc.contributor.author ~ Manuel ~ O Z A N O
dc.date.accessioned 2017-11-14T17:19:05Z
dc.date.available 2017-11-14T17:19:05Z
dc.date.issued 2006
dc.identifier.uri http://hdl.handle.net/123456789/4077
dc.description.abstract Evolutionary algorithms are adaptive methods based on natural evolution that may be used for search and optimization. As instance selection can be viewed as a search problem, it could be solved using evolutionary algorithms. In this chapter, we have carried out an empirical study of the performance of CHC as representative evolutionary algorithm model. This study includes a comparison between this algorithm and other non-evolutionary instance selection algorithms applied in different size data sets to evaluate the scaling up problem. The results show that the stratified evolutionary instance selection algorithms consistently outperform the non-evolutionary ones. The main advantages are: better instance reduction rates, higher classification accuracy and reduction in resources consumption.
dc.format application/pdf
dc.title 2. Strategies for scaling up evolutionary instance reduction algorithms for data ,ining
dc.type generic


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Browse

My Account