Skip to main content

SVM Based MLP Neural Network Algorithm and Application in Intrusion Detection

  • Conference paper
Artificial Intelligence and Computational Intelligence (AICI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7004))

Abstract

This paper proposes a novel learning algorithm- SVM based MLP neural network algorithm (SVMMLP), which based on the Maximal Margin (MM) principle and take into account the idea of support vectors. SVMMLP has time and space complexities O(N) while usual SVM training methods have time complexity O(N3) and space complexity O(N2), where N is the training-dataset size. Intrusion detection benchmark datasets – NSL-KDD used in experiments that enable a comparison with other state-of-the-art classifiers. The results provide evidence of the effectiveness of our methods regarding accuracy, AUC, and Balanced Error Rate (BER).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Demuth, H., Beale, M.: Neural Network Toolbox Users Guide: For Use with MATLAB, Version 4.0. The Math Works Inc (2000)

    Google Scholar 

  2. Franke, U., Heinrich, S.: Fast obstacle detection for urban traffic situations. IEEE Transactions on Intelligent Transportation Systems 3(3) (September 2002)

    Google Scholar 

  3. Guyon, I., Gunn, S., Nikravesh, M., Zadeh, L.: Feature Extraction, Foundations and Applications. Springer, Heidelberg (2006)

    Book  MATH  Google Scholar 

  4. Boser, B., Guyon, I., Vapnik, V.: A training algorithm for optimal margin classifiers. In: Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pp. 144–152 (1992)

    Google Scholar 

  5. Breiman, L.: Random forests. Machine Learning 45(1), 5–32 (2001), URL citeseer. nj.nec.com/breiman01random.html

    Article  MathSciNet  MATH  Google Scholar 

  6. Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines (2001), Software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm

  7. Chapelle, O., Vapnik, V., Bousquet, O., Mukherjee, S.: Choosing multiple parameters for support vector machines. Machine Learning 46, 131–159 (2002)

    Article  MATH  Google Scholar 

  8. Chu, W., Keerthi, S.S., Ong, C.J.: Bayesian trigonometric support vector classifier. Neural Computation 15(9), 2227–2254 (2003)

    Article  MATH  Google Scholar 

  9. Chung, K.-M., Kao, W.-C., Sun, C.-L., Wang, L.-L., Lin, C.-J.: Radius margin bounds for support vector machines with the RBF kernel. Neural Computation 15, 2643–2681 (2003)

    Article  MATH  Google Scholar 

  10. Yuan, L.H., Shun, S.R.: The Application of The Improved BP Algorithm in The Intru-sion Detection System. Computer Security 8, 3 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hou, Y., Zheng, X.F. (2011). SVM Based MLP Neural Network Algorithm and Application in Intrusion Detection. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23896-3_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23896-3_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23895-6

  • Online ISBN: 978-3-642-23896-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics