Abstract
Kernel ridge regression (KRR) is a widely accepted efficient machine learning paradigm that has been fruitfully implemented for solving both classification and regression problems. KRR solves a set of linear equations instead of solving a quadratic programming problem. However, KRR gives equal importance to each sample which leads to giving the same significance to the important and non-important samples. That might lead to low classification accuracy. To resolve this issue, this paper suggests a novel kernel ridge regression based on intuitionistic fuzzy membership (IFKRR) for binary classification. In IFKRR, there is an intuitionistic fuzzy number linked to each training sample which is framed by either its membership or non-membership. A pattern’s membership degree considers its distance from the corresponding class center. However, the non-membership degree is provided by the ratio of the number of heterogeneous points to the total number of its neighborhood points. The proposed IFKRR model can efficiently reduce the influence of noise in datasets. To evaluate the efficiency of IFKRR, its performance is compared with support vector machine (SVM), twin SVM (TWSVM), intuitionistic fuzzy SVM (IFSVM), intuitionistic fuzzy TWSVM (IFTSVM), random vector functional link with univariate trees (RFL), KRR and Co-trained KRR average (CoKRR-avg) on an artificial and a few really interesting real world datasets using Gaussian kernel. Computational results reveal the efficacy of the IFKRR model on the real world as well as noisy 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.