Abstract

This paper concentrates on the problem of network intrusion detection, which is an important problem in informatisation construction. We utilise the incremental support vector machine SVM to solve the network intrusion detection problem, and the SVM classification problem can be tackled by a decision function via a quadratic program. Particularly, the incremental SVM is used to train an SVM classifier with a partition of the given dataset; at the same time, support vectors at every step are reserved and the training set for the next iteration is constructed. Furthermore, the crucial problem of the incremental SVM is to impose the Karush-Kuhn-Tucker KKT conditions on the training dataset when adding a new vector. Moreover, to optimise parameters in the incremental SVM, particle swarm optimisation is utilised. If there is at least one sample in the set incremental training sample dataset, which cannot satisfy the KKT condition, the SVM classifiers to detect network intrusion can be obtained. To make performance evaluation of the proposed algorithm, experiments are conducted using the 'KDD Cup 1999' dataset. Experimental results demonstrate that compared with other corresponding methods, the proposed algorithm can effectively detect network intrusion behaviours with high accuracy rate and low time consumption.

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.