An unsupervised intrusion detection method combined clustering with chaos simulated annealing

Proceedings of the Sixth International Conference on Machine Learning and Cybernetics, ICMLC 2007

Volumn 6, Issue , 2007, Pages 3217-3222

  Ni, Lin ^a   Zheng, Hong Ying ^a  

^a CHONGQING UNIVERSITY   (China)

Author keywords

Chaos; Intrusion detection; Partitioned clustering; Simulated annealing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CHAOTIC SYSTEMS; CLUSTER ANALYSIS; NETWORK SECURITY; SIMULATED ANNEALING;

INTRUSION DETECTION BASED ON UNSUPERVISED CLUSTERING AND CHAOS SIMULATED ANNEALING ALGORITHM (IDCCSA); PARTITIONED CLUSTERING;

INTRUSION DETECTION;

EID: 38049052560     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMLC.2007.4370702     Document Type: Conference Paper

References (15)

1. Aurobindo Sundaram. An Introduction to Intrusion Detection [J]. Crossroads, 1996, 2 (4): 3-7.
2. Juan M. Estévez-Tapiador. Measuring normality in http traffic for anomaly-based intrusion detection [J]. Computer networks, 2004, 45: 175-193.
3. Y.Qiao,X.W.Xin,Y.Bin and S.Ge. Anomaly intrusion detection method based on HMM [J]. Electronics letters, 2002, 38(13): 663-664.
4. Yihua Liao. Use of k-nearest neighbor classifier for intrusion detection [J]. Computers & security, 2002,21(5): 439-448.
5. Srinivas Mukkamala, Andrew H. Sung. Identifying Important Features for Intrusion Detection Using Neural Networks [C], Proceedings of the 15th international conference on Computer communication (2002): 1132-1138.
6. Sanghamitra Bandyopadhyay, Ujjwal Maulik. An evolutionary technique based on K-Means algorithm for optimal clustering in RN[J]. Information Sciences, 2002, 146:221 -237.
7. Yiu-Ming Cheung. k*-Means: A new generalized k-means clustering algorithm [J], Pattern Recognition Letters ,2003,24:2883 - 2893.
8. Harmeling, S., et al. From outliers to prototypes: ordering data [DB/OL]. (http://ida.first.fhg.de/charmeli/ordering.pdf), 2004.
9. Sang Hyun Oh, et al. An anomaly intrusion detection method by clustering normal user behavior [J]. Computer & security, 2003,22(7):596-612.
10. Kingsly Leung, et al. Unsupervised Anomaly Detection in Network Intrusion Detection Using Clusters [C]. Proceedings of the Twenty-eighth Australasian conference on Computer Science, 2005,38.
11. Ningning Wu, Jing Zhang. Factor-analysis based anomaly detection[C]. Proceedings of the 2003 IEEE Workshop on Information Assurance, 2003: 108-115.
12. Zhenying ma. A Genetic SOM Clustering Algorithm for Intrusion Detection [J]. Lecture notes in computer science, ISNN2005, 3498:421-427.
13. ShengYi Jiang , Xiaoyu Song,A clustering-based method for unsupervised intrusion detections , Pattern Recognition Letters 2006,27:802 - 810
14. Donald E. Brown. A Practical Application of Simulated Annealing to Clustering [J]. Pattern Recognition,1992,25(4):401-412.
15. KDD-99 Cup Data Set. http://kdd.ics.uci.edu/databases/kddcup99/kddcup99. html