• Title/Summary/Keyword: SVM algorithm

Search Result 638, Processing Time 0.023 seconds

Comparative Analysis of Machine Learning Techniques for IoT Anomaly Detection Using the NSL-KDD Dataset

  • Zaryn, Good;Waleed, Farag;Xin-Wen, Wu;Soundararajan, Ezekiel;Maria, Balega;Franklin, May;Alicia, Deak
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.46-52
    • /
    • 2023
  • With billions of IoT (Internet of Things) devices populating various emerging applications across the world, detecting anomalies on these devices has become incredibly important. Advanced Intrusion Detection Systems (IDS) are trained to detect abnormal network traffic, and Machine Learning (ML) algorithms are used to create detection models. In this paper, the NSL-KDD dataset was adopted to comparatively study the performance and efficiency of IoT anomaly detection models. The dataset was developed for various research purposes and is especially useful for anomaly detection. This data was used with typical machine learning algorithms including eXtreme Gradient Boosting (XGBoost), Support Vector Machines (SVM), and Deep Convolutional Neural Networks (DCNN) to identify and classify any anomalies present within the IoT applications. Our research results show that the XGBoost algorithm outperformed both the SVM and DCNN algorithms achieving the highest accuracy. In our research, each algorithm was assessed based on accuracy, precision, recall, and F1 score. Furthermore, we obtained interesting results on the execution time taken for each algorithm when running the anomaly detection. Precisely, the XGBoost algorithm was 425.53% faster when compared to the SVM algorithm and 2,075.49% faster than the DCNN algorithm. According to our experimental testing, XGBoost is the most accurate and efficient method.

Study on ERP Detection Algorithm Using SVM with wavelet feature vector (웨이블릿 특징 벡터 기반 SVM을 이용한 ERP 검출 알고리즘에 관한 연구)

  • Lee, Young-Seok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.1
    • /
    • pp.9-15
    • /
    • 2017
  • In this study we performed the experiment to detect the ERP using SVM with wavelet features. The EEG signal that is generated visual stimulated ERP database in SCCN applied for the experiment. The feature vectors for experiment are categorized frequency and continuous wavelet- based vectors. In experimental results, the detection rate of SVM with wavelet feature vectors improved above 10% comparing with frequency- based feature vector. Based on the experimental results we analyzed the relation between the activity degree of the ERP and the band split characteristics of the ERP by wavelet transform.

Analysis and Implementation of Speech/Music Classification for 3GPP2 SMV Codec Employing SVM Based on Discriminative Weight Training (SMV코덱의 음성/음악 분류 성능 향상을 위한 최적화된 가중치를 적용한 입력벡터 기반의 SVM 구현)

  • Kim, Sang-Kyun;Chang, Joon-Hyuk;Cho, Ki-Ho;Kim, Nam-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.5
    • /
    • pp.471-476
    • /
    • 2009
  • In this paper, we apply a discriminative weight training to a support vector machine (SVM) based speech/music classification for the selectable mode vocoder (SMV) of 3GPP2. In our approach, the speech/music decision rule is expressed as the SVM discriminant function by incorporating optimally weighted features of the SMV based on a minimum classification error (MCE) method which is different from the previous work in that different weights are assigned to each the feature of SMV. The performance of the proposed approach is evaluated under various conditions and yields better results compared with the conventional scheme in the SVM.

Support Vector Machine (SVM) based Voltage Stability Classifier (Support Vector Machine (SVM) 기반 전압안정성 분류 알고리즘)

  • Dosano, Rodel D.;Song, Hwa-Chang;Lee, Byong-Jun
    • Proceedings of the KIEE Conference
    • /
    • 2006.11a
    • /
    • pp.36-39
    • /
    • 2006
  • This paper proposes a support vector machine (SVM) based power system voltage stability classifier using local measurement data. The excellent performance of the SVM in the classification related to time-series prediction matches the real-time data of PMU for monitoring power system dynamics. The methodology for fast monitoring of the system is initiated locally which aims to leave sufficient time to perform immediate corrective actions to stop system degradation by the effect of major disturbances. This paper briefly describes the mathematical background of SVM, and explains the procedure for fast classification of voltage stability using the SVM algorithm. To illustrate the effectiveness of the classifier, this paper includes numerical examples with a 11-bus test system.

  • PDF

Ensemble SVM Learning Using Margin Vector (마진 벡터를 이용한 앙상블 SVM의 학습)

  • Park, Sang-Ho;Kim, Tae-Soon;Park, Sun;Kang, Yun-Hee;Lee, Ju-Hong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11a
    • /
    • pp.301-304
    • /
    • 2003
  • SVM은 일반화된 높은 분류 정확률을 보인다. 그러나, SVM은 데이터의 양이 커질수록 높은 시간 공간적 복잡성 때문에 근사화 알고리즘(Approximation Algorithm)을 이용한다. 이러한 접근 방법은 실제구현에서 높은 시간 공간적 복잡성을 요구하여 분류 정확률과 효율성을 낮아지게 한다. 따라서, 본 논문은 SVM을 앙상블 구조로 구성하여 분류 정확률을 높이고, 분류자의 최적 하이퍼플랜(Optimal Hyperplane)결정을 위해 마진 벡터만을 이용하여 시간 공간적 문제를 해결하였다. 실험결과, 본 논문에서 제시한 방법이 단일 SVM을 이용한 방법보다 높은 분류 정확률과 높은 효율성을 가짐을 보여준다...

  • PDF

Voice Classification Algorithm for Sasang Constitution Using Support Vector Machine (SVM을 이용한 음성 사상체질 분류 알고리즘)

  • Kang, Jae-Hwan;Do, Jun-Hyeong;Kim, Jong-Yeol
    • Journal of Sasang Constitutional Medicine
    • /
    • v.22 no.1
    • /
    • pp.17-25
    • /
    • 2010
  • 1. Objectives: Voice diagnosis has been used to classify individuals into the Sasang constitution in SCM(Sasang Constitution Medicine) and to recognize his/her health condition in TKM(Traditional Korean Medicine). In this paper, we purposed a new speech classification algorithm for Sasang constitution. 2. Methods: This algorithm is based on the SVM(Support Vector Machine) technique, which is a classification method to classify two distinct groups by finding voluntary nonlinear boundary in vector space. It showed high performance in classification with a few numbers of trained data set. We designed for this algorithm using 3 SVM classifiers to classify into 4 groups, which are composed of 3 constitutional groups and additional indecision group. 3. Results: For the optimal performance, we found that 32.2% of the voice data were classified into three constitutional groups and 79.8% out of them were grouped correctly. 4. Conclusions: This new classification method including indecision group appears efficient compared to the standard classification algorithm which classifies only into 3 constitutional groups. We find that more thorough investigation on the voice features is required to improve the classification efficiency into Sasang constitution.

Study on gesture recognition based on IIDTW algorithm

  • Tian, Pei;Chen, Guozhen;Li, Nianfeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.6063-6079
    • /
    • 2019
  • When the length of sampling data sequence is too large, the method of gesture recognition based on traditional Dynamic Time Warping (DTW) algorithm will lead to too long calculation time, and the accuracy of recognition result is not high.Support vector machine (SVM) has some shortcomings in precision, Edit Distance on Real Sequences(EDR) algorithm does not guarantee that noise suppression will not suppress effective data.A new method based on Improved Interpolation Dynamic Time Warping (IIDTW)algorithm is proposed to improve the efficiency of gesture recognition and the accuracy of gesture recognition. The results show that the computational efficiency of IIDTW algorithm is more than twice that of SVM-DTW algorithm, the error acceptance rate is FAR reduced by 0.01%, and the error rejection rate FRR is reduced by 0.5%.Gesture recognition based on IIDTW algorithm can achieve better recognition status. If it is applied to unlock mobile phone, it is expected to become a new generation of unlock mode.

Fuzzy One Class Support Vector Machine (퍼지 원 클래스 서포트 벡터 머신)

  • Kim, Ki-Joo;Choi, Young-Sik
    • Journal of Internet Computing and Services
    • /
    • v.6 no.3
    • /
    • pp.159-170
    • /
    • 2005
  • OC-SVM(One Class Support Vector Machine) avoids solving a full density estimation problem, and instead focuses on a simpler task, estimating quantiles of a data distribution, i.e. its support. OC-SVM seeks to estimate regions where most of data resides and represents the regions as a function of the support vectors, Although OC-SVM is powerful method for data description, it is difficult to incorporate human subjective importance into its estimation process, In order to integrate the importance of each point into the OC-SVM process, we propose a fuzzy version of OC-SVM. In FOC-SVM (Fuzzy One-Class Support Vector Machine), we do not equally treat data points and instead weight data points according to the importance measure of the corresponding objects. That is, we scale the kernel feature vector according to the importance measure of the object so that a kernel feature vector of a less important object should contribute less to the detection process of OC-SVM. We demonstrate the performance of our algorithm on several synthesized data sets, Experimental results showed the promising results.

  • PDF

A divide-oversampling and conquer algorithm based support vector machine for massive and highly imbalanced data (불균형의 대용량 범주형 자료에 대한 분할-과대추출 정복 서포트 벡터 머신)

  • Bang, Sungwan;Kim, Jaeoh
    • The Korean Journal of Applied Statistics
    • /
    • v.35 no.2
    • /
    • pp.177-188
    • /
    • 2022
  • The support vector machine (SVM) has been successfully applied to various classification areas with a high level of classification accuracy. However, it is infeasible to use the SVM in analyzing massive data because of its significant computational problems. When analyzing imbalanced data with different class sizes, furthermore, the classification accuracy of SVM in minority class may drop significantly because its classifier could be biased toward the majority class. To overcome such a problem, we propose the DOC-SVM method, which uses divide-oversampling and conquers techniques. The proposed DOC-SVM divides the majority class into a few subsets and applies an oversampling technique to the minority class in order to produce the balanced subsets. And then the DOC-SVM obtains the final classifier by aggregating all SVM classifiers obtained from the balanced subsets. Simulation studies are presented to demonstrate the satisfactory performance of the proposed method.

Applicability study on urban flooding risk criteria estimation algorithm using cross-validation and SVM (교차검증과 SVM을 이용한 도시침수 위험기준 추정 알고리즘 적용성 검토)

  • Lee, Hanseung;Cho, Jaewoong;Kang, Hoseon;Hwang, Jeonggeun
    • Journal of Korea Water Resources Association
    • /
    • v.52 no.12
    • /
    • pp.963-973
    • /
    • 2019
  • This study reviews a urban flooding risk criteria estimation model to predict risk criteria in areas where flood risk criteria are not precalculated by using watershed characteristic data and limit rainfall based on damage history. The risk criteria estimation model was designed using Support Vector Machine, one of the machine learning algorithms. The learning data consisted of regional limit rainfall and watershed characteristic. The learning data were applied to the SVM algorithm after normalization. We calculated the mean absolute error and standard deviation using Leave-One-Out and K-fold cross-validation algorithms and evaluated the performance of the model. In Leave-One-Out, models with small standard deviation were selected as the optimal model, and models with less folds were selected in the K-fold. The average accuracy of the selected models by rainfall duration is over 80%, suggesting that SVM can be used to estimate flooding risk criteria.