SwePub
Sök i LIBRIS databas

  Utökad sökning

onr:"swepub:oai:DiVA.org:hh-48909"
 

Sökning: onr:"swepub:oai:DiVA.org:hh-48909" > Fast Genetic Algori...

Fast Genetic Algorithm for feature selection — A qualitative approximation approach

Altarabichi, Mohammed Ghaith, 1981- (författare)
Högskolan i Halmstad,Akademin för informationsteknologi
Nowaczyk, Sławomir, 1978- (författare)
Högskolan i Halmstad,Akademin för informationsteknologi
Pashami, Sepideh, 1985- (författare)
Högskolan i Halmstad,Akademin för informationsteknologi
visa fler...
Sheikholharam Mashhadi, Peyman, 1982- (författare)
Högskolan i Halmstad,Akademin för informationsteknologi
visa färre...
 (creator_code:org_t)
Oxford : Elsevier, 2023
2023
Engelska.
Ingår i: Expert systems with applications. - Oxford : Elsevier. - 0957-4174 .- 1873-6793. ; 211
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Evolutionary Algorithms (EAs) are often challenging to apply in real-world settings since evolutionary computations involve a large number of evaluations of a typically expensive fitness function. For example, an evaluation could involve training a new machine learning model. An approximation (also known as meta-model or a surrogate) of the true function can be used in such applications to alleviate the computation cost. In this paper, we propose a two-stage surrogate-assisted evolutionary approach to address the computational issues arising from using Genetic Algorithm (GA) for feature selection in a wrapper setting for large datasets. We define “Approximation Usefulness” to capture the necessary conditions to ensure correctness of the EA computations when an approximation is used. Based on this definition, we propose a procedure to construct a lightweight qualitative meta-model by the active selection of data instances. We then use a meta-model to carry out the feature selection task. We apply this procedure to the GA-based algorithm CHC (Cross generational elitist selection, Heterogeneous recombination and Cataclysmic mutation) to create a Qualitative approXimations variant, CHCQX. We show that CHCQX converges faster to feature subset solutions of significantly higher accuracy (as compared to CHC), particularly for large datasets with over 100K instances. We also demonstrate the applicability of the thinking behind our approach more broadly to Swarm Intelligence (SI), another branch of the Evolutionary Computation (EC) paradigm with results of PSOQX, a qualitative approximation adaptation of the Particle Swarm Optimization (PSO) method. A GitHub repository with the complete implementation is available. © 2022 The Author(s)

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

Evolutionary computation
Feature selection
Fitness approximation
Genetic Algorithm
Meta-model
Optimization
Particle Swarm Intelligence

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy