2018
DOI: 10.1109/access.2018.2818682
|View full text |Cite
|
Sign up to set email alerts
|

A Hybrid Genetic Algorithm With Wrapper-Embedded Approaches for Feature Selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
75
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 112 publications
(76 citation statements)
references
References 74 publications
1
75
0
Order By: Relevance
“…Compared with this study, the cost-effective GA method is very unstable in response time for each query. The main reason is that GA is a random search process and the number of generations it performs is not fixed [120]. This means that users are less likely to predict when search results will be generated.…”
Section: ) Discussion On the Difference Between This Study And The Cmentioning
confidence: 99%
“…Compared with this study, the cost-effective GA method is very unstable in response time for each query. The main reason is that GA is a random search process and the number of generations it performs is not fixed [120]. This means that users are less likely to predict when search results will be generated.…”
Section: ) Discussion On the Difference Between This Study And The Cmentioning
confidence: 99%
“…FS methods aim to identify and choose a subset of features to describe the data concept effectively. Simultaneously, FS can reduce the effects of noise and unrelated attributes to yield a good prediction of data class [21], [32], [33]. Traffic identification can greatly benefit in terms of accuracy and other performance metrics by utilizing the most significant features [34].…”
Section: B the Use Of Feature Selectionmentioning
confidence: 99%
“…Figure 4 presents the wrapper descriptor selection principle which works by generating candidate subsets from all available descriptors and then evaluating each subset with a classification algorithm. Several strategies for generating subsets can be listed, each with their own advantages and disadvantages, including exhaustive search (brute force [26], branch and bound [27]), heuristic (hill climbing, best first search) and meta-heuristic (genetic algorithm and particle swarm) [28] [29]. Compared to the other methods, the exhaustive search method guarantees that the best subset of features will be found.…”
Section: B Wrapper Descriptor Selectionmentioning
confidence: 99%