Boosting support vector machines successfully

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5519 LNCS, Issue , 2009, Pages 509-518

  Ting, Kai Ming ^a   Zhu, Lian ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Boosting; Local models; Support vector machines

Indexed keywords

BOOSTING; COMPUTATIONAL COSTS; GLOBAL MODELS; LARGE DATASETS; LOCAL MODEL; LOCAL MODELS; MODEL STABILITY; MULTIPLE MODELS; PREDICTIVE ACCURACY; PREDICTIVE PERFORMANCE;

CLASSIFIERS; DECISION TREES; IMAGE RETRIEVAL; VECTORS;

SUPPORT VECTOR MACHINES;

EID: 70349332798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02326-2_51     Document Type: Conference Paper

References (18)

1. Freund, Y., Schapire, R.E.: Experiments with a new boosting algorithm. In: Proceedings of the Thirteenth International Conference on Machine Learning, pp. 148-156 (1996)
2. Zenobi, G., Cunningham, P.: Using Diversity in Preparing Ensembles of Classifiers Based on Different Feature Subsets to Minimize Generalization Error. In: Flach, P.A., De Raedt, L. (eds.) ECML 2001. LNCS, vol. 2167, pp. 576-587. Springer, Heidelberg (2001)
3. Kuncheva, L.I., Whitaker, C.J.: Measures of Diversity in Classifier Ensembles and Their Relationship with the Ensemble Accuracy. Machine Learning 51, 181-207 (2003)
4. Lam, L.: Classifier Combinations. Implementations and Theoretical Issues. In: Kittler, J., Roli, F. (eds.) MCS 2000. LNCS, vol. 1857, pp. 77-86. Springer, Heidelberg (2000)
5. Freund, Y.: An adaptive version of the boost by majority algorithm. In: Proceedings of the 12th Conference on Computational Learning Theory, pp. 102-113. ACM Press, New York (1999)
6. Platt, J.C.: Sequential Minimal Optimization: A Fast Algorithm for Training Support Vector Machines. Technical Report MST-TR-98-14, Microsoft Research (1998)
7. Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)
8. Quinlan, J.R.: C4. 5: programs for machine learning. Morgan Kaufmann, San Francisco (1993)
9. Asuncion, A., Newman, D.J.: UCI Machine Learning Repository, University of California, Irvine, CA (2007), http://www.ics.uci.edu/̃mlearn/ MLRepository.html
10. Pavlov, D., Mao, J., Dom, B.: Scaling-up support vector machines using the boosting algorithm. In: International Conference on Pattern Recognition, pp. 219-222 (2000)
11. Tao, D., Tang, X., Li, X., Wu, X.: Asymmetric bagging and random subspace for support vector machines-based relevance feedback in image retrieval. IEEE Transactions in Pattern Analysis and Machine Intelligence 28(7), 1088-1099 (2006)
12. Davidson, I.: An Ensemble Technique for Stable Learners with Performance Bounds. In: Proceedings of the 19th National Conference on Artificial Intelligence, pp. 330-335 (2004)
13. Tsang, I., Kwok, J.T., Cheung, P.-M.: Core Vector Machines: Fast SVM Training on Very Large Data Sets. Journal of Machine Learning Research 6, 363-392 (2005)
14. Tsang, I.W., Kocsor, A., Kwok, J.T.: Simpler core vector machines with enclosing balls. In: Proceedings of the 24th International Conference on Machine learning, pp. 911-918 (2007)
15. Ting, K.M., Zheng, Z.: A Study of AdaBoost with Naive Bayesian Classifiers: Weakness and Improvement. Computational Intelligence 19(2), 186-200 (2003)
16. Kohavi, R.: Scaling Up the Accuracy of Naive-Bayes Classifiers: a Decision-Tree Hybrid. In: Proceedings of the 2nd KDD, pp. 202-207 (1996)
17. Ho, T.K.: The Random Subspace Method for Constructing Decision Forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(8), 832-844 (1998)
18. Li, X., Wang, L., Sung, E.: A Study of AdaBoost with SVM based Weak Learners. In: Proceedings of the International Joint Conference on Neural Networks, pp. 196-201 (2005)