Principal weighted support vector machines for sufficient dimension reduction in binary classification
By: Researcher
Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).
Please contact us in case of a broken link from here
| Authors | Seung Jun Shin, Yichao Wu, Hao Helen Zhang, Yufeng Liu |
| Journal/Conference Name | Biometrika |
| Paper Category | Agricultural and Biological Sciences |
| Paper Abstract | Sufficient dimension reduction is popular for reducing data dimensionality without stringent model assumptions. However, most existing methods may work poorly for binary classification. For example, sliced inverse regression (Li, 1991) can estimate at most one direction if the response is binary. In this paper we propose principal weighted support vector machines, a unified framework for linear and nonlinear sufficient dimension reduction in binary classification. Its asymptotic properties are studied, and an efficient computing algorithm is proposed. Numerical examples demonstrate its performance in binary classification. |
| Date of publication | 2016 |
| Code Programming Language | R |
| Comment |
Copyright Researcher 2022