Abstract
Embedded feature selection algorithms, such as support vector machine based recursive feature elimination (SVM-RFE), have proven to be effective for many real applications. However, due to the model selection problem, SVM-RFE naturally suffers from a heavy computational burden as well as high computational complexity. To solve these issues, this paper proposes using an optimized extreme learning machine (OELM) model instead of SVM. This model, referred to as OELM-RFE provides an efficient active set solver for training the OELM algorithm. We also present an effective alpha seeding algorithm to efficiently solve successive quadratic programming (QP) problems inherent in OELM. One of the salient characteristics of OELM-RFE is that it has only one tuning parameter: the penalty constant C. Experimental results from work on benchmark datasets show that OELM-RFE tends to have higher prediction accuracy than SVM-RFE, and requires fewer model selection efforts. In addition, the alpha seeding method works better on more datasets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.