A New Data Stream Clustering Approach about Intrusion Detection

Abstract:

Intrusion detection is one of the most important techniques for protecting network security. In addition, intrusion detection model can be used to recognize real-time pattern, which has important practical significance for real-time intrusion detection. However, due to the sheer speed and scale of the data, data points must often be analyzed in real time. The one-pass-through requirement and the lack of efficient clustering algorithms to identify intrusion patterns limit the power and scalability of this approach. A data stream clustering algorithm is proposed for real-time network intrusion detection. By introducing the new hashing mechanism, the method can quickly find the clustering patterns in the data stream. The method significantly reduces the false alarm rate of intrusion detection, and improves the performance of intrusion detection system.

• Periodical: Advanced Materials Research (Volumes 926-930)
• Pages: 2898-2901
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.926-930.2898
• Online since: May 2014
• Authors: Zhuo Qun Li
• Keywords: Data Stream Clustering, Intrusion Detection, Network Security

References

[1] C. Aggarwal, J. Han, J. Wang and P. Yu, A Framework for Projected Clustering of High Dimensional Data Streams [C], in Proceedings of the international conference on Very Large Databases, 2004, 852-863.

DOI: 10.1016/b978-012088469-8.50075-9

[2] J. Silva, M. Klusch, S. Lodi and G. Moro, Inference Attacks in Peer-to-Peer Homogeneous distributed data mining [C], in 16th European Conference on Artificial Intelligence (ECAI), 2004, 16: 450-454.

[3] FU Tao, SUN Ya-min, PSO-based k-means Algorithm and its Application in Network Intrusion Detection System [J]. Computer Science, 2011, 38(5): 54-55.

[4] INDYK P, MOTWANI R. Approximate nearest neighbors: towards removing the curse of dimensionality[C]. Proceedings of the thirtieth annual ACM symposium on Theory of computing. New York, NY, USA: ACM, STOC' 98, 1998, 604-613.

DOI: 10.1145/276698.276876

[5] GIONIS A, INDYK P, MOTWANI R. Similarity Search in High Dimensions via Hashing[C]. Proceedings of the 25th International Conference on Very Large Data Bases. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., VLDB' 99, 1999, 518-529.

[6] Xin Sun, Yu Jiao. pGrid: Parallel Grid-Based Data Stream Clustering with Map Reduce [R]. Reports, OAK RIDGE NATIONAL LABORATORY Oak Ridge, Applied Software Engineering Research Group. (2009).