Skip to main content

Reduction of Data Size in Intrusion Domain Using Modified Simulated Annealing Fuzzy Clustering Algorithm

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 296))

Abstract

Network security is becoming an important issue as the size and application of the network is exponentially increasing worldwide. Performance of Intrusion Detection System (IDS) is greatly depends on the size of data and a systematic approach to handling such data. In the paper, modified simulated annealing fuzzy clustering (SAFC) algorithm has been proposed using the concept of Rough set theory that removes randomness of the SAFC algorithm and applied on intrusion domain for data size reduction. The reduced data set increases classification accuracy in detecting network data set as ‘anomaly’ or ‘normal’ compared to the original data set. Davies-Bouldin (DB) validity Index is evaluated to measure the performance of the proposed IDS.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandyopadhyay, S.: Simulated Annealing Using a Reversible Jump Markov Chain Monte Carlo Algorithm for Fuzzy Clustering. IEEE Transactions on Knowledge and Data Engineering 17(4) (April 2005)

    Google Scholar 

  2. Zhu, L., Chung, F.L., Wang, S.: Generalized Fuzzy C-Means Clustering Algorithm With Improved Fuzzy Partitions. IEEE Transactions on Systems, Man and Cybernetics 39(3), 578–591 (2009)

    Article  Google Scholar 

  3. Kirkpatrik, S., Gelatt, C., Vecchi, M.: Optimization by Simulated Annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  4. Xie, X.L., Beni, G.: A validity measure for fuzzy clustering. IEEE Trans. Pattern Analysis and Machine Intelligence 13, 841–847 (1991)

    Article  Google Scholar 

  5. Wang, X.Y., Whitwell, G., Garibaldi, J.M.: The Application Of A Simulated Annealing Fuzzy Clustering Algorithm For Cancer Diagnosis. In: IEEE 4th International Conference on Intelligent Systems Design and Application, Budapest, Hungary, August 26-28, pp. 467–472 (2004)

    Google Scholar 

  6. Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Transactions on Pattern Recognition and Machine Intelligence 1(2), 224–227 (1979)

    Article  Google Scholar 

  7. Guo, P., Tanaka, H.: Upper and lower possibility distributions with rough set concepts. In: Inuiguchi, M., Hirano, S., Tsumoto, S. (eds.) Rough Set Theory and Granular Computing. LNCS, pp. 243–250. Springer (2002)

    Google Scholar 

  8. The NSL-KDD Data Set, http://iscx.ca/NSL-KDD/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sengupta, N., Srivastava, A., Sil, J. (2013). Reduction of Data Size in Intrusion Domain Using Modified Simulated Annealing Fuzzy Clustering Algorithm. In: Das, V.V., Chaba, Y. (eds) Mobile Communication and Power Engineering. AIM 2012. Communications in Computer and Information Science, vol 296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35864-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35864-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35863-0

  • Online ISBN: 978-3-642-35864-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics