• DocumentCode
    1572586
  • Title

    A cooperative intrusion detection system based on improved parallel SVM

  • Author

    Du, Hongle ; Teng, Shaohua ; Fu, Xiufen ; Zhang, Wei ; Pu, Yuanfang

  • Author_Institution
    Fac. of Comput., Guangdong Univ. of Technol., Guangzhou, China
  • fYear
    2009
  • Firstpage
    515
  • Lastpage
    518
  • Abstract
    It is important that the training time of the Support Vector Machine (SVM) is shortened and storage space requirement is reduced for high-speed and large-scale network. An intrusion detection method based on parallel SVM is proposed and a detection model system is constructed in this paper. First, original training dataset gained from network is divided into three subsets according to the network protocol (TCP, UDP and ICMP). Second, every subset is parted into multi-subsets and sent to parallel SVMs. Then we get multiple results from SVM trainers. The incremental learning algorithm of SVM is used to train new data sets instead of reconstructing SVM for whole data. This method improves the training efficiency by reducing the size of training subsets. At last, simulation experiments are done with KDD CUP 1999 data set. The experiment results show that the training time of SVM is shortened and the detection accuracy obtained by our method is exactly same as that obtained by others.
  • Keywords
    groupware; parallel algorithms; protocols; security of data; support vector machines; ubiquitous computing; cooperative intrusion detection system; high speed network; large scale network; learning algorithm; network protocol; parallel SVM; pervasive computing; support vector machine; Data security; Intrusion detection; Large-scale systems; Learning systems; Machine learning; Parallel algorithms; Pervasive computing; Protocols; Support vector machines; Ubiquitous computing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pervasive Computing (JCPC), 2009 Joint Conferences on
  • Conference_Location
    Tamsui, Taipei
  • Print_ISBN
    978-1-4244-5227-9
  • Electronic_ISBN
    978-1-4244-5228-6
  • Type

    conf

  • DOI
    10.1109/JCPC.2009.5420129
  • Filename
    5420129