Skip to main content
SpringerLink
Log in

K-Nearest Neighbor and Boundary Cutting Algorithm for Intrusion Detection System

  • Conference paper
  • First Online:
Information Systems Design and Intelligent Applications

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 434))

Abstract

Intrusion detection system is used for securing computer networks. Different data mining techniques are used for intrusion detection system with low accuracy and high false positive rate. Hicuts, HyperCuts, and EffiCuts are decision tree based packet classification algorithm which performs excellent search in classifier but requires high amount of memory. So in order to overcome these disadvantages, new approach is provided. In this, we present a hybrid approach for intrusion detection system. Boundary Cutting Algorithm and K-Nearest Neighbor using Manhattan and Jaccard coefficient similarity distance is used for high detection rate, low false alarm and less memory requirement. KDD Cup 99 dataset is used for evaluation of these algorithms. Result is evaluated using KDD CUP 99 dataset in term of accuracy, false alarm rate. Majority voting is done. This approach provides high accuracy and low memory requirements as compare to other algorithm.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Punam Mulak, Nitin Talhar.: Novel Intrusion Detection System Using Hybrid Aprroach, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 11, November (2014).

    Google Scholar 

  2. Prashanth, V. Prashanth, P. Jayashree, N. Srinivasan.: Using Random Forests for Network-based Anomaly detection at Active routers, IEEE International Conference on Signal processing, Communication and networking, Madras Institute of Technology, Anna University Chennai India, and Jan 4–6, (2008).

    Google Scholar 

  3. Sandhya Peddabachigari, Ajith Abraham, Johnson Thomas.: Intrusion Detection Systems Using Decision Trees and Support Vector Machines, IEEE.

    Google Scholar 

  4. Mehdi MORADI and Mohammad ZULKERNINE.: A Neural Network Based System for Intrusion Detection and Classification of Attacks.

    Google Scholar 

  5. Amira Sayed A. Aziz Aboul Ella Hassanien Sanaa El-Ola Hanafy M.F. Tolba.: Multi-layer hybrid machine learning techniques for anomalies detection and classification approach, IEEE, (2013).

    Google Scholar 

  6. Prasanta Gogoi, B. Borah and D. K. Bhattacharyya.: Network Anomaly Identification using Supervised Classifier, Informatica 37 93–7 (2013).

    Google Scholar 

  7. Yanyan Qian, Yongzhong Li.: An Intrusion Detection Algorithm Based on Multi-label Learning, Workshop on Electronics, Computer and Applications, IEEE, (2014).

    Google Scholar 

  8. R. W.-w Hu Liang and R. Fei.: An adaptive anomaly detection based on hierarchical clustering, Information Science and Engineering (ICISE), 2009 1st International Conference on, Changchun, China, Dec. 2009, pp. 1626–1629.

    Google Scholar 

  9. Zhao Ruan, Xianfeng Li, Wenjun Li.: An Energy-efficient TCAM-based Packet Classification with Decision-tree Mapping, IEEE, (2013).

    Google Scholar 

  10. Pang-Nang Tan, Michael Steinbach, Vipin Kumar.: Data Mining.

    Google Scholar 

  11. Rajendra Prasad Palnatya, Rajendra Prasad Palnaty.: JCADS: Semi-Supervised Clustering Algorithm for Network Anomaly Intrusion Detection Systems, IEEE, (2013).

    Google Scholar 

  12. Archana Singh, Avantika Yadav, Ajay Rana.: K-means with Three different Distance Metrics International Journal of Computer Applications, Volume 67–No.10, April (2013).

    Google Scholar 

  13. Hyesook Lim, Nara Lee, Geumdan Jin, Jungwon Lee, Youngju Choi, Changhoon Yim.: Boundary Cutting for Packet Classification, IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 22, NO. 2, APRIL, (2014).

    Google Scholar 

  14. Jiawei Han, Micheline Kamber, Jian Pei.: Data Mining concepts Technologies, Third Edition Elsevier.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Department, AISSMS College of Engineering, Kennedy Road, Pune, India

    Punam Mulak, D. P. Gaikwad & N. R. Talhar

Authors
  1. Punam Mulak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. P. Gaikwad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. N. R. Talhar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Punam Mulak .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Anil Neerukonda Institute of Technology and Sciences, Visakhapatnam, India

    Suresh Chandra Satapathy

  2. Kalyani University, Nadia, West Bengal, India

    Jyotsna Kumar Mandal

  3. University of Hyderabad, Hyderabad, India

    Siba K. Udgata

  4. Department of Electronics and Communication Engineering, Shri Ramswaroop Memorial Group of Professional Colleges, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Mulak, P., Gaikwad, D.P., Talhar, N.R. (2016). K-Nearest Neighbor and Boundary Cutting Algorithm for Intrusion Detection System. In: Satapathy, S.C., Mandal, J.K., Udgata, S.K., Bhateja, V. (eds) Information Systems Design and Intelligent Applications. Advances in Intelligent Systems and Computing, vol 434. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2752-6_26

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2752-6_26

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2750-2

  • Online ISBN: 978-81-322-2752-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation