Comparison between support vector machine and fuzzy Kernel C-Means as classifiers for intrusion detection system using chi-square feature selection

<span id="docs-internal-guid-94842888-7fff-2ae1-cd5c-026943b95b7f"><span>Cancer is one of the diseases with the highest mortality rate in the world. Cancer is a disease when abnormal cells grow out of control that can attack the body's organs side by side or spread to other organs. Lung cancer is a condition when malignant cells form in the lungs. To diagnose lung cancer can be done by taking x-ray images, CT scans, and lung tissue biopsy. In this modern era, technology is expected to help research in the field of health. Therefore, in this study feature extraction from CT images was used as data to classify lung cancer. We used CT scan image data from SPIE-AAPM Lung CT challenge 2015. Fuzzy C-Means and fuzzy kernel C-Means were used to classify the lung nodule from the patient into benign or malignant. Fuzzy C-Means is a soft clustering method that uses Euclidean distance to calculate the cluster center and membership matrix. Whereas fuzzy kernel C-Means uses kernel distance to calculate it. In addition, the support vector machine was used in another study to obtain 72% average AUC. Simulations were performed using different k-folds. The score showed fuzzy kernel C-Means had the highest accuracy of 74%, while fuzzy C-Means obtained 73% accuracy. </span></span>

Improvement of attack detection performance on the internet of things with PSO-search and random forest

Considering current network scenario hackers and intruders has become a big threat today. As new technologies are emerging fast, extensive use of these technologies and computers, what plays an important role is security. Most of the computers in network can be easily compromised with attacks. Big issue of concern is increase in new type of attack these days. Security to the sensitive data is very big threat to deal with, it need to consider as high priority issue which should be addressed immediately. Highly efficient Intrusion Detection Systems (IDS) are available now a days which detects various types of attacks on network. But we require the IDS which is intelligent enough to detect and analyze all type of new threats on the network. Maximum accuracy is expected by any of this intelligent intrusion detection system. An Intrusion Detection System can be hardware or software that analyze and monitors all activities of network to detect malicious activities happened inside the network. It also informs and helps administrator to deal with malicious packets, which if enters in network can harm more number of computers connected together. In our work we have implemented an intellectual IDS which helps administrator to analyze real time network traffic. IDS does it by classifying packets entering into the system as normal or malicious. This paper mainly focus on techniques used for feature selection to reduce number of features from KDD-99 dataset. This paper also explains algorithm used for classification i.e., Random Forest which works with forest of trees to classify real time packet as normal or malicious. Random forest makes use of ensembling techniques to give final output which is derived by combining output from number of trees used to create forest. Dataset which is used while performing experiments is KDD-99. This dataset is used to train all trees to get more accuracy with help of random forest. From results achieved we can observe that random forest algorithm gives more accuracy in distributed network with reduced false alarm rate.

The network security is getting more important due to the wide-spread computer viruses and increasing network attacks. Nowadays, more and more security mechanisms, such as firewalls and intrusion detection systems (IDS), are introduced to protect the network from malicious attacks. This paper proposes an agent and service based intrusion detection and response system for active network. In contrast to a traditional passive network, an active network gives the nodes programmable ability to exercise various active network technologies. The intrusion response, service deployment, and service update mechanisms are centered on this technology. The proposed model of intrusion detection and response system (IDRS) catches network attacks and responses to stop the attacks at the first time to reduce the damage. Detecting, reporting, and responding capabilities are all embedded and integrated in the proposed system. A prototype system is developed using a novel data mining technology (the support vector machine) to enhance the detection function. In addition, several experiments were conducted to verify the system and results showed that the system was able to effectively identify the intrusions and respond promptly. Experiments also showed that the support vector machine outperforms the competitive neural networks in identifying the intrusions.

Intrusion detection system (IDS) using machine learning approach is getting popularity as it has an advantage of getting updated by itself to defend against any new type of attack. Another emerging technology, called internet of things (IoT) is taking the responsibility to make automated system by communicating the devices without human intervention. In IoT based systems, the wireless communication between several devices through the internet causes vulnerability for different security threats. This paper proposes a novel unified intrusion detection system for IoT environment (UIDS) to defend the network from four types of attacks such as: exploit, DoS, probe, and generic. The system is also able to detect normal category of network traffic. Most of the related works on IDS are based on KDD99 or NSL-KDD 99 data sets which are unable to detect new type of attacks. In this paper, UNSW-NB15 data set is considered as the benchmark dataset to design UIDS for detecting malicious activities in the network. The performance analysis proves that the attack detection rate of the proposed model is higher compared to two existing approaches ENADS and DENDRON which also worked on UNSW-NB15 data set.

In order to develop Human-centric Driver Fatigue Monitoring Systems (HDFMS) with aims to increase driving safety, an efficient combined features extraction from Curvelet transform and Gabor wavelet transform for fatigue expressions descriptions of vehicle drivers is proposed, and Random Subspace Ensemble (RSE) of Support Vector Machines (SVMs) with polynomial kernel as the base classifier is then exploited for classification of three predefined fatigue expressions classes, namely, awake expressions, moderate fatigue expressions, and severe fatigue expressions. The results of holdout and cross-validation experiments show that CF by RSE of SVMs with polynomial kernel outperforms other seven classifiers, i.e., Curvelet features by SVMs classifier, Gabor features by SVMs classifier, CF by five individual SVMs classifiers. With CF and RSE of SVMs with polynomial kernel, the classification accuracies of drivers' fatigue expressions are over 90% in both of the holdout and cross-validation experiments, which show the proposed approach of combined features extraction and RSE of SVMs can be used for developing Human-centric Driver Fatigue Monitoring Systems to increase driving safety.

The increasing need of a handwritten character recognition system in the Indian offices such as banks, post offices and so forth, has made it an imperative field of research. In present paper, Authors have presented a novel hierarchical technique for isolated offline handwritten Gurmukhi character recognition. A robust feature set of 105 feature elements is proposed under this work for recognition of offline handwritten Gurmukhi characters using four types of topological features, namely, horizontally peak extent features, vertically peak extent features, diagonal features, and centroid features. For classification Support Vector Machines (SVMs) classifier has been used in this work. SVMs classifier has been considered with four different kernels, namely, linear kernel, polynomial kernel, RBF kernel and sigmoid kernel. For training and testing of a classifier, we have used 3,500 samples of isolated offline handwritten Gurmukhi characters written by one hundred different writers. Maximum recognition accuracy of 91.80 % have been achieved with proposed technique, while using PCA feature set and SVM with a linear kernel classifier.

Human ovarian tissue features extracted from photoacoustic spectra data, beam envelopes and co-registered ultrasound and photoacoustic images are used to characterize cancerous vs. normal processes using a support vector machine (SVM) classifier. The centers of suspicious tumor areas are estimated from the Gaussian fitting of the mean Radon transforms of the photoacoustic image along 0 and 90 degrees. Normalized power spectra are calculated using the Fourier transform of the photoacoustic beamformed data across these suspicious areas, where the spectral slope and 0-MHz intercepts are extracted. Image statistics, envelope histogram fitting and maximum output of 6 composite filters of cancerous or normal patterns along with other previously used features are calculated to compose a total of 17 features. These features are extracted from 169 datasets of 19 ex vivo ovaries. Half of the cancerous and normal datasets are randomly chosen to train a SVM classifier with polynomial kernel and the remainder is used for testing. With 50 times data resampling, the SVM classifier, for the training group, gives 100% sensitivity and 100% specificity. For the testing group, it gives 89.68± 6.37% sensitivity and 93.16± 3.70% specificity. These results are superior to those obtained earlier by our group using features extracted from photoacoustic raw data or image statistics only.

Aim at the problem of small targets detection in complex infrared background, a method based on the kernel fuzzy clustering and least squares support vector machine (LS-SVM) background predication is proposed. First, partition the training samples by a nearest-neighbor clustering method to get the clustering number and the initial clustering centers. These clustering centers are further processed using kernel fuzzy C-means (KFCM) method. Then, the tuning parameters of the fuzzy model are estimated by LS-SVM. Further these tuning parameters are used to predict the background of infrared images. The prediction image subtracted from the source infrared image gives the residual image. Finally, a threshold selection method based on recursive maximum between-cluster absolute difference is presented to separate the real small target from the residual image. Experimental results are given and they are compared with the results of fuzzy C-means (FCM) detection method. They show that the proposed method has better detection performance.

Fuzzy c-means(FCM)는 퍼지 집합을 응용한 간단하지만 효율적인 클러스터링 방법 중 하나이다. FCM은 여러 응용 분야에서 성공적으로 활용되어 왔지만, 초기화와 잡음에 민감하고 볼록한 형태의 클러스터들만 다룰 수 있는 문제점이 있다. 이 논문에서는 이러한 FCM의 문제점을 해결하기 위해 전역 클러스터링(global clustering) 기법과 커널 클러스터링(kernel clustering) 기법을 결합하여 새로운 비선형 클러스터링 기법인 커널 전역 FCM(kernel global fuzzy c-means, KG-FCM)을 제안한다. 전역 클러스터링은 클러스터링의 초기화를 위한 방법 중 하나로, 순차적으로 클러스터를 하나씩 추가함으로써 초기화에 민감한 FCM의 한계를 극복할 수 있도록 해준다. FCM의 잡음 민감성과 볼록한 클러스터들만 다룰 수 있는 한계를 극복하기 위한 방법은 여러 가지가 있으며 커널 클러스터링이 그 중 하나이다. 커널 클러스터링은 사용하는 커널을 바꿈으로써 쉽게 확장이 가능하므로 이 논문에서는 커널 클러스터링을 사용하였다. 두 방법을 결합함으로써 제안한 방법은 위에서 언급한 문제점들을 해결할 수 있으며, 이는 가상 및 실제 데이터를 이용한 실험 결과를 통해 확인할 수 있다. Fuzzy c-means (FCM) is a simple but efficient clustering algorithm using the concept of a fuzzy set that has been proved to be useful in many areas. There are, however, several well known problems with FCM, such as sensitivity to initialization, sensitivity to outliers, and limitation to convex clusters. In this paper, global fuzzy c-means (G-FCM) and kernel fuzzy c-means (K-FCM) are combined to form a non-linear variant of G-FCM, called kernel global fuzzy c-means (KG-FCM). G-FCM is a variant of FCM that uses an incremental seed selection method and is effective in alleviating sensitivity to initialization. There are several approaches to reduce the influence of noise and accommodate non-convex clusters, and K-FCM is one of them. K-FCM is used in this paper because it can easily be extended with different kernels. By combining G-FCM and K-FCM, KG-FCM can resolve the shortcomings mentioned above. The usefulness of the proposed method is demonstrated by experiments using artificial and real world data sets.

Deep neural networks (DNN) are highly effective in a number of tasks related to machine learning across different domains. It is quite challenging to apply the information gained to textual data because of its graph representation structure. This article applies innovative graph structures and protection techniques to secure wireless systems and mobile computing applications. We develop an Intrusion Detection System (IDS) with DNN and Support Vector Machine (SVM) to identify adversarial inversion attacks in the network system. It employs both normal and abnormal adversaries. It constantly generates signatures, creates attack signatures, and refreshes the IDS signature repository. In conclusion, the assessment indicators, including latency rates and throughput, are used to evaluate the effectiveness and efficiency of the recommended framework with Random Forest. The results of the proposed model (SVM with DNN) based on adversarial inversion attacks were better and more efficient than traditional models, with a detection rate of 93.67% and 95.34% concerning latency rate and throughput. This article also compares the proposed model (SVM with DNN) accuracy with other classifiers and the accuracy comparison for feature datasets of 90.3% and 90%, respectively.

The problem with development of the support vector machine (SVM) classifiers using modified particle swarm optimization (PSO) algorithm and their ensembles has been considered. Solving this problem would allow fulfilling the high-precision data classification, especially Big Data classification, with the acceptable time expenditures. The modified PSO algorithm conducts a simultaneous search of the type of kernel functions, the parameters of the kernel function and the value of the regularization parameter for the SVM classifier. The idea of particles' «regeneration» served as the basis for the modified PSO algorithm. In the implementation of this algorithm, some particles change the type of their kernel function to the one which corresponds to the particle with the best value of the classification accuracy. The offered PSO algorithm allows reducing the time expenditures for the developed SVM classifiers, which is very important for Big Data classification problem. In most cases such SVM classifier provides the high quality of data classification. In exceptional cases the SVM ensembles based on the decorrelation maximization algorithm for the different strategies of the decision-making on the data classification and the majority vote rule can be used. Also, the two-level SVM classifier has been offered. This classifier works as the group of the SVM classifiers at the first level and as the SVM classifier on the base of the modified PSO algorithm at the second level. The results of experimental studies confirm the efficiency of the offered approaches for Big Data classification.

In this paper, we introduce improved segmentation method for segmenting breast MRI images using Kernelized Fuzzy C-Means and Support Vector Machine. Firstly, the new modified Kernelized FCM is constructed in this paper with inclusion of spatial neighborhood term. Then, the data are labeled by new FCM and the input vector for SVM classifier is generated by membership function of proposed new FCM. The robust SVM is proposed for providing effective segmentation result. In both KFCM and SVM, to enlighten the performance of dealing non linearity, the new Quadratic kernel function is used. In order to show the effectiveness of the proposed method, the experimental work is executed on artificially generated random data, and real dynamic contrast enhanced breast MRIs. The superiority of proposed method is proven by comparative analysis of result of proposed and existed methods. To work up the comparative analysis, Fuzzy Partition coefficient, Fuzzy Entropy and Silhouette method are utilized as a cluster validity measure in this paper. Finally, the experimental study shows our proposed method is promising method for segmenting medical images and complex data analysis.

As the reliance on digital networks grows, the need for robust security measures becomes paramount. It offers a thorough analysis of creating and assessing a Network Intrusion Detection System (NIDS) incorporating various machine learning algorithms. The selected algorithms consist of K Nearest Neighbour, Naïve Bayes, Decision Tree, Support Vector Machine, and Logistic Regression. Moreover, widely recognised ensemble learning models like CatBoost, AdaBoost, Gradient Boost, Random Forest, and Extreme Gradient Boost. The core objective is to improve the efficiency of intrusion detection by evaluating various machine-learning models. Utilizes feature selection techniques based on chi-square to enhance the relevance and effectiveness of the selected features. The evaluation metrics, particularly Matthews’ Correlation Coefficient (MCC) and ROC Curves, are used in assessing the models’ efficacy. They offer valuable insights into the models’ capability to differentiate between normal and malicious network activities. This study aims to advance cybersecurity by comparing classical machine learning and ensemble models for network intrusion detection. Significantly, our results underscore XGBoost’s effectiveness with 0.996 accuracy and 0.993 MCC, in enhancing digital network security.

In order to improve the performance of Support Vector Machine (SVM) classifier for imbalanced data, this paper proposes dynamic cost-sensitive SVM classifier based on chaos particle swarm optimization (CPDC_SVM). Firstly, this paper introduces dynamic cost-sensitive thought to SVM classifier, and gives the method for structuring dynamic cost and cost-sensitive SVM model. Secondly, we propose the evaluation methodology performance for classifier, and adopts decimal base to code the particles. At last, chaos thought is introduced in particle swarm optimization algorithm, and the Algorithm of the dynamic cost-sensitive SVM classifier is given, which improves convergent speed and accuracy of particle swarm optimization, and can optimize dynamic cost-sensitive SVM well, so CPDC_SVM adds effectively the convergence speed and accuracy for the particle swarm optimization algorithm. Experimental results show CPDC_SVM has higher precision than traditional SVM classifier, and dynamic cost and chaos particle swarm optimization can improve the performance for classifier.