Fetching the paper…
Reading the bibliography…
The number of component classifiers chosen for an ensemble greatly impacts the prediction ability.
M. Abramowitz and I. A. Stegun, Handbook of mathematical functions with formulas, graphs, and mathematical tables . Courier Corporation, 1964, vol. 55
1964
Earlier work this paper cites.
F. Can, “Incremental clustering for dynamic information processing,” ACM Transactions on Information Systems (TOIS) , vol. 11, no. 2, pp. 143–164, 1993
1993
Earlier work this paper cites.
K. Tumer and J. Ghosh, “Analysis of decision boundaries in linearly combined neural classifiers,” Pattern Recognition , vol. 29, no. 2, pp. 341–348, 1996
1996
Earlier work this paper cites.
K. Tumer and J. Ghosh, “Error correlation and error reduction in ensemble classifiers,” Connection Science , vol. 8, no. 3-4, pp. 385–404, 1996
1996
Earlier work this paper cites.
D. D. Margineantu and T. G. Dietterich, “Pruning adaptive boosting,” in International Conference on Machine Learning (ICML) , vol. 97, 1997, pp. 211–218
1997
Earlier work this paper cites.
L.-W. Chan, “Weighted least square ensemble networks,” in International Joint Conference on Neural Networks (IJCNN) , vol. 2. IEEE, 1999, pp. 1393–1396
1999
Earlier work this paper cites.
E. Bauer and R. Kohavi, “An empirical comparison of voting classification algorithms: Bagging, boosting, and variants,” Machine Learning , vol. 36, no. 1-2, pp. 105–139, 1999
1999
Earlier work this paper cites.
D. J. Miller and L. Yan, “Critic-driven ensemble classification,” IEEE Transactions on Signal Processing , vol. 47, no. 10, pp. 2833–2844, 1999
1999
Earlier work this paper cites.
T. G. Dietterich, “Ensemble methods in machine learning,” in Multiple Classifier Systems (MCS) . Springer, 2000, pp. 1–15
2000
Earlier work this paper cites.
P. M. Domingos and G. Hulten, “Mining high-speed data streams,” in Proc. of International Conference on Knowledge Discovery and Data Mining (SIGKDD) . ACM, 2000, pp. 71–80
2000
Earlier work this paper cites.
P. Latinne, O. Debeir, and C. Decaestecker, “Limiting the number of trees in random forests,” in Multiple Classifier Systems (MCS) . Springer, 2001, pp. 178–187
2001
Earlier work this paper cites.
X. Hu, “Using rough sets theory and database operations to construct a good ensemble of classifiers for data mining applications,” in Proc. of International Conference on Data Mining (ICDM) . IEEE, 2001, pp. 233–240
2001
Earlier work this paper cites.
N. C. Oza, “Online ensemble learning,” Ph.D. dissertation, Computer Science Division, Univ. California, Berkeley, CA, USA, 09 2001
2001
Earlier work this paper cites.
N. C. Oza and S. Russell, “Experimental comparisons of online and batch versions of bagging and boosting,” in Proc. of International Conference on Knowledge Discovery and Data Mining (SIGKDD) . ACM, 2001, pp. 359–364
2001
Earlier work this paper cites.
Z.-H. Zhou, J. Wu, and W. Tang, “Ensembling neural networks: Many could be better than all,” Artificial Intelligence , vol. 137, no. 1-2, pp. 239–263, 2002
2002
Earlier work this paper cites.
L. I. Kuncheva and C. J. Whitaker, “Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy,” Machine Learning , vol. 51, no. 2, pp. 181–207, 2003
2003
Earlier work this paper cites.
——, “Dynamic weighted majority: A new ensemble method for tracking concept drift,” in Proc. of International Conference on Data Mining (ICDM) . IEEE, 2003, pp. 123–130
2003
Earlier work this paper cites.
H. Wang, W. Fan, P. S. Yu, and J. Han, “Mining concept-drifting data streams using ensemble classifiers,” in Proc. of International Conference on Knowledge Discovery and Data Mining (SIGKDD) . ACM, 2003, pp. 226–235
2003
Cited alongside, same era.
L. I. Kuncheva, Combining pattern classifiers: Methods and algorithms . John Wiley & Sons, 2004
2004
Cited alongside, same era.
H. Liu, A. Mandvikar, and J. Mody, “An empirical study of building compact ensembles,” in Web-Age Information Management (WAIM) . Springer, 2004, pp. 622–627
2004
Cited alongside, same era.
R. Rifkin and A. Klautau, “In defense of one-vs-all classification,” Journal of Machine Learning Research (JMLR) , vol. 5, pp. 101–141, 2004
2004
Cited alongside, same era.
G. Brown, J. Wyatt, R. Harris, and X. Yao, “Diversity creation methods: A survey and categorisation,” Information Fusion , vol. 6, no. 1, pp. 5–20, 2005
R. Elwell and R. Polikar, “Incremental learning of concept drift in nonstationary environments,” IEEE Transactions on Neural Networks and Learning Systems (TNNLS) , vol. 22, no. 10, pp. 1517–1531, 2011
2011
Later among the works it cites.
T. M. Oshiro, P. S. Perez, and J. A. Baranauskas, “How many trees in a random forest?” in Machine Learning and Data Mining in Pattern Recognition (MLDM) . Springer, 2012, pp. 154–168
2012
Later among the works it cites.
C. Toraman and F. Can, “Squeezing the ensemble pruning: Faster and more accurate categorization for news portals,” in European Conference on Information Retrieval (ECIR) . Springer, 2012, pp. 508–511
2012
Later among the works it cites.
D. Hernández-Lobato, G. Martínez-Muñoz, and A. Suárez, “How large should ensembles of classifiers be?” Pattern Recognition , vol. 46, no. 5, pp. 1323–1336, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
G. Fumera and F. Roli, “A theoretical and experimental analysis of linear combiners for multiple classifier systems,” IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) , vol. 27, no. 6, pp. 942–956, 2005
2005
Cited alongside, same era.
J. Z. Kolter and M. A. Maloof, “Dynamic weighted majority: An ensemble method for drifting concepts,” Journal of Machine Learning Research (JMLR) , vol. 8, pp. 2755–2790, 2007
2007
Cited alongside, same era.
G. Tsoumakas, I. Partalas, and I. Vlahavas, “A taxonomy and short review of ensemble selection,” in Supervised and Unsupervised Ensemble Methods and Their Applications , 2008, pp. 41–46
2008
Cited alongside, same era.
G. Fumera, F. Roli, and A. Serrau, “A theoretical analysis of bagging as a linear combination of classifiers,” IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI) , vol. 30, no. 7, pp. 1293–1299, 2008
2008
Cited alongside, same era.
A. Ulaş, M. Semerci, O. T. Yıldız, and E. Alpaydın, “Incremental construction of classifier and discriminant ensembles,” Information Sciences , vol. 179, no. 9, pp. 1298–1318, 2009
2009
Cited alongside, same era.
L. Rokach, “Collective-agreement-based pruning of ensembles,” Computational Statistics & Data Analysis , vol. 53, no. 4, pp. 1015–1026, 2009
2009
Cited alongside, same era.
A. Bifet, G. Holmes, B. Pfahringer, R. Kirkby, and R. Gavaldà, “New ensemble methods for evolving data streams,” in Proc. of International Conference on Knowledge Discovery and Data Mining (SIGKDD) , 2009, pp. 139–148
2009
Cited alongside, same era.
P. C. Hansen, V. Pereyra, and G. Scherer, Least squares data fitting with applications . Johns Hopkins University Press, 2013
2013
Later among the works it cites.
T. Windeatt and C. Zor, “Ensemble pruning using spectral coefficients,” IEEE Transactions on Neural Networks and Learning Systems (TNNLS) , vol. 24, no. 4, pp. 673–678, 2013
2013
Later among the works it cites.
J. B. Gomes, M. M. Gaber, P. A. Sousa, and E. Menasalvas, “Mining recurring concepts in a dynamic feature space,” IEEE Transactions on Neural Networks and Learning Systems (TNNLS) , vol. 25, no. 1, pp. 95–110, 2014
2014
Later among the works it cites.
S. Wang, L. L. Minku, and X. Yao, “Resampling-based ensemble methods for online class imbalance learning,” IEEE Transactions on Knowledge and Data Engineering (TKDE) , vol. 27, no. 5, pp. 1356–1368, 2015
2015
Later among the works it cites.
S. Wu and F. Crestani, “A geometric framework for data fusion in information retrieval,” Information Systems , vol. 50, pp. 20–35, 2015
2015
Later among the works it cites.
L. Pietruczuk, L. Rutkowski, M. Jaworski, and P. Duda, “A method for automatic adjustment of ensemble size in stream data mining,” in International Joint Conference on Neural Networks (IJCNN) . IEEE, 2016, pp. 9–15
2016
Later among the works it cites.
B. Krawczyk, L. L. Minku, J. Gama, J. Stefanowski, and M. Woźniak, “Ensemble learning for data stream analysis: A survey,” Information Fusion , vol. 37, pp. 132–156, 2017
2017
Closest in time.
H. M. Gomes, J. P. Barddal, F. Enembreck, and A. Bifet, “A survey on ensemble learning for data stream classification,” ACM Computing Surveys , vol. 50, no. 2, pp. 23:1–23:36, Mar. 2017
2017
Closest in time.
——, “How to adjust an ensemble size in stream data mining?” Information Sciences , vol. 381, pp. 46–54, 2017
2017
Closest in time.
K. Jackowski, “New diversity measure for data stream classification ensembles,” Engineering Applications of Artificial Intelligence , vol. 74, pp. 23–34, 2018
2018
Closest in time.
H. Bonab and F. Can, “GOOWE: Geometrically optimum and online-weighted ensemble classifier for evolving data streams,” ACM Transactions on Knowledge Discovery from Data (TKDD) , vol. 12, no. 2, pp. 25:1–25:33, Mar. 2018
2018
Closest in time.
H. Bonab and F. Can, “A theoretical framework on the ideal number of classifiers for online ensembles in data streams,” in Proc. of Conference on Information and Knowledge Management (CIKM) . ACM, 2016, pp. 2053–2056
2056
Closest in time.