Ensemble approaches for regression: A survey

ACM Computing Surveys

Volumn 45, Issue 1, 2012, Pages

  Mendes Moreira, João ^a   Soares, Carlos ^a   Jorge, Aĺipio Mário ^a   De Sousa, Jorge Freire ^a  

^a UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ENSEMBLE LEARNING; INTEGRATION PHASE; LEARNING PROBLEM; PREDICTION ACCURACY; REGRESSION PROBLEM; THREE PHASIS;

COMPUTER SCIENCE; SURVEYS;

REGRESSION ANALYSIS;

EID: 84871245760     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/2379776.2379786     Document Type: Review

References (162)

1. Aggarwal, N., Prakash, N., and Sofat, S. 2010. Content Management System Effort Estimation Using Bagging Predictors. in Proceedings of the International Joint Conference on Computer Information Systems Sciences and Engineering Technological Developments in Education and Automation, M. Iskander, V. Kapila, and M. Karim, Eds. 19-24.
2. Aha, D. W. and Bankert, R. L. 1996. A Comparative Evaluation of Sequential Feature Selection Algorithms. in Learning From Data, D. Fisher and H.-J. Lenz, Eds. Springer, Chapter 4, 199-206.
3. Aksela, M. 2003.Comparison of Classifier Selection Methods For Improving Committee Performance. in Proceedings of the International Workshop on Multiple Classifier Systems. Lecture Notes in Computer Science, Vol. 2709. Springer, 84-93.
4. Al-Ani, A. 2005. Feature Subset Selection Using Ant Colony Optimization. Int. J.Comput. Intell. 2, 1, 53-58.
5. Avnimelech, R. and Intrator, N. 1999. Boosting Regression Estimators. Neural Comput. 11, 499-520.
6. Azevedo, P. J. and Jorge, A. M. 2007. Iterative Reordering of Rules For Building Ensembles Without Relearning. in Proceedings of the International Conference on Discovery Science. Lecture Notes in Computer Science, Vol. 4755. Springer, 56-67.
7. Azevedo, P. J. and Jorge, A. M. 2010. Ensembles of Jittered Association Rule Classifiers. Data Min. Knowl. Discov. 21, 1, 91-129.
8. Bakker, B. and Heskes, T. 2003. Clustering Ensembles of Neural Network Models. Neural Netw. 16, 2, 261- 269.
9. Bentley, J. L. 1975. Multidimensional Binary Search Trees Used For Associative Searching.Comm. Acm 18, 9, 509-517.
10. Bezerra, G. B., Barra, T. V., Castro, L. N., and Von Zuben, F. J. 2005. Adaptive Radius Immune Algorithm For Data Clustering. in Proceedings of the International Conference on Artificial Immune Systems (Icaris'05). Lecture Notes in Computer Science, Vol. 3627. Springer, 290-303.
11. Bifet, A., Holmes, G., Pfahringer, B., Kirkby, R., and Gavald́A, R. 2009. New Ensemble Methods For Evolving Data Streams. in Proceedings of the Annual Acm Sigkdd Conference on Knowledge Discovery and Data Mining (Kdd'09). Acm, New York, 139-148.
12. Blockeel, H. and Vanschoren, J. 2007. Experiment Databases: Towards An Improved Experimental Methodology in Machine Learning. in Proceedings of the 11Th European Conference on Principles and Practice of Knowledge Discovery in Databases (Pkdd'07). Lecture Notes in Computer Science, Vol. 4702. Springer, 6-17.
13. Borra, S. and Ciaccio, A. D. 2002. Improving Nonparametric Regression Methods By Bagging and Boosting.Comput. Statist. Data Anal. 38, 4, 407-420.
14. Brazdil, P., Giraud-Carrier, C., Soares, C., and Vilalta, R. 2009. Metalearning: Applications To Data Mining. Springer.
15. Breiman, L. 1996A. Bagging Predictors. Mach. Learn. 26, 123-140.
16. Breiman, L. 1996B. Heuristics of Instability and Stabilization in Model Selection. Ann. Statist. 24, 6, 2350-2383.
17. Breiman, L. 1996C. Stacked Regressions. Mach. Learn. 24, 49-64.
18. Breiman, L. 2000. Randomizing Outputs To Increase Prediction Accuracy. Mach. Learn. 40, 3, 229-242.
19. Breiman, L. 2001A. Random Forests. Mach. Learn. 45, 5-32.
20. Breiman, L. 2001B. Using Iterated Bagging To Debias Regressions. Mach. Learn. 45, 3, 261-277.
21. Brown, G. 2004. Diversity in Neural Network Ensembles. Ph.D. thesis, University of Birmingham.
22. Brown, G., Wyatt, J. L., Harris, R., and Yao, X. 2005A. Diversity Creation Methods: A Survey and Categorisation. Inf. Fusion 6, 5-20.
23. Brown, G., Wyatt, J. L., and Tino, P. 2005B. Managing Diversity in Regression Ensembles. J. Mach. Learn. Res. 6, 1621-1650.
24. Buhlmann, P. 2010. Bagging, Boosting and Ensemble Methods. Springer.
25. Buja, A. and Stuetzle, W. 2006. Observations on Bagging. Statistica Sinica 16, 323-351.
26. Cai, T. and Wu, X. 2008. Research on Ensemble Learning Based on Discretization Method. in Proceedings of the 9Th International Conference on Signal Processing (Icsp'08). 1528-1531.
27. Caruana, R.,Niculescu-Mozil, A., Crew, G., and Ksikes, A. 2004. Ensemble Selection From Libraries of Models. in International Conference on Machine Learning.
28. Coelho, G. P. and Von Zuben, F. J. 2006. the Influence of the Pool of Candidates on the Performance of Selection and Combination Techniques in Ensembles. in Proceedings of the International Joint Conference on Neural Networks. 10588-10595.
29. Delve. 2002. Delve: Data For Evaluating Learning in Valid Experiments. http://www.Cs.Toronto.Edu/Delve/
30. Didaci. L. and Giacinto, G. 2004. Dynamic Classifier Selection By Adaptive K-Nearest Neighbourhood Rule. in Proceedings of the International Workshop on Multiple Classifier Systems, F. Roli, J. Kittler, and T. Windeatt, Eds. Lecture Notes in Computer Science, Vol. 3077. Springer, 174-183.
31. Dietterich, T. G. 1997. Machine-Learning Research: Four Current Directions. Ai Mag. 18, 4, 97-136.
32. Domeniconi, C. and Yan, B. 2004. Nearest Neighbor Ensemble. in Proceedings of the International Conference on Pattern Recognition. Vol. 1. 228-231.
33. Domingos, P. 1997. Why Does Bagging Work? A Bayesian Account and Its Implications. in Proceedings of the International Conference on Knowledge Discovery and Data Mining. Aaai Press, 155-158.
34. Drucker, H. 1997. Improving Regressors Using Boosting Techniques. in Proceedings of the 14Th International Conference on Machine Learning (Icml'97). Morgan Kaufmann Publishers, San Fransisco, Ca, 107-115.
35. Duffy, N. and Helmbold, D. 2002. Boosting Methods For Regression. Mach. Learn. 47, 153-200.
36. Ferrer, L., Sǒnmez, K., and Shriberg, E. 2009. An Anticorrelation Kernel For Subsystem Training in Multiple Classifier Systems. J. Mach. Learn. Res. 10, 2079-2114.
37. Flannagan, S. and Sperber, L. 2008. Datamob/Datasets. http://Datamob.Org/Datsetss
38. Frank, A. and Asuncion, A. 2010. Uci Machine Learning Repository. http://Archive.Ics.Uci.Edu/Mll
39. Frank, E. and Pfahringer, B. 2006. Improving on Bagging With Input Smearing. in Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 97-106.
40. Freund, Y. and Schapire, R. 1996. Experiments With A New Boosting Algorithm. in Proceedings of the International Conference on Machine Learning. 148-156.
41. Freund, Y. and Schapire, R. E. 1997. A Decision-theoretic Generalization of on-Line Learning and An Application To Boosting. J.Comput. Syst. Sci. 55, 119-139.
42. Friedman, J. H. 1991. Multivariate Adaptive Regression Splines. the Ann. Statist. 19, 1, 1-141.
43. Friedman, J. H. 1996. Local Learning Based on Recursive Covering. Tech. Rep.
44. Friedman, J. H. 2001. Greedy Function Approximation: A Gradient Boosting Machine. Ann. Statist. 29, 5, 1189-1232.
45. Friedman, J. H. 2002. Stochastic Gradient Boosting.Comput. Statist. Data Anal. 38, 4, 367-378.
46. Friedman, H. H. and Stuetzle, W. 1981. Projection Pursuit Regression. J. Amer. Statist. Regress. 76, 376, 817-823.
47. Garćia-Pedrajas, N., Herv́As-Mart́inez, C., and Ortiz-Boyer, D. 2005. Cooperative Coevolution of Artificial Neural Network Ensembles For Pattern Classification. Ieee Trans. Evolut.Comput. 9, 3, 271-302.
48. Geman, S., Bienenstock, E., and Doursat, R. 1992. Neural Networks and the Bias/Variance Dilemma. Neural Comput. 4, 1, 1-58.
49. Giacinto, G. and Roli, F. 1997. Adaptive Selection of Image Classifiers. in Proceedings of the International Conference on Image Analysis and Processing. Lecture Notes in Computer Science, Vol. 1310. Springer, 38-45.
50. Granitto, P., Verdes, P., and Ceccatto, H. 2005. Neural Network Ensembles: Evaluation of Aggregation Algorithms. Artif. Intell. 163, 2, 139-162.
51. Guvenir, H. A, and Uysal, I. 2000. Function Approximation Repository. http://Funapp.Cs.Bilkent.Edu. Tr/Datasets/
52. Hashem, S. 1993. Optimal Linear Combinations of Neural Networks. Ph.D. thesis, Purdue University.
53. Hastie, T. and Tibshirani, R. 1996. Discriminant Adaptive Nearest Neighbor Classification. Ieee Trans. Pattern Anal. Mach. Intell. 18, 6, 607-616.
54. Hastie, T., Tibshirani, R., and Friedman, J. H. 2001. the Elements of Statistical Learning: Data Mining, Inference, and Predictions. Springer Series in Statistics. Springer.
55. Herńandez-Lobato, D., Mart́inez-MuNoz, G., and SúArez, A. 2006. Pruning in Ordered Regression Bagging Ensembles. in Proceedings of the International Joint Conference on Neural Networks. 1266-1273.
56. Ho, T. K. 1998. the Random Subspace Method For Constructing Decision Forests. Ieee Trans. Pattern Anal. Mach. Intell. 20, 8, 832-844.
57. Islam, M. M., Yao, X., and Murase, K. 2003. A Constructive Algorithm For Training Cooperative Neural Network Ensembles. Ieee Trans. Neural Netw. 14, 4, 820-834.
58. Jain, A. and Zongker, D. 1997. Feature Selection: Evaluation, Application, and Small Sample Performance. Ieee Trans. Pattern Anal. Mach. Intell. 19, 2, 153-158.
59. Jorge, A. M. and Azevedo, P. J. 2005. An Experiment With Association Rules and Classification: Post-Bagging and Conviction. in Discovery Science. Lecture Notes in Computer Science, Vol. 3735. Springer, 137-149.
60. Kim, H.-C., Pang, S., Je, H.-M., Kim, D., and Bang, S.-Y. 2003. Constructing Support Vector Machine Ensemble. Pattern Recogn. 36, 12, 2757-2767.
61. Kivinen, J. and Warmuth, M. K. 1997. Exponentiated Gradient Versus Gradient Descent For Linear Predictors. Inf.Comput. 132, 1, 1-63.
62. Ko, A. H.-R., Sabourin, R., and Britto Jr., A. D. S. 2008. From Dynamic Classifier Selection To Dynamic Ensemble Selection. Pattern Recogn. 41, 1718-1731.
63. Kolen, J. F. and Pollack, J. B. 1990. Back Propagation Is Sensitive To Initial Conditions. Tech. Rep. Tr-90-Jk-Bpsic, the Ohio State University.
64. Kolter, J. Z. andmaloof, M. A. 2007. Dynamic Weighted Majority: An Ensemble Method For Drifting Concepts. J. Mach. Learn. Res. 8, 2755-2790.
65. Kotsiantis, S. and Pintelas, P. 2005. Selective Averaging of Regression Models. Ann. Math.Comput. Teleinf. 1, 3, 65-74.
66. Krogh, A. and Vedelsby, J. 1995. Neural Network Ensembles, Cross Validation, and Active Learning. Adv. Neural Inf. Process. Syst. 7, 231-238.
67. Kuncheva, L. I. 2002. Switching Between Selection and Fusion in Combining Classifiers: An Experiment. Ieee Trans. Syst. Man Cybernet. B32, 2, 146-156.
68. Kuncheva, L. I. 2004.Combining Pattern Classifiers. Wiley.
69. Lasota, T., Telec, Z., Trawinski, B., and Trawinsky, K. 2009. A Multi-Agent System To Assist With Real Estate Appraisals Using Bagging Ensembles. in Computational Collective Intelligence: Semantic Web, Social Networks and Multiagent Systems, N. Nguyen, R. Kowalczyk, and S. Chen, Eds. Lecture Notes in Artificial Intelligence, Vol. 5796. Springer, 813-824.
70. Lazarevic, A. 2001. Effective Pruning of Neural Network Classifier Ensembles. in Proceedings of the International Joint Conference on Neural Networks. 796-801.
71. Leblanc, M. and Tibshirani, R. 1996.Combining Estimates in Regression and Classification. J. Amer. Statist. Assoc. 91, 1641-1650.
72. Lehmann, E. 1998. theory of Point Estimation. Springer.
73. Lin, H.-T. and Li, L. 2005. Infinite Ensemble Learning With Support Vector Machines. in Proceedings of the European Conference on Machine Learning. Lecture Notes in Artificial Intelligence, Vol. 3720. Springer, 242-254.
74. Liu, Y. and Yao, X. 1999. Ensemble Learning Via Negative Correlation. Neural Netw. 12, 1399-1404.
75. Liu, Y., Yao, X., and Higuchi, T. 2000. Evolutionary Ensembles With Negative Correlation Learning. Ieee Trans. Evolut.Comput. 4, 4, 380-387.
76. Loughrey, J. and Cunningham, P. 2005. Using Early Stopping To Reduce Overfitting in Wrapper-Based Feature Weighting. Tech. Rep. Tcd-Cs-2005-41, Trinity College Dublin, Computer Science Department.
77. Margineantu, D. D. and Dietterich, T. G. 1997. Pruning Adaptive Boosting. in Proceedings of the International Conference on Machine Learning. 211-218.
78. Martinez-Munoz, G., Hernandez-Lobato, D., and Suarez, A. 2009. An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation. Ieee Trans. Pattern Anal. Mach. Intell. 31, 245-259.
79. Martinez-Munoz, G. and Suarez, A. 2006. Pruning in Ordered Bagging Ensembles. in Proceedings of the International Conference on Machine Learning. 609-616.
80. Martinez-Munoz, G. and Suarez, A. 2007. Using Boosting To Prune Bagging Ensembles. Pattern Recogn. Lett. 28, 1, 156-165.
81. Matignon, R. 2007. Data Mining Using Sas Enterprise Miner. Wiley.
82. Mendes-Moreira, J. 2008. Travel Time Prediction For the Planning of Mass Transit Companies: A Machine Learning Approach. Ph.D. thesis, Faculty of Engineering, University of Porto.
83. Mendes-Moreira, J., Jorge, A. M., Freire De Sousa, J., and Soares, C. 2012.Comparing State-of-the-Art Regression Methods For Long Term Travel Time Prediction. Intell. Data Anal. 16, 3.
84. Mendes-Moreira, J., Jorge, A. M., Soares, C., and Freire De Sousa, J. 2009. Ensemble Learning: A Study on Different Variants of the Dynamic Selection Approach. in Proceedings of the 6th International Conference on Machine Learning and Data Mining, P. Perner, Ed. Lecture Notes in Computer Science, Vol. 5632. Springer, 191-205.
85. Meng, G., Pan, C., Zheng, N." and Sun, C. 2010. Skew Estimation of Document Images Using Bagging. Ieee Trans. Image Process. 19, 7, 1837-1846.
86. Merz, C. J. 1996. Dynamical Selection of Learning Algorithms. in Proceedings of the International Workshop on Artificial Intelligence and Statistics, D. Fisher and H.-J. Lenz, Eds. Springer.
87. Merz, C. J. 1998. Classification and Regression By Combining Models. Ph.D. thesis, University of California Irvine.
88. Merz, C. J. and Pazzani, M. J. 1999. A Principal Components Approach To Combining Regression Estimates. Mach. Learn. 36, 9-32.
89. Meyer, D., Leisch, F., and Hornik, K. 2003. the Support Vector Machine Under Test. Neurocomput. 55, 1-2, 169-186.
90. Mlg, U. D. 2011. http://Mlg.Ucd.Ie/
91. Molina, L. C., Belanche, L., and Nebot, A. 2002. Feature Selection Algorithms: A Survey and Experimental Evaluation. in Proceedings of the Ieee International Conference on Data Mining. 306-313.
92. Monti, S., Tamayo, P., Mesirov, J., and Golub, T. 2003. Consensus Clustering: A Resampling-Based Method For Class Discovery and Visualization of Gene Expression Microarray Data. Mach. Learn., 91- 118.
93. Moreira, J. M., Sousa, J. F., Jorge, A. M., and Soares, C. 2006. An Ensemble Regression Approach For Bus Trip Time Prediction. in Proceedings of the Meeting of the Euro Working Group on Transportation. 317-321. http://www.Liaad.Up.Pt/Amjorge/Docs/Triana/Moreira06B.Pdf.
94. Oh, I.-S., Lee, J.-S., and Moon, B.-R. 2004. Hybrid Genetic Algorithms For Feature Selection. Ieee Trans. Pattern Anal. Mach. Intell. 26, 11, 1424-1437.
95. Opitz, D. W. 1999. Feature Selection For Ensembles. in Proceedings of the National Conference on Artificial Intelligence. Aaai Press, 379-384.
96. Opitz, D. W. and Shavlik, J. W. 1996. Generating Accurate and Diverse Members of A Neural-Network Ensemble. Adv. Neural Inf. Process. Syst. 8, 535-541.
97. Ortiz-Boyer, D., Hervas-Martinez, C., and Garcia-Pendrajas, N. 2005. Cixl2: A Crossover Operator For Evolutionary Algorithms Based on Population Features. J. Artif. Intell. Res. 24, 1-48.
98. Parmanto, B., Munro, P, W., and Doyle, H. R. 1996. Reducing Variance of Committee Prediction With Resampling Techniques. Connect. Sci. 8, 3-4, 405-425.
99. Partridge, D. and Yates, W. B. 1996. Engineering Multiversion Neural-Net Systems. Neural Comput. 8, 4, 869-893.
100. Perrone, M. P. and Cooper, L. N. 1993. When Networks Disagree: Ensemble Methods For Hybrid Neural Networks. in Neural Networks For Speech and Image Processing, R. Mammone, Ed. Chapman-Hall.
101. Polikar, R. 2009. Ensemble Learning. Scholarpedia 4, 1, 2776.
102. Pudil, P., Ferri, F., Novovicova, J., and Kittler, J. 1994. Floating Search Methods For Feature Selection With Nonmonotonic Criterion Functions. in Proceedings of the Ieee International Conference on Pattern Recognition. Vol. 11. 279-283.
103. Puuronen, S., Terziyan, V., and Tsymbal, A. 1999. A Dynamic Integration Algorithm For An Ensemble of Classifiers. in Proceedings of the International Symposium on Methodologies For Intelligent Systems. Lecture Notes in Computer Science, Vol. 1609. Springer, 592-600.
104. Ranawana, R. and Palade, V. 2006. Multi-Classifier Systems: Review and A Roadmap For Developers. Int. J. Hybrid Intell. Syst. 3, 1, 35-61.
105. Ratsch, G.,Demiriz, A., and Bennett, K. P. 2002. Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces. Mach. Learn. 48, 189-218.
106. Raviv, Y. and Intrator, N. 1996. Bootstrapping With Noise: An Effective Regularization Technique. Connect. Sci. 8, 3-4, 355-372.
107. Robnik-Sikonja, M. 2004. Improving Random Forests. in Proceedings of the European Conference on Machine Learning. Lecture Notes in Artificial Intelligence, Vol. 3201. Springer, 359-370.
108. Robnik-Sikonja, M. and Kononenko, I. 2003. theoretical and Empirical Analysis of Relieff and Rrelieff. Mach. Learn. 53, 1-2, 23-69.
109. Rodriguez, J. J., Kuncheva, L. I., and Alonso, C. J. 2006. Rotation Forest: A New Classifier Ensemble. Ieee Trans. Pattern Anal. Mach. Intell. 28, 10, 1619-1630.
110. Rokach, L. 2009A. Collective-Agreement-Based Pruning of Ensembles.Comput. Statist. Data Anal. 53, 1015-1026.
111. Rokach, L. 2009B. Pattern Classification Using Ensemble Methods. World Scientific.
112. Rokach, L. 2009C. Taxonomy For Characterizing Ensemble Methods in Classification Tasks: A Review and Annotated Bibliography.Comput. Statist. Data Anal. 53, 12, 4046-4072.
113. Rokach, L. 2010. Ensemble-Based Classifiers. Artif. Intell. Rev. 33, 1-39.
114. Roli, F., Giacinto, G" and Vernazza, G. 2001. Methods For Designing Multiple Classifier Systems. in Proceedings of the International Workshop on Multiple Classifier Systems. Lecture Notes in Computer Science, Vol. 2096. Springer, 78-87.
115. Rooney, N. and Patterson, D. 2007. A Weighted Combination of Stacking and Dynamic Integration. Pattern Recogn. 40, 4, 1385-1388.
116. Rooney, N., Patterson, D., Anand, S., and Tsymbal, A. 2004. Dynamic Integration of Regression Models. in Proceedings of the International Workshop on Multiple Classifier Systems. Lecture Notes in Computer Science, Vol. 3181. Springer, 164-173.
117. Rosen, B. E. 1996. Ensemble Learning Using Decorrelated Neural Networks. Connect. Sci. 8, 3-4, 373-383.
118. Ruta, D. and Gabrys, B. 2001. Application of the Evolutionary Algorithms For Classifier Selection in Multiple Classifier Systems With Majority Voting. in Proceedings of the International Workshop on Multiple Classifier Systems. Lecture Notes in Computer Science, Vol. 2096. Springer, 399-408.
119. Schapire, R. 1990. the Strength of Weak Learnability. Mach. Learn. 5, 2, 197-227.
120. Schclar, A. and Rokach, L. 2009. Random Projection Ensemble Classifiers. in Proceedings of the International Conference on Enterprise Information Systems (Iceis'09). Springer.
121. Schclar, A., Tsinkinovsky, A., Rokach, L., Meisels, A., and Antwarg, L. 2009. Ensemble Methods For Improving the Performance of Neighborhood-Based Collaborative Filtering. in Proceedings of the 3Rd Acm Conference on Recommender Systems (Recsys'09). Acm Press, New York, 261-264.
122. Shrestha, D. L. and Solomatine, D. P. 2006. Experiments With Adaboost.Rt, An Improved Boosting Scheme For Regression. Neural Comput. 18, 1678-1710.
123. Skalak, D. B. 1994. Prototype and Feature Selection By Sampling and Random Mutation Hill Climbing Algorithms. in Proceedings of the International Conference on Machine Learning. Morgan Kaufmann, 293-301.
124. Skomoroch, P. 2008. Some Datasets Available on the Web. http://www.Datawrangling.Com/Some-Datasetsavailable- on-the-Webb
125. Stark, P. and Parker, R. 1995. Bounded-Variable Least Squares: An Algorithm and Applications.Comput. Statist. 10, 2, 129-141.
126. Stone, M. 1974. Cross-Validatory Choice and Assessment of Statistical Predictions. J. Roy. Statist. Soc. B36, 2, 111-147.
127. Strehl, A. and Ghosh, J. 2003. Cluster Ensembles: A Knowledge Reuse Framework For Combining Multiple Partitions. J. Mach. Learn. Res. 3, 583-617.
128. Tamon, C. and Xiang, J. 2000. on the Boosting Pruning Problem. in Proceedings of the European Conference on Machine Learning. Lecture Notes in Computer Science, Vol. 1810. Springer, 404-412.
129. Thompson, S. K. and Seber, G. A. 1986. Adaptive Sampling. John Wiley & Sons.
130. Tian, J.,Wu, N., Chu, X., and Fan, Y. 2010. Predicting Changes in Protein thermostability Brought About By Single- Or Multi-Site Mutations. Bmc Bioinf. 11, 370.
131. Todorovski, L. and Dzeroski, S. 2003.Combining Classifiers With Meta Decision Trees. Mach. Learn. 50, 3, 223-249.
132. Torgo, L. Regression Datasets. http://www.Liaad.Up.Pt/Ltorgo/Regression/ Datasets.html.
133. Tresp, V. and Taniguchi, M. 1995.Combining Estimators Using Non-Constant Weighting Functions. Adv. Neural Inf. Process. Syst. 7, 419-426.
134. Tsang, I. W., Kocsor, A., and Kwok, J. T. 2006. Diversified Svm Ensembles For Large Data Sets. in Proceedings of the International Conference on Machine Learning. Lecture Notes in Artificial Intelligence, Vol. 4212. Springer, 792-800.
135. Tsang, I. W., Kwok, J. T., and Lai, K. T. 2005. Core Vector Regression For Very Large Regression Problems. in Proceedings of the International Conference on Machine Learning. 912-919.
136. Tsoumakas, G., Partalas, I., and Vlahavas, I. 2008. A Taxonomy and Short Review of Ensemble Selection. in Proceedings of theworkshop on Supervised and Unsupervised Ensemble Methods and their Applications.
137. Tsymbal, A., Pechenizkiy, M., and Cunningham, P. 2006A. Dynamic Integration With Random Forests. in Proceedings of the European Conference on Machine Learning (Ecml'06). Lecture Notes in Artificial Intelligence, Vol. 4212. Springer, 801-808.
138. Tsymbal, A., Pechenizkiy, M., and Cunningham, P. 2006B. Dynamic Integration With Random Forests. Tech. Rep. Tcd-Cs-2006-23, the University of Dublin, Trinity College.
139. Tsymbal, A., Pechenizkiy, M., Cunningham, P., and Puuronen, S. 2008. Dynamic Integration of Classifiers For Handling Concept Drift. Inf. Fusion 9, 1, 56-68.
140. Ueda, N. and Nakano, R. 1996. Generalization Error of Ensemble Estimators. in Proceedings of the Ieee Conference on Neural Networks. Vol. 1. 90-95.
141. Vafaie, H. and Jong, K. D. 1993. Robust Feature Selection Algorithms. in Proceedings of the Ieee Conference on Tools For Artificial Intelligence. 356-363.
142. Verikas, A., Lipnickas, A., Malmqvist, K., Becauskiene, M., and Gelzinis, A. 1999. Soft Combining of Neural Classifiers: A Comparative Study. Pattern Recogn. Lett. 20, 4, 429-444.
143. Vlachos, P. 2005. Statlib: Datasets Archive. http://Lib.Stat.Cmu.Edu/ Datasets/.
144. Wang, H., Fan, W., Yu, P. S., and Han, J. 2003. Mining Concept-Drifting Data Streams Using Ensemble Classifiers. in Acm International Conference on Knowledge Discovery and Data Mining.
145. Webb, G. I. and Zheng, Z. 2004. Multistrategy Ensemble Learning: Reducing Error By Combining Ensemble Learning Techniques. Ieee Trans. Knowl. Data Engin. 16, 8, 980-991.
146. Weyuker, E. J., Ostrand, T. J., and Bell, R. M. 2010.Comparing the Effectiveness of Several Modeling Methods For Fault Prediction. Empir. Softw. Engin. 15, 277-295.
147. Wichard, J., Merkwirth, C., and Ogorzalek, M. 2003. Building Ensembles With Heterogeneous Models. in Course of the International School on Neural Nets.
148. Wilson, D. R. and Martinez, T. R. 1997. Improved Heterogeneous Distance Functions. J. Artif. Intell. Res. 6, 1-34.
149. Witten, I. H. and Frank, E. 2011. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann.
150. Wolpert, D. H. 1992. Stacked Generalization. Neural Netw. 5, 2, 241-259.
151. Woods, K. 1997.Combination of Multiple Classifiers Using Local Accuracy Estimates. Ieee Trans. Pattern Anal. Mach. Intell. 19, 4, 405-410.
152. Yang, J. and Honavar, V. 1997. Feature Subset Selection Using A Genetic Algorithm. Ieee Trans. Intell. Syst. 13, 2, 44-49.
153. Yankov, D., Decoste, D., and Keogh, E. 2006. Ensembles of Nearest Neighbor Forecasts. in Proceedings of the European Conference on Machine Learning. Lecture Notes in Artificial Intelligence, Vol. 4212. Springer, 545-556.
154. Yao, X., Fischer, M., and Brown, G. 2001. Neural Network Ensembles and their Application To Traffic Flow Prediction in Telecommunications Networks. Neural Netw. 1, 693-698.
155. Yu, Y., Zhou, Z.-H., and Ting, K. M. 2007. Cocktail Ensemble For Regression. in Proceedings of the Ieee International Conference on Data Mining. 721-726.
156. Zemel, R. S. and Pitassi, T. 2001. Advances in Neuralinformation Processing Systems. Vol. 13. Mit Press, Chapter A Gradient-Based Boosting Algorithm For Regression Problems, 696-702.
157. Zenobi, G. and Cunningham, P. 2001. Using Diversity in Preparing Ensembles of Classifiers Based on Different Feature Subsets To Minimize Generalization Error. in Proceedings of the European Conference on Machine Learning. Lecture Notes in Computer Science, Vol. 2167. Springer, 576-587.
158. Zhang, C.-X., Zhang, J.-S., and Wang, G.-W. 2008. An Empirical Study of Using Rotation Forest To Improve Regressors. Appl. Math.Comput. 195, 2, 618-629.
159. Zhang, J., Zou, Y., and Fan, Y. 2009. Embedded Neural Network To Model-Based Permanent Magnet Synchronous Motor Diagnostics. in Proceedings of the Power Electronics and Motion Control Conference. 1813-1817.
160. Zhao, Q.-L., Jiang, Y.-H., and Xu, M. 2009. A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process. Data Min. Knowl. Discov. 19, 277-292.
161. Zhou, Z.-H. and Tang, W. 2003. Selective Ensemble of Decision Trees. in Proceedings of the International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. Lecture Notes in Artificial Intelligence, Vol. 2639. Springer, 476-483.
162. Zhou, Z.-H., Wu, J., and Tang, W. 2002. Ensembling Neural Networks: Many Could Be Better Than All. Artif. Intell. 137, 239-263.