Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/23607
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNeumann, Geoffreyen_UK
dc.contributor.authorCairns, Daviden_UK
dc.contributor.editorMadani, Ken_UK
dc.contributor.editorDourado, Aen_UK
dc.contributor.editorRosa, Aen_UK
dc.contributor.editorFilipe, Jen_UK
dc.contributor.editorKacprzyk, Jen_UK
dc.date.accessioned2016-12-15T04:09:19Z-
dc.date.available2016-12-15T04:09:19Zen_UK
dc.date.issued2016en_UK
dc.identifier.urihttp://hdl.handle.net/1893/23607-
dc.description.abstractThe Targeted Estimation of Distribution Algorithm (TEDA) introduces into an EDA/GA hybrid framework a ‘Targeting’ process, whereby the number of active genes, or ‘control points’, in a solution is driven in an optimal direction. For larger feature selection problems with over a thousand features, traditional methods such as forward and backward selection are inefficient. Traditional EAs may perform better but are slow to optimize if a problem is sufficiently noisy that most large solutions are equally ineffective and it is only when much smaller solutions are discovered that effective optimization may begin. By using targeting, TEDA is able to drive down the feature set size quickly and so speeds up this process. This approach was tested on feature selection problems with between 500 and 20,000 features using all of these approaches and it was confirmed that TEDA finds effective solutions significantly faster than the other approaches.en_UK
dc.language.isoenen_UK
dc.publisherSpringeren_UK
dc.relationNeumann G & Cairns D (2016) A Targeted Estimation of Distribution Algorithm Compared to Traditional Methods in Feature Selection. In: Madani K, Dourado A, Rosa A, Filipe J & Kacprzyk J (eds.) Computational Intelligence: Revised and Selected Papers of the International Joint Conference, IJCCI 2013, Vilamoura, Portugal, September 20-22, 2013. Studies in Computational Intelligence, 613. 5th International Joint Conference on Computational Intellegience, IJCCI 2013, Vilamoura, Portugal, 20.09.2013-22.09.2013. Cham, Switzerland: Springer, pp. 83-103. http://link.springer.com/chapter/10.1007/978-3-319-23392-5_5; https://doi.org/10.1007/978-3-319-23392-5_5en_UK
dc.relation.ispartofseriesStudies in Computational Intelligence, 613en_UK
dc.relation.urihttp://www.ijcci.org/?y=2013en_UK
dc.rightsThe publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.en_UK
dc.rights.urihttp://www.rioxx.net/licenses/under-embargo-all-rights-reserveden_UK
dc.subjectEstimation of distribution algorithmsen_UK
dc.subjectFeature selectionen_UK
dc.subjectEvolutionary computationen_UK
dc.subjectGenetic algorithmsen_UK
dc.subjectHybrid algorithmsen_UK
dc.titleA Targeted Estimation of Distribution Algorithm Compared to Traditional Methods in Feature Selectionen_UK
dc.typeConference Paperen_UK
dc.rights.embargodate2997-08-31en_UK
dc.rights.embargoreason[B-2015-CompInt-TEDA-Feature.pdf] The publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.en_UK
dc.identifier.doi10.1007/978-3-319-23392-5_5en_UK
dc.citation.issn1860-949Xen_UK
dc.citation.spage83en_UK
dc.citation.epage103en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.identifier.urlhttp://link.springer.com/chapter/10.1007/978-3-319-23392-5_5en_UK
dc.author.emaildec@cs.stir.ac.uken_UK
dc.citation.btitleComputational Intelligence: Revised and Selected Papers of the International Joint Conference, IJCCI 2013, Vilamoura, Portugal, September 20-22, 2013en_UK
dc.citation.conferencedates2013-09-20 - 2013-09-22en_UK
dc.citation.conferencelocationVilamoura, Portugalen_UK
dc.citation.conferencename5th International Joint Conference on Computational Intellegience, IJCCI 2013en_UK
dc.citation.date30/09/2013en_UK
dc.citation.isbn978-3-319-23391-8en_UK
dc.citation.isbn978-3-319-23392-5en_UK
dc.publisher.addressCham, Switzerlanden_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.identifier.isiWOS:000377543600005en_UK
dc.identifier.scopusid2-s2.0-84947703516en_UK
dc.identifier.wtid561612en_UK
dc.contributor.orcid0000-0002-0246-3821en_UK
dcterms.dateAccepted2013-09-30en_UK
dc.date.filedepositdate2016-07-07en_UK
rioxxterms.typeConference Paper/Proceeding/Abstracten_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorNeumann, Geoffrey|en_UK
local.rioxx.authorCairns, David|0000-0002-0246-3821en_UK
local.rioxx.projectInternal Project|University of Stirling|https://isni.org/isni/0000000122484331en_UK
local.rioxx.contributorMadani, K|en_UK
local.rioxx.contributorDourado, A|en_UK
local.rioxx.contributorRosa, A|en_UK
local.rioxx.contributorFilipe, J|en_UK
local.rioxx.contributorKacprzyk, J|en_UK
local.rioxx.freetoreaddate2997-08-31en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||en_UK
local.rioxx.filenameB-2015-CompInt-TEDA-Feature.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source978-3-319-23392-5en_UK
Appears in Collections:Computing Science and Mathematics Book Chapters and Sections

Files in This Item:
File Description SizeFormat 
B-2015-CompInt-TEDA-Feature.pdfFulltext - Published Version683.79 kBAdobe PDFUnder Embargo until 2997-08-31    Request a copy


This item is protected by original copyright



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

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.