• Title of article

    A triangle area based nearest neighbors approach to intrusion detection

  • Author/Authors

    Tsai، نويسنده , , Chih-Fong and Lin، نويسنده , , Chia-Ying، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2010
  • Pages
    8
  • From page
    222
  • To page
    229
  • Abstract
    Intrusion detection is a necessary step to identify unusual access or attacks to secure internal networks. In general, intrusion detection can be approached by machine learning techniques. In literature, advanced techniques by hybrid learning or ensemble methods have been considered, and related work has shown that they are superior to the models using single machine learning techniques. This paper proposes a hybrid learning model based on the triangle area based nearest neighbors (TANN) in order to detect attacks more effectively. In TANN, the k-means clustering is firstly used to obtain cluster centers corresponding to the attack classes, respectively. Then, the triangle area by two cluster centers with one data from the given dataset is calculated and formed a new feature signature of the data. Finally, the k-NN classifier is used to classify similar attacks based on the new feature represented by triangle areas. By using KDD-Cup ’99 as the simulation dataset, the experimental results show that TANN can effectively detect intrusion attacks and provide higher accuracy and detection rates, and the lower false alarm rate than three baseline models based on support vector machines, k-NN, and the hybrid centroid-based classification model by combining k-means and k-NN.
  • Keywords
    Support Vector Machines , Intrusion Detection , K-Nearest Neighbors , Triangle area , k-means , Machine Learning
  • Journal title
    PATTERN RECOGNITION
  • Serial Year
    2010
  • Journal title
    PATTERN RECOGNITION
  • Record number

    1733102