Proceedings of the 31st Annual ACM Symposium on Applied Computing 2016
DOI: 10.1145/2851613.2851655
|View full text |Cite
|
Sign up to set email alerts
|

Fast adaptive stacking of ensembles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0
3

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 33 publications
(21 citation statements)
references
References 21 publications
0
13
0
3
Order By: Relevance
“…By reducing the ADOB's requirement condition of allowing base classifiers to vote and changing the concept drift detection method internally used, BOLE can cope with different types and amounts of concept drift more effectively. Frias-Blanco et al [19] proposed the Fast Adaptive Stacking of Ensembles (FASE), which constructs metainstance M = (ĉ 1 ,ĉ 2 , . .…”
Section: A Data Stream Classification Ensemble Learningmentioning
confidence: 99%
See 3 more Smart Citations
“…By reducing the ADOB's requirement condition of allowing base classifiers to vote and changing the concept drift detection method internally used, BOLE can cope with different types and amounts of concept drift more effectively. Frias-Blanco et al [19] proposed the Fast Adaptive Stacking of Ensembles (FASE), which constructs metainstance M = (ĉ 1 ,ĉ 2 , . .…”
Section: A Data Stream Classification Ensemble Learningmentioning
confidence: 99%
“…end if [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27], and call the process DealInstance to learn the data of the circular array A in turn and cache the new instances (line [11][12][13][14]. Whenever array A is filled again by new instances, CreateNewBaseClassifier is called After the reading of the data stream is finished, the array still contains I instances that need to be predicted and learned, so DealInstance is called to process them (line 28-31).…”
Section: B Ensemble Process Of Online Active Learningmentioning
confidence: 99%
See 2 more Smart Citations
“…Se utilizaron 10 clasificadores base en todos los algoritmos. Como clasificador base se eligió Naive Bayes por ser uno de los algoritmos más exitosos para aprender de los flujos de datos [22,7,14], además tiene un costo computacional bajo y una semántica clara.…”
Section: Configuración De Los Experimentosunclassified