2018
DOI: 10.1007/978-3-319-75417-8_54
|View full text |Cite
|
Sign up to set email alerts
|

An Ensemble System with Random Projection and Dynamic Ensemble Selection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
1
1

Relationship

3
2

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 23 publications
0
7
0
Order By: Relevance
“…For the ensemble pruning methods, we selected two high-performance [7] as the benchmark algorithms. The number of nearest neighbors in these dynamic methods was set to 7 [3]. For all methods, we performed the same experimental procedure i.e.…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…For the ensemble pruning methods, we selected two high-performance [7] as the benchmark algorithms. The number of nearest neighbors in these dynamic methods was set to 7 [3]. For all methods, we performed the same experimental procedure i.e.…”
Section: Methodsmentioning
confidence: 99%
“…On the other hand, in the dynamic approach, a classifier or an EoC is selected to classify each test sample based on the competence level of the classifiers computed according to some criteria on a local region of the feature space [3].…”
Section: Background and Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…In detail, the Binary Relevance (BR) method learns on each chunk to obtain the ensemble of classifiers, and these classifiers" outputs are concatenated to the original feature space as the metadata which is learned by a second BR. For each test sample, the weights for the classifiers are determined via the dynamic classifier ensemble approach [35] i.e. based on the performance of the classifiers on the test sample"s neighbors in the latest chunk.…”
Section: Multi-label Classification For Data Streammentioning
confidence: 99%