An Efficient Smooth Quantile Boost Algorithm for Binary Classification

HTML  XML Download Download as PDF (Size: 322KB)  PP. 615-624  
DOI: 10.4236/apm.2016.69050    2,019 Downloads   3,263 Views  

ABSTRACT

In this paper, we propose a Smooth Quantile Boost Classification (SQBC) algorithm for binary classification problem. The SQBC algorithm directly uses a smooth function to approximate the “check function” of the quantile regression. Compared to other boost-based classification algorithms, the proposed algorithm is more accurate, flexible and robust to noisy predictors. Furthermore, the SQBC algorithm also can work well in high dimensional space. Extensive numerical experiments show that our proposed method has better performance on randomly simulations and real data.

Share and Cite:

Wang, Z. and Ye, W. (2016) An Efficient Smooth Quantile Boost Algorithm for Binary Classification. Advances in Pure Mathematics, 6, 615-624. doi: 10.4236/apm.2016.69050.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.