Skip to main content

Efficient Attack Detection Based on a Compressed Model

  • Conference paper
Information Security Practice and Experience (ISPEC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7863))

  • 1122 Accesses

Abstract

In order to achieve the goal of high efficiency in intrusion detection systems, especially in the real-time attack detection environment, a compressed model is proposed in this paper. With the emergence of the new clustering methods, such as the affinity propagation, the idea of the compressed detection model tends to be mature as it is unnecessary to define the number of centers beforehand. The compressed model resulting from both the horizontal compression and the vertical compression is built with representative training data and useful attributes in each package. In addition, a distance matrix is extracted from previous steps for processing complex data. Experimental study based on two publicly available datasets presents that the compressed model proposed can effectively speed up the detection procedure (up to 184 times) and most importantly, a minimal accuracy difference is guaranteed as well (less than 1% on average).

Paper was partially supported by the National Natural Science Foundation of China under grant No.61103044, Zhejiang Natural Science Foundation of China under grant No.Y1110576.

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. Wenke, L., Salvatore, J.S.: Data Mining Approaches for Intrusion Detection. In: USENIX Security Symposium (1998)

    Google Scholar 

  2. Varun, C., Arindam, B., Vipin, K.: Anomaly Detection: A Survey. ACM Computing Surveys 41(3), 1–58 (2009)

    Google Scholar 

  3. Frey, B.J., Dueck, D.: Clustering by Passing Messages between Data Points. Science 315(5814), 972–976 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. World Internet Usage Statistics, http://www.internetworldstats.com/stats.htm

  5. Srinivas, M., Andrew, H.S.: Feature Selection for Intrusion Detection Using Neural Networks and Support Vector Machines. Annual Meeting of the Transportation Research Board (2003)

    Google Scholar 

  6. Srilatha, C., Ajith, A., Johnson, P.T.: Feature Duduction and Ensemble Design of Intrusion Detection Systems. Computer & Security – COMPSEC 24(4), 295–307 (2005)

    Article  Google Scholar 

  7. Chang, C.C., Lin, C.J.: LIBSVM: A Library for Support Vector Machines. ACM Transactions on Intelligent Systems and Technology (TIST) 2(3), 27 (2011)

    Google Scholar 

  8. Information and Computer Science of University of California, http://kdd.ics.uci.edu/databases/kddcup99/kddcup99.html

  9. The 3rd Cybersecurity Data Mining Competition, http://www.csmining.org/cdmc2012/

  10. Martin, R.: Snort: Lightweight Intrusion Detection for Networks. In: USENIX Systems Administration Conference LISA, pp. 229–238 (1999)

    Google Scholar 

  11. Daniela, B., Kavé, S., Margin, M.: A Signal Processing View on Packet Sampling and Anomaly Detection. In: IEEE INFOCOM, pp. 713–721 (2010)

    Google Scholar 

  12. Yang, L., Tian-Bo, L., Li, G., Zhi-Hong, T., Lin, Q.: Optimizing Network Anomaly Detection Scheme Using Instance Selection Mechanism. In: Global Telecommunications Conference, pp. 1–7 (2009)

    Google Scholar 

  13. Vasiliadis, G., Antonatos, S., Polychronakis, M., Markatos, E.P., Ioannidis, S.: Gnort: High Performance Network Intrusion Detection Using Graphics Processors. In: Lippmann, R., Kirda, E., Trachtenberg, A. (eds.) RAID 2008. LNCS, vol. 5230, pp. 116–134. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Holte, R.C.: Very Simple Classification Rules Perform Well on Most Commonly Used Datasets. Machine Learning 11(1), 63–90 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lincoln Laboratory, Massachusetts Institute of Technology, http://www.ll.mit.edu/mission/communications/ist/corpora/ideval/data/index.html

  16. Enrique, V.: New Formulation and Improvements of the Nearest-neighbor Approximating and Eliminating Search Algorithm. Pattern Recognition Letters 15(1), 1–7 (1994)

    Article  Google Scholar 

  17. Levenshtein, V.I.: Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Soviet Physics Doklady 10 (1966)

    Google Scholar 

  18. Joseph, B.K.: An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules. Siam Review 25(2) (1983)

    Google Scholar 

  19. Victor, B.: Metric Spaces: Iteration and Application. Cambridge University Press (1985)

    Google Scholar 

  20. Noble, C.C., Cook, D.J.: Graph-based Anomaly Detection. In: 9th ACM SIGKDD, pp. 631–636 (2003)

    Google Scholar 

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

Jin, S., Kim, O., Chen, T. (2013). Efficient Attack Detection Based on a Compressed Model. In: Deng, R.H., Feng, T. (eds) Information Security Practice and Experience. ISPEC 2013. Lecture Notes in Computer Science, vol 7863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38033-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38033-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38032-7

  • Online ISBN: 978-3-642-38033-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics