2019
DOI: 10.1007/978-3-030-13709-0_6
|View full text |Cite
|
Sign up to set email alerts
|

Covering Arrays to Support the Process of Feature Selection in the Random Forest Classifier

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…CAs generally can be seen as a sampling mechanism in several contexts [56][57][58][59][60]. In this paper, we use CAs to sample solutions of multiple linear Diophantine equations with unit coefficients, where each row of the CA is used to construct a solution of an LDEU.…”
Section: Covering Arraysmentioning
confidence: 99%
“…CAs generally can be seen as a sampling mechanism in several contexts [56][57][58][59][60]. In this paper, we use CAs to sample solutions of multiple linear Diophantine equations with unit coefficients, where each row of the CA is used to construct a solution of an LDEU.…”
Section: Covering Arraysmentioning
confidence: 99%
“…The tests with tweets showed the potential of the proposed method to reduce the indexes used in polarity detection. Vivas et al [45] based on a strategy that uses CAs, modified the process of selecting features for training trees in Random Forest (RF). They proposed using the rows of CAs as a feature selector instead of the random selector used by the random forest algorithm by default.…”
Section: Related Work a Wrappers For Feature Selectionmentioning
confidence: 99%