A Kind of Network Intrusion Detection Algorithm Based on Quantum-behaved Particle Swarm Optimization

In order to overcomes the drawbacks of fuzzy clustering methods which are sensitive to the initial values and easily trapped into local minima in intrusion detection algorithm, a hybrid algorithm is proposed based on quantum-behaved particle swarm optimization and semi-supervised kernel fuzzy clustering algorithm. This algorithm can supervise and clustering a few labeled data to generate correct model, use this model to guide lots of unlabeled data to clustering, and enlarge the labeled data set. Those data still cannot be labeled, which are clustered by the kernel fuzzy methods based on quantum-behaved particle swarm optimization, and determine mark types. The simulation of KDD CUP 99 data set is implemented to evaluate the proposed algorithm. Comparing to other algorithms, the result shows the proposed algorithm can obtain the ideal error detection rate and false drop rate in the intrusion detection

Chaotic Quantum Double Delta Swarm Algorithm using Chebyshev Maps: Theoretical Foundations, Performance Analyses and Convergence Issues

Quantum Double Delta Swarm (QDDS) Algorithm is a new metaheuristic algorithm inspired by the convergence mechanism to the center of potential generated within a single well of a spatially co-located double-delta well setup. It mimics the wave nature of candidate positions in solution spaces and draws upon quantum mechanical interpretations much like other quantum-inspired computational intelligence paradigms. In this work, we introduce a Chebyshev map driven chaotic perturbation in the optimization phase of the algorithm to diversify weights placed on contemporary and historical, socially-optimal agents' solutions. We follow this up with a characterization of solution quality on a suite of 23 single-objective functions and carry out a comparative analysis with eight other related nature-inspired approaches. By comparing solution quality and successful runs over dynamic solution ranges, insights about the nature of convergence are obtained. A two-tailed t-test establishes the statistical significance of the solution data whereas Cohen's d and Hedge's g values provide a measure of effect sizes. We trace the trajectory of the fittest pseudo-agent over all function evaluations to comment on the dynamics of the system and prove that the proposed algorithm is theoretically globally convergent under the assumptions adopted for proofs of other closely-related random search algorithms.Comment: 27 pages, 4 figures, 19 table

d-QPSO: A Quantum-Behaved Particle Swarm Technique for Finding D-Optimal Designs With Discrete and Continuous Factors and a Binary Response

Identifying optimal designs for generalized linear models with a binary response can be a challengingtask, especially when there are both discrete and continuous independent factors in the model. Theoreticalresults rarely exist for such models, and for the handful that do, they usually come with restrictive assumptions.In this article, we propose the d-QPSO algorithm, a modified version of quantum-behaved particleswarm optimization, to find a variety of D-optimal approximate and exact designs for experiments withdiscrete and continuous factors and a binary response. We show that the d-QPSO algorithm can efficientlyfind locally D-optimal designs even for experiments with a large number of factors and robust pseudo-Bayesian designs when nominal values for the model parameters are not available. Additionally, we investigaterobustness properties of the d-QPSO algorithm-generated designs to variousmodel assumptions andprovide real applications to design a bio-plastics odor removal experiment, an electronic static experiment,and a 10-factor car refueling experiment. Supplementary materials for the article are available online

Prediction of progression in idiopathic pulmonary fibrosis using CT scans atbaseline: A quantum particle swarm optimization - Random forest approach

Idiopathic pulmonary fibrosis (IPF) is a fatal lung disease characterized by an unpredictable progressive declinein lung function. Natural history of IPF is unknown and the prediction of disease progression at the time ofdiagnosis is notoriously difficult. High resolution computed tomography (HRCT) has been used for the diagnosisof IPF, but not generally for monitoring purpose. The objective of this work is to develop a novel predictivemodel for the radiological progression pattern at voxel-wise level using only baseline HRCT scans. Mainly, thereare two challenges: (a) obtaining a data set of features for region of interest (ROI) on baseline HRCT scans andtheir follow-up status; and (b) simultaneously selecting important features from high-dimensional space, andoptimizing the prediction performance. We resolved the first challenge by implementing a study design andhaving an expert radiologist contour ROIs at baseline scans, depending on its progression status in follow-upvisits. For the second challenge, we integrated the feature selection with prediction by developing an algorithmusing a wrapper method that combines quantum particle swarm optimization to select a small number of featureswith random forest to classify early patterns of progression. We applied our proposed algorithm to analyzeanonymized HRCT images from 50 IPF subjects from a multi-center clinical trial. We showed that it yields aparsimonious model with 81.8% sensitivity, 82.2% specificity and an overall accuracy rate of 82.1% at the ROIlevel. These results are superior to other popular feature selections and classification methods, in that ourmethod produces higher accuracy in prediction of progression and more balanced sensitivity and specificity witha smaller number of selected features. Our work is the first approach to show that it is possible to use onlybaseline HRCT scans to predict progressive ROIs at 6 months to 1year follow-ups using artificial intelligence

Presenting a New Strategy to Extract Data Clustering Heartbeat Samples by Using Discrete Wavelet Transform

This paper presents the improvement of detection system that normal and arrhythmia electrocardiogram classification. This classification is done to aid the ANFIS (Adaptive Neuro Fuzzy Inference System). The data used in this paper obtained from MIT-BIH normal sinus ECG database signal and MIT-BIH arrhythmia database signal. The main goal of our approach is to create an interpretable classifier that provides an acceptable accuracy. In this model, the feature extraction using DWT (Discrete Wavelet Transform) is obtained. The last stage of this extraction is introduced as the input of ANFIS model. In this paper, the ANFIS model has been trained with Quantum Behaved Particle Swarm Optimization (QPSO). In this study, for training of proposed model, four sample data have been used which result in acceleration of training data. On the test set, we achieved an outstanding sensitivity and accuracy 100%. Experimental results show that the proposed approach is very fast and accurate in improving classification. Using the proposed methodology and telemedicine technology can manage patient of heart disease

Presenting a New Strategy to Extract Data Clustering Heartbeat Samples by Using Discrete Wavelet Transform

This paper presents the improvement of detection system that normal and arrhythmia electrocardiogram classification. This classification is done to aid the ANFIS (Adaptive Neuro Fuzzy Inference System). The data used in this paper obtained from MIT-BIH normal sinus ECG database signal and MIT-BIH arrhythmia database signal. The main goal of our approach is to create an interpretable classifier that provides an acceptable accuracy. In this model, the feature extraction using DWT (Discrete Wavelet Transform) is obtained. The last stage of this extraction is introduced as the input of ANFIS model. In this paper, the ANFIS model has been trained with Quantum Behaved Particle Swarm Optimization (QPSO). In this study, for training of proposed model, four sample data have been used which result in acceleration of training data. On the test set, we achieved an outstanding sensitivity and accuracy 100%. Experimental results show that the proposed approach is very fast and accurate in improving classification. Using the proposed methodology and telemedicine technology can manage patient of heart disease