earticle

논문검색

Technique for Intrusion Detection based on Minkowsky Distance Negative Selection Algorithm

초록

영어

Traditional negative selection algorithms often result in a number of black holes, which directly leads to the missing alarm drawback in the intrusion detection system. In order to settle the above problem, a novel negative selection algorithm based on Minkowsky distance is proposed. Firstly, the proposed algorithm computes the Minkowsky distance between the detectors. Then, compute the serial same numbers between the detector and self-set strings, which is helpful to improve the coverage area of the detector. Finally, the new detectors after training and renewal are put into the mature detector set to decline the number of black holes. Experimental results demonstrate that, compared with the traditional negative selection algorithms, the number of black holes and the missing alarm rate decline a lot in the proposed algorithm.

목차

Abstract
 1. Introduction
 2. Negative Selection Algorithm (NSA)
 3. Intrusion Detection Model based on Negative Selection
 4. Negative Selection Algorithm Based on Minkowsky Distance
 5. Intrusion Detection Test
  5.1. Test and Analysis of Algorithms
  5.2. Experiment and Analysis of the Performance of Intrusion Detection Method
 6. Conclusion
 References

저자정보

  • Niu Ling Zhou Kou Normal University,Zhoukou 466001,China
  • Feng Gao-feng JiYuan Vocational and Technical College, JiYuan Henan 454650, China
  • Peng Hai-yun Zhou Kou Normal University, Zhoukou, 466001,China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.