Abstract

Online support vector machine (SVM) is an effective learning method in real-time network traffic classification tasks. However, due to its geometric characteristics, the traditional online SVMs are sensitive to noise and class imbalance. In this paper, a scalable kernel convex hull online SVM called SKCHO-SVM is proposed to solve this problem. SKCHO-SVM involves two stages: (1) offline leaning stage, in which the noise points are deleted and initial pin-SVM classifier is built; (2) online updating stage, in which the classifier is updated with newly arrived data points, while carrying out the classification task. The noise deleting strategy and pinball loss function ensure SKCHO-SVM insensitive to noise data flows. Based on the scalable kernel convex hull, a small amount of convex hull vertices are dynamically selected as the training data points in each class, and the obtained scalable kernel convex hull can relieve class imbalance. Theoretical analysis and numerical experiments show that SKCHO-SVM has the distinctive ability of training time and classification performance.

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.