Intelligent Cybersecurity Classification Using Chaos Game Optimization with Deep Learning Model

Cyberattack detection has become an important research domain owing to increasing number of cybercrimes in recent years.Both Machine Learning(ML)and Deep Learning(DL)classification models are useful in effective identification and classification of cyberattacks.In addition,the involvement of hyper parameters in DL models has a significantly influence upon the overall performance of the classification models.In this background,the current study develops Intelligent Cybersecurity Classification using Chaos Game Optimization with Deep Learning(ICC-CGODL)Model.The goal of the proposed ICC-CGODL model is to recognize and categorize different kinds of attacks made upon data.Besides,ICC-CGODL model primarily performs min-max normalization process to normalize the data into uniform format.In addition,Bidirectional Gated Recurrent Unit(BiGRU)model is utilized for detection and classification of cyberattacks.Moreover,CGO algorithm is also exploited to adjust the hyper parameters involved in BiGRU model which is the novelty of current work.A wide-range of simulation analysis was conducted on benchmark dataset and the results obtained confirmed the significant performance of ICC-CGODL technique than the recent approaches.

BHGSO:Binary Hunger Games Search Optimization Algorithm for Feature Selection Problem

In machine learning and data mining,feature selection(FS)is a traditional and complicated optimization problem.Since the run time increases exponentially,FS is treated as an NP-hard problem.The researcher’s effort to build a new FS solution was inspired by the ongoing need for an efficient FS framework and the success rates of swarming outcomes in different optimization scenarios.This paper presents two binary variants of a Hunger Games Search Optimization(HGSO)algorithm based on V-and S-shaped transfer functions within a wrapper FS model for choosing the best features from a large dataset.The proposed technique transforms the continuous HGSO into a binary variant using V-and S-shaped transfer functions(BHGSO-V and BHGSO-S).To validate the accuracy,16 famous UCI datasets are considered and compared with different state-of-the-art metaheuristic binary algorithms.The findings demonstrate that BHGSO-V achieves better performance in terms of the selected number of features,classification accuracy,run time,and fitness values than other state-of-the-art algorithms.The results demonstrate that the BHGSO-V algorithm can reduce dimensionality and choose the most helpful features for classification problems.The proposed BHGSO-V achieves 95%average classification accuracy for most of the datasets,and run time is less than 5 sec.for low and medium dimensional datasets and less than 10 sec for high dimensional datasets.

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game

Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks.We first model the WVC problem as a general game on weighted networks.Under the framework of a game,we newly define several cover states to describe the WVC problem.Moreover,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the game.Then,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time.Subsequently,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the GAA.Finally,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.

Dart Games Optimizer with Deep Learning-Based Computational Linguistics Named Entity Recognition

Computational linguistics is an engineering-based scientific discipline.It deals with understanding written and spoken language from a computational viewpoint.Further,the domain also helps construct the artefacts that are useful in processing and producing a language either in bulk or in a dialogue setting.Named Entity Recognition(NER)is a fundamental task in the data extraction process.It concentrates on identifying and labelling the atomic components from several texts grouped under different entities,such as organizations,people,places,and times.Further,the NER mechanism identifies and removes more types of entities as per the requirements.The significance of the NER mechanism has been well-established in Natural Language Processing(NLP)tasks,and various research investigations have been conducted to develop novel NER methods.The conventional ways of managing the tasks range from rule-related and hand-crafted feature-related Machine Learning(ML)techniques to Deep Learning(DL)techniques.In this aspect,the current study introduces a novel Dart Games Optimizer with Hybrid Deep Learning-Driven Computational Linguistics(DGOHDL-CL)model for NER.The presented DGOHDL-CL technique aims to determine and label the atomic components from several texts as a collection of the named entities.In the presented DGOHDL-CL technique,the word embed-ding process is executed at the initial stage with the help of the word2vec model.For the NER mechanism,the Convolutional Gated Recurrent Unit(CGRU)model is employed in this work.At last,the DGO technique is used as a hyperparameter tuning strategy for the CGRU algorithm to boost the NER’s outcomes.No earlier studies integrated the DGO mechanism with the CGRU model for NER.To exhibit the superiority of the proposed DGOHDL-CL technique,a widespread simulation analysis was executed on two datasets,CoNLL-2003 and OntoNotes 5.0.The experimental outcomes establish the promising performance of the DGOHDL-CL technique over other models.

Novel chaos game optimization tuned-fractional-order PID fractional-order PI controller for load-frequency control of interconnected power systems

In this work,chaos game optimization(CGO),a robust optimization approach,is employed for efficient design of a novel cascade controller for four test systems with interconnected power systems(IPSs)to tackle load-frequency con-trol(LFC)difficulties.The CGO method is based on chaos theory principles,in which the structure of fractals is seen via the chaotic game principle and the fractals’self-similarity characteristics are considered.CGO is applied in LFC studies as a novel application,which reveals further research gaps to be filled.For practical implementation,it is also highly desirable to keep the controller structure simple.Accordingly,in this paper,a CGO-based controller of fractional-order(FO)proportional-integral-derivative-FO proportional-integral(FOPID-FOPI)controller is proposed,and the integral time multiplied absolute error performance function is used.Initially,the proposed CGO-based FOPID-FOPI controller is tested with and without the nonlinearity of the governor dead band for a two-area two-source model of a non-reheat unit.This is a common test system in the literature.A two-area multi-unit system with reheater-hydro-gas in both areas is implemented.To further generalize the advantages of the proposed scheme,a model of a three-area hydrothermal IPS including generation rate constraint nonlinearity is employed.For each test system,comparisons with relevant existing studies are performed.These demonstrate the superiority of the proposed scheme in reducing settling time,and frequency and tie-line power deviations.

Metaheuristic Based Resource Scheduling Technique for Distributed Robotic Control Systems

The design of controllers for robots is a complex system that is to be dealt with several tasks in real time for enabling the robots to function independently.The distributed robotic control system can be used in real time for resolving various challenges such as localization,motion controlling,mapping,route planning,etc.The distributed robotic control system can manage different kinds of heterogenous devices.Designing a distributed robotic control system is a challenging process as it needs to operate effectually under different hardware configurations and varying computational requirements.For instance,scheduling of resources(such as communication channel,computation unit,robot chassis,or sensor input)to the various system components turns out to be an essential requirement for completing the tasks on time.Therefore,resource scheduling is necessary for ensuring effective execution.In this regard,this paper introduces a novel chaotic shell game optimization algorithm(CSGOA)for resource scheduling,known as the CSGOA-RS technique for the distributed robotic control system environment.The CSGOA technique is based on the integration of the chaotic maps concept to the SGO algorithm for enhancing the overall performance.The CSGOA-RS technique is designed for allocating the resources in such a way that the transfer time is minimized and the resource utilization is increased.The CSGOA-RS technique is applicable even for the unpredicted environment where the resources are to be allotted dynamically based on the early estimations.For validating the enhanced performance of the CSGOA-RS technique,a series of simulations have been carried out and the obtained results have been examined with respect to a selected set of measures.The resultant outcomes highlighted the promising performance of the CSGOA-RS technique over the other resource scheduling techniques.

SIMPLE COMPUTING OF THE CUSTOMER LIFETIME VALUE:A FIXED LOCAL-OPTIMAL POLICY APPROACH

In this paper,we present a new method for finding a fixed local-optimal policy for computing the customer lifetime value.The method is developed for a class of ergodic controllable finite Markov chains.We propose an approach based on a non-converging state-value function that fluctuates（increases and decreases） between states of the dynamic process.We prove that it is possible to represent that function in a recursive format using a one-step-ahead fixed-optimal policy.Then,we provide an analytical formula for the numerical realization of the fixed local-optimal strategy.We also present a second approach based on linear programming,to solve the same problem,that implement the c-variable method for making the problem computationally tractable.At the end,we show that these two approaches are related：after a finite number of iterations our proposed approach converges to same result as the linear programming method.We also present a non-traditional approach for ergodicity verification.The validity of the proposed methods is successfully demonstrated theoretically and,by simulated credit-card marketing experiments computing the customer lifetime value for both an optimization and a game theory approach.