2012
DOI: 10.1016/j.knosys.2011.01.015
|View full text |Cite
|
Sign up to set email alerts
|

Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
59
0
1

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 143 publications
(60 citation statements)
references
References 23 publications
0
59
0
1
Order By: Relevance
“…For feature selection, we used the correlation-based feature selector (CFS) with different search algorithms: re-ranking search algorithm [13], best first search algorithm, particle swarm optimization (PSO) search algorithm [14,15], and tabu search algorithm [16,17]. We also used the ranker search method with different attribute evaluators: Pearson's correlation, chi-squared distribution, information gain, and gain ratio.…”
Section: Feature Selection and Classification Methodsmentioning
confidence: 99%
“…For feature selection, we used the correlation-based feature selector (CFS) with different search algorithms: re-ranking search algorithm [13], best first search algorithm, particle swarm optimization (PSO) search algorithm [14,15], and tabu search algorithm [16,17]. We also used the ranker search method with different attribute evaluators: Pearson's correlation, chi-squared distribution, information gain, and gain ratio.…”
Section: Feature Selection and Classification Methodsmentioning
confidence: 99%
“…It becomes important to the success of the tasks that apply machine learning approach especially when the data have many irrelevant or redundant features. In general, the features selection algorithms can be categorized as wrapper approach and filter approach [34] [1].…”
Section: Feature Rankingmentioning
confidence: 99%
“…Such a division is similar to those approaches in feature selection. Previous studies have validated that ranking-based feature ordering approaches are better than the contribution-based ones usually at least in two different aspects: time [8] and error rate [9]. Different from feature selection, which attempts to search a feature subset or reduce feature weights for the optimal results, feature ordering aims to sort features for IAL purpose by some criteria.…”
Section: Feature Ordering In Ialmentioning
confidence: 99%