Feature selection using genetics-based algorithm and its application to speaker identification

Demirekler, Mübeccel; Haydar, Ali

doi:10.1109/icassp.1999.758129

Cited by 13 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, Section IV discusses the research on EC based filter approaches for feature selection. The applications of EC for feature selection are described in Section V. [37], [58], [38], [39], [44], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [71], [72], [73], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87] [88], [89], [90], [91], [92], [93], [94], [95], [96], [97] Filter [75], [98], [99], [100], [101], [102] [102],…”

Section: B Detailed Coverage Of This Papermentioning

confidence: 99%

“…Many different new enhancements to GAs have been proposed to improve the performance, which focus mainly on the search mechanisms, the representation, and the fitness function. Some early works [59], [62] introduced GAs to feature selection by investigating the influence of the population size, mutation, crossover, and reproduction operators, but with limited experiments.…”

Section: A Gas For Feature Selectionmentioning

confidence: 99%

See 1 more Smart Citation

A Survey on Evolutionary Computation Approaches to Feature Selection

Xue

Zhang

Browne

et al. 2016

IEEE Trans. Evol. Computat.

1,435

635

View full text Add to dashboard Cite

Link to publication on Research at Birmingham portal General rights Unless a licence is specified above, all rights (including copyright and moral rights) in this document are retained by the authors and/or the copyright holders. The express permission of the copyright holder must be obtained for any use of this material other than for purposes permitted by law. • Users may freely distribute the URL that is used to identify this publication. • Users may download and/or print one copy of the publication from the University of Birmingham research portal for the purpose of private study or non-commercial research. • User may use extracts from the document in line with the concept of 'fair dealing' under the Copyright, Designs and Patents Act 1988 (?) • Users may not further distribute the material nor use it for the purposes of commercial gain. Where a licence is displayed above, please note the terms and conditions of the licence govern your use of this document. When citing, please reference the published version. Take down policy While the University of Birmingham exercises care and attention in making items available there are rare occasions when an item has been uploaded in error or has been deemed to be commercially or otherwise sensitive.

show abstract

Section: B Detailed Coverage Of This Papermentioning

confidence: 99%

Section: A Gas For Feature Selectionmentioning

confidence: 99%

A Survey on Evolutionary Computation Approaches to Feature Selection

Xue

Zhang

Browne

et al. 2016

IEEE Trans. Evol. Computat.

1,435

635

View full text Add to dashboard Cite

show abstract

“…The forerunner is Siedlecki and Sklansky who prove that genetic algorithm (GA) is a powerful tool for feature selection when the dimensionality of the given feature set is greater than 20 (Siedlecki and Sklansky 1993). After that, to further improve the performance of GA for feature selection, many different improvements have been proposed in search mechanisms (Demirekler and Haydar 1999;Jeong et al 2015;Wang et al 2020) and fitness function (Canuto and Nascimento 2012;Sousa et al 2013). A feature selection method (Derrac et al 2009) based on GA utilizes the cooperative coevolution (CC) framework (Potter and Jong 2000) but is not investigated in the large datasets.…”

Section: Related Workmentioning

confidence: 99%

A self-adaptive level-based learning artificial bee colony algorithm for feature selection on high-dimensional classification

et al. 2022

View full text Add to dashboard Cite

Feature selection is an important data preprocessing method in data mining and machine learning, yet it faces the challenge of "curse of dimensionality" when dealing with high-dimensional data. In this paper, a self-adaptive level-based learning artificial bee colony (SLLABC) algorithm is proposed for high-dimensional feature selection problem. The SLLABC algorithm includes three new mechanisms: (1) A novel level-based learning mechanism is introduced to accelerate the convergence of the basic artificial bee colony algorithm, which divides the population into several levels and the individuals on each level learn from the individuals on higher levels, especially, the individuals on the highest level learn from each other. (2) A self-adaptive method is proposed to keep the balance between exploration and exploitation abilities, which takes the diversity of population into account to determine the number of levels. The lower the diversity is, the fewer the levels are divided. (3) A new update mechanism is proposed to reduce the number of selected features. In this mechanism, if the error rate of an offspring is higher than or is equal to that of its parent but selects more features, then the offspring is discarded and the parent is retained, otherwise, the offspring replaces its parent. Further, we discuss and analyze the contribution of these novelties to the diversity of population and the performance of classification. Finally, the results, compared with 8 state-of-the-art algorithms on 12 high-dimensional datasets, confirm the competitive performance of the proposed SLLABC on both classification accuracy and the size of the feature subset.

show abstract