scholarly journals An Approach Based on the Improved SVM Algorithm for Identifying Malware in Network Traffic

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Bo Liu ◽  
Jinfu Chen ◽  
Songling Qin ◽  
Zufa Zhang ◽  
Yisong Liu ◽  
...  
Keyword(s):  
Network Traffic ◽  
Cyber Security ◽  
False Positive ◽  
False Positive Rate ◽  
Support Vector ◽  
Traffic Classification ◽  
Svm Algorithm ◽  
Network Traffic Classification ◽  
Positive Rate ◽  
Function Selection

Due to the growth and popularity of the internet, cyber security remains, and will continue, to be an important issue. There are many network traffic classification methods or malware identification approaches that have been proposed to solve this problem. However, the existing methods are not well suited to help security experts effectively solve this challenge due to their low accuracy and high false positive rate. To this end, we employ a machine learning-based classification approach to identify malware. The approach extracts features from network traffic and reduces the dimensionality of the features, which can effectively improve the accuracy of identification. Furthermore, we propose an improved SVM algorithm for classifying the network traffic dubbed Optimized Facile Support Vector Machine (OFSVM). The OFSVM algorithm solves the problem that the original SVM algorithm is not satisfactory for classification from two aspects, i.e., parameter optimization and kernel function selection. Therefore, in this paper, we present an approach for identifying malware in network traffic, called Network Traffic Malware Identification (NTMI). To evaluate the effectiveness of the NTMI approach proposed in this paper, we collect four real network traffic datasets and use a publicly available dataset CAIDA for our experiments. Evaluation results suggest that the NTMI approach can lead to higher accuracy while achieving a lower false positive rate compared with other identification methods. On average, the NTMI approach achieves an accuracy of 92.5% and a false positive rate of 5.527%.

Deep-learning and radiomics ensemble classifier for false positive reduction in brain metastases segmentation

2021 ◽  
Author(s):  
Zi Yang ◽  
Mingli Chen ◽  
Mahdieh Kazemimoghadam ◽  
Lin Ma ◽  
Strahinja Stojadinovic ◽  
...  
Keyword(s):  
Deep Learning ◽  
Brain Metastases ◽  
False Positive ◽  
False Positive Rate ◽  
Ensemble Classifier ◽  
Support Vector ◽  
Svm Classifier ◽  
Siamese Network ◽  
Proposed Model ◽  
Positive Rate

Abstract Stereotactic radiosurgery (SRS) is now the standard of care for brain metastases (BMs) patients. The SRS treatment planning process requires precise target delineation, which in clinical workflow for patients with multiple (>4) BMs (mBMs) could become a pronounced time bottleneck. Our group has developed an automated BMs segmentation platform to assist in this process. The accuracy of the auto-segmentation, however, is influenced by the presence of false-positive segmentations, mainly caused by the injected contrast during MRI acquisition. To address this problem and further improve the segmentation performance, a deep-learning and radiomics ensemble classifier was developed to reduce the false-positive rate in segmentations. The proposed model consists of a Siamese network and a radiomic-based support vector machine (SVM) classifier. The 2D-based Siamese network contains a pair of parallel feature extractors with shared weights followed by a single classifier. This architecture is designed to identify the inter-class difference. On the other hand, the SVM model takes the radiomic features extracted from 3D segmentation volumes as the input for twofold classification, either a false-positive segmentation or a true BM. Lastly, the outputs from both models create an ensemble to generate the final label. The performance of the proposed model in the segmented mBMs testing dataset reached the accuracy (ACC), sensitivity (SEN), specificity (SPE) and area under the curve (AUC) of 0.91, 0.96, 0.90 and 0.93, respectively. After integrating the proposed model into the original segmentation platform, the average segmentation false negative rate (FNR) and the false positive over the union (FPoU) were 0.13 and 0.09, respectively, which preserved the initial FNR (0.07) and significantly improved the FPoU (0.55). The proposed method effectively reduced the false-positive rate in the BMs raw segmentations indicating that the integration of the proposed ensemble classifier into the BMs segmentation platform provides a beneficial tool for mBMs SRS management.

scholarly journals An Improved Network Traffic Classification Model Based on a Support Vector Machine

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 301 ◽  
Author(s):  
Jie Cao ◽  
Da Wang ◽  
Zhaoyang Qu ◽  
Hongyu Sun ◽  
Bin Li ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Network Traffic ◽  
Feature Selection Method ◽  
Selection Method ◽  
Classification Model ◽  
Support Vector ◽  
Traffic Classification ◽  
Generalization Ability ◽  
Network Traffic Classification

Network traffic classification based on machine learning is an important branch of pattern recognition in computer science. It is a key technology for dynamic intelligent network management and enhanced network controllability. However, the traffic classification methods still facing severe challenges: The optimal set of features is difficult to determine. The classification method is highly dependent on the effective characteristic combination. Meanwhile, it is also important to balance the experience risk and generalization ability of the classifier. In this paper, an improved network traffic classification model based on a support vector machine is proposed. First, a filter-wrapper hybrid feature selection method is proposed to solve the false deletion of combined features caused by a traditional feature selection method. Second, to balance the empirical risk and generalization ability of support vector machine (SVM) traffic classification model, an improved parameter optimization algorithm is proposed. The algorithm can dynamically adjust the quadratic search area, reduce the density of quadratic mesh generation, improve the search efficiency of the algorithm, and prevent the over-fitting while optimizing the parameters. The experiments show that the improved traffic classification model achieves higher classification accuracy, lower dimension and shorter elapsed time and performs significantly better than traditional SVM and the other three typical supervised ML algorithms.

scholarly journals An Automatic Traffic Sign Detection and Recognition System Based on Colour Segmentation, Shape Matching, and SVM

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Safat B. Wali ◽  
Mahammad A. Hannan ◽  
Aini Hussain ◽  
Salina A. Samad
Keyword(s):  
False Positive ◽  
Shape Matching ◽  
False Positive Rate ◽  
System Stability ◽  
Computational Time ◽  
Support Vector ◽  
Traffic Signs ◽  
Positive Rate ◽  
Colour Segmentation ◽  
Detection And Recognition

The main objective of this study is to develop an efficient TSDR system which contains an enriched dataset of Malaysian traffic signs. The developed technique is invariant in variable lighting, rotation, translation, and viewing angle and has a low computational time with low false positive rate. The development of the system has three working stages: image preprocessing, detection, and recognition. The system demonstration using a RGB colour segmentation and shape matching followed by support vector machine (SVM) classifier led to promising results with respect to the accuracy of 95.71%, false positive rate (0.9%), and processing time (0.43 s). The area under the receiver operating characteristic (ROC) curves was introduced to statistically evaluate the recognition performance. The accuracy of the developed system is relatively high and the computational time is relatively low which will be helpful for classifying traffic signs especially on high ways around Malaysia. The low false positive rate will increase the system stability and reliability on real-time application.

scholarly journals CarSite-II: an integrated classification algorithm for identifying carbonylated sites based on K-means similarity-based undersampling and synthetic minority oversampling techniques

2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Yun Zuo ◽  
Jianyuan Lin ◽  
Xiangxiang Zeng ◽  
Quan Zou ◽  
Xiangrong Liu
Keyword(s):  
Reactive Oxygen Species ◽  
False Positive ◽  
False Positive Rate ◽  
False Negative ◽  
False Negative Rate ◽  
Reactive Oxygen ◽  
Support Vector ◽  
Oxygen Species ◽  
Negative Rate ◽  
Positive Rate

Abstract Background Carbonylation is a non-enzymatic irreversible protein post-translational modification, and refers to the side chain of amino acid residues being attacked by reactive oxygen species and finally converted into carbonyl products. Studies have shown that protein carbonylation caused by reactive oxygen species is involved in the etiology and pathophysiological processes of aging, neurodegenerative diseases, inflammation, diabetes, amyotrophic lateral sclerosis, Huntington’s disease, and tumor. Current experimental approaches used to predict carbonylation sites are expensive, time-consuming, and limited in protein processing abilities. Computational prediction of the carbonylation residue location in protein post-translational modifications enhances the functional characterization of proteins. Results In this study, an integrated classifier algorithm, CarSite-II, was developed to identify K, P, R, and T carbonylated sites. The resampling method K-means similarity-based undersampling and the synthetic minority oversampling technique (SMOTE-KSU) were incorporated to balance the proportions of K, P, R, and T carbonylated training samples. Next, the integrated classifier system Rotation Forest uses “support vector machine” subclassifications to divide three types of feature spaces into several subsets. CarSite-II gained Matthew’s correlation coefficient (MCC) values of 0.2287/0.3125/0.2787/0.2814, False Positive rate values of 0.2628/0.1084/0.1383/0.1313, False Negative rate values of 0.2252/0.0205/0.0976/0.0608 for K/P/R/T carbonylation sites by tenfold cross-validation, respectively. On our independent test dataset, CarSite-II yield MCC values of 0.6358/0.2910/0.4629/0.3685, False Positive rate values of 0.0165/0.0203/0.0188/0.0094, False Negative rate values of 0.1026/0.1875/0.2037/0.3333 for K/P/R/T carbonylation sites. The results show that CarSite-II achieves remarkably better performance than all currently available prediction tools. Conclusion The related results revealed that CarSite-II achieved better performance than the currently available five programs, and revealed the usefulness of the SMOTE-KSU resampling approach and integration algorithm. For the convenience of experimental scientists, the web tool of CarSite-II is available in http://47.100.136.41:8081/

scholarly journals Searching for optimal machine learning algorithm for network traffic classification in intrusion detection system

2018 ◽  
Vol 21 ◽  
pp. 00027
Author(s):  
Alicja Gerka
Keyword(s):  
Machine Learning ◽  
Intrusion Detection ◽  
Network Traffic ◽  
Detection System ◽  
Learning Algorithms ◽  
Attack Detection ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Traffic Classification ◽  
Network Traffic Classification

The main problem associated with the development of an effective network behaviour anomaly detection-based IDS model is the selection of the optimal network traffic classification method. This article presents the results of simulation research on the effectiveness of the use of machine learning algorithms in the network attacks detection. The research part of the work concerned finding the optimal method of network packets classification possible to implement in the intrusion detection system’s attack detection module. During the research, the performance of three machine learning algorithms (Artificial Neural Network, Support Vector Machine and Naïve Bayes Classifier) has been compared using a dataset from the KDD Cup competition. Attention was also paid to the relationship between the values of algorithm parameters and their effectiveness. The work also contains an short analysis of the state of cybersecurity in Poland.

scholarly journals Deteksi Pemain Basket Terklasifikasi Berbasis Histogram of Oriented Gradients

Jurnal INFORM ◽  
2018 ◽  
Vol 3 (1) ◽  
pp. 6-11
Author(s):  
Nisa ul Hafidhoh ◽  
Septian Enggar Sukmana
Keyword(s):  
Support Vector Machine ◽  
False Positive ◽  
False Positive Rate ◽  
True Positive Rate ◽  
Support Vector ◽  
Histogram Of Oriented Gradients ◽  
True Positive ◽  
Positive Rate

Pada olahraga basket jaman modern ini, kebutuhan analisis pergerakan pemain pada calon tim lawan olahraga basket perlu didukung oleh teknologi informasi yang mampu mengupayakan sistem yang otomatis. Analisis pergerakan pemain yang otomatis perlu didukung oleh sistem deteksi pemain yang handal dan akurat sehingga pemetaan pergerakan dapat dilakukan secara optimal. Tujuan dari penelitian ini adalah untuk mengembangkan metode Histogram of Oriented Gradients (HOG) menjadi sebuah metode deteksi yang handal untuk kasus deteksi pemain basket pada media. Tantangan pada penelitian ini adalah deteksi pemain tidak hanya pada saat berjalan dan berlari namun juga pada saat melompat. Untuk memperkuat fokus dan konsistensi terhadap objek yang terdeteksi, pemanfaatan metode klasifikasi Support Vector Machine (SVM) digunakan melalui kolaborasi terhadap HOG descriptor serta warna kostum pemain sehingga pembeda tim dari masing-masing pemain juga dapat dikenali. Tingkat akurasi dari evaluasi yang dihasilkan adalah 92% untuk true positive rate dan 40% untuk false positive rate.

Sign in / Sign up

Export Citation Format

Share Document