Kernel Target Alignment based Fuzzy Least Square Twin Bounded Support Vector Machine
- Publication Type:
- Conference Proceeding
- Proceedings of the 2018 IEEE Symposium Series on Computational Intelligence, SSCI 2018, 2019, pp. 228 - 235
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2018 IEEE. A kernel-target alignment based fuzzy least square twin bounded support vector machine (KTAFLSTBSVM) is proposed to reduce the effects of outliers and noise. The proposed model is an effective and efficient fuzzy based least square twin bounded support vector machine for binary classification where the membership values are assigned based on kernel-target alignment approach. The proposed KTA-FLSTBSVM solves the two systems of linear equations, which is computationally very fast with significant comparable performance. To development the robust model, this approach minimizes the structural risk which is the gist of statistical learning theory. This powerful KTA-FLSTBSVM approach is tested on artificial data sets as well as benchmark real-world datasets that provide significantly better result in terms of generalization performance and computational time.
Please use this identifier to cite or link to this item: