Hybridizing Cartesian Genetic Programming and Harmony Search for adaptive feature construction in supervised learning problems

Simple item page
dc.contributor.authorElola, Andoni
dc.contributor.authorDel Ser, Javier
dc.contributor.authorBilbao, Miren Nekane
dc.contributor.authorPerfecto, Cristina
dc.contributor.authorAlexandre, Enrique
dc.contributor.authorSalcedo-Sanz, Sancho
dc.contributor.institutionIA
dc.date.issued2016
dc.descriptionPublisher Copyright: © 2016 Elsevier B.V.
dc.description.abstractThe advent of the so-called Big Data paradigm has motivated a flurry of research aimed at enhancing machine learning models by following very diverse approaches. In this context this work focuses on the automatic construction of features in supervised learning problems, which differs from the conventional selection of features in that new characteristics with enhanced predictive power are inferred from the original dataset. In particular this manuscript proposes a new iterative feature construction approach based on a self-learning meta-heuristic algorithm (Harmony Search) and a solution encoding strategy (correspondingly, Cartesian Genetic Programming) suited to represent combinations of features by means of constant-length solution vectors. The proposed feature construction algorithm, coined as Adaptive Cartesian Harmony Search (ACHS), incorporates modifications that allow exploiting the estimated predictive importance of intermediate solutions and, ultimately, attaining better convergence rate in its iterative learning procedure. The performance of the proposed ACHS scheme is assessed and compared to that rendered by the state of the art in a toy example and three practical use cases from the literature. The excellent performance figures obtained in these problems shed light on the widespread applicability of the proposed scheme to supervised learning with legacy datasets composed by already refined characteristics.en
dc.description.statusPeer reviewed
dc.format.extent11
dc.format.extent497627
dc.identifier.citationElola , A , Del Ser , J , Bilbao , M N , Perfecto , C , Alexandre , E & Salcedo-Sanz , S 2016 , ' Hybridizing Cartesian Genetic Programming and Harmony Search for adaptive feature construction in supervised learning problems ' , Applied Soft Computing , vol. 52 , pp. 760-770 . https://doi.org/10.1016/j.asoc.2016.09.049
dc.identifier.doi10.1016/j.asoc.2016.09.049
dc.identifier.issn1872-9681
dc.identifier.otherresearchoutputwizard: 11556/347
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=85005915329&partnerID=8YFLogxK
dc.language.isoeng
dc.relation.ispartofApplied Soft Computing
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subject.keywordsFeature construction
dc.subject.keywordsSupervised learning
dc.subject.keywordsCartesian Genetic Programming
dc.subject.keywordsHarmony Search
dc.subject.keywordsFeature construction
dc.subject.keywordsSupervised learning
dc.subject.keywordsCartesian Genetic Programming
dc.subject.keywordsHarmony Search
dc.subject.keywordsSoftware
dc.subject.keywordsFunding Info
dc.subject.keywordsThis work has been funded in part by the Basque Government under the ELKARTEK program (BID3A project, grant ref. KK-2015/0000080)
dc.subject.keywordsThis work has been funded in part by the Basque Government under the ELKARTEK program (BID3A project, grant ref. KK-2015/0000080)
dc.titleHybridizing Cartesian Genetic Programming and Harmony Search for adaptive feature construction in supervised learning problemsen
dc.typejournal article
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ASOC_aelola_vrevised_manuscript_28092016.pdf
Size:
485.96 KB
Format:
Adobe Portable Document Format
Description:
Main article
Download