Abstract

Rotation forest (RoF) is an ensemble classifier based on the combination of linear analysis theories and decision tree algorithms. In existing works, the RoF has demonstrated high classification accuracy and good performance with a reasonable number of base classifiers. However, the classification accuracy drops drastically for linearly inseparable datasets. This paper presents a hybrid algorithm integrating kernel principal component analysis and RoF algorithm (KPCA-RoF) to solve the classification problem in linearly inseparable cases. We choose the radial basis function (RBF) kernel for the PCA algorithm to establish the nonlinear mapping and segmentation for gene data. Moreover, we focus on the determination of suitable parameters in the kernel functions for better performance. Experimental results show that our algorithm solves linearly inseparable problem and improves the classification accuracy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.