Computer Science ›› 2010, Vol. 37 ›› Issue (6): 122-124.
Previous Articles Next Articles
HU Yan-wei,QIN Zheng,ZHANG Zhong-zhi
Online:
Published:
Abstract: Intrusion detection algorithms based on K-mean clustering have sensitive dependence on initial value and are easy to fall into local extremum.To solve this issue,a new intrusion detection scheme was presented by combing Simulated Annealing and K-mean clustering.The proposed algorithm usesSA to optimize the clustering pattern in the clustering analysis.It can achieve global optimization and better accuracy of the intrusion detection system.Moremover,parallelism of SA greatly quickened the convergence rate.Experiments were completed on KDD Cup 1999,and the results show that presented scheme has lower time consume,false positive rate,and false negative rate cimpared with intrusion detedtion systems based on K-mean clustering.
Key words: Intrusion detection, Simulated annealing, K-mean clustering, Global optimization, Parallelism
HU Yan-wei,QIN Zheng,ZHANG Zhong-zhi. Intrusion Detection Algorithm Based on Simulated Annealing and K-mean Clustering[J].Computer Science, 2010, 37(6): 122-124.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2010/V37/I6/122
Cited