Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/13225
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZawbaa, HM-
dc.contributor.authorEmary, E-
dc.contributor.authorGrosan, C-
dc.date.accessioned2016-09-23T15:34:11Z-
dc.date.available2016-03-10-
dc.date.available2016-09-23T15:34:11Z-
dc.date.issued2016-
dc.identifier.citationPLOS ONE,11 (3): pp. e0150652 - e0150652, (2016)en_US
dc.identifier.issn1932-6203-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/13225-
dc.description.abstractSelecting a subset of relevant properties from a large set of features that describe a dataset is a challenging machine learning task. In biology, for instance, the advances in the available technologies enable the generation of a very large number of biomarkers that describe the data. Choosing the more informative markers along with performing a high-accuracy classification over the data can be a daunting task, particularly if the data are high dimensional. An often adopted approach is to formulate the feature selection problem as a biobjective optimization problem, with the aim of maximizing the performance of the data analysis model (the quality of the data training fitting) while minimizing the number of features used.en_US
dc.description.sponsorshipThis work was partially supported by the IPROCOM Marie Curie initial training network, funded through the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme FP7/2007-2013/ under REA grants agreement No. 316555, and by the Romanian National Authority for Scientific Research, CNDIUEFISCDI, project number PN-II-PT-PCCA-2011-3.2- 0917. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.en_US
dc.format.extente0150652 - e0150652-
dc.language.isoenen_US
dc.publisherPLOSen_US
dc.titleFeature Selection via Chaotic Antlion Optimizationen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.1371/journal.pone.0150652-
dc.relation.isPartOfPLOS ONE-
pubs.issue3-
pubs.publication-statusPublished-
pubs.volume11-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf1.82 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.