Enhanced grey wolf optimisation algorithm for feature selection in anomaly detection

Anomaly detection deals with identification of items that do not conform to an expected pattern or items present in a dataset. The performance of different mechanisms utilized to perform the anomaly detection depends heavily on the group of features used. Thus, not all features in the dataset can be used in the classification process since some features may lead to low performance of classifier. Feature selection (FS) is a good mechanism that minimises the dimension of high-dimensional datasets by deleting the irrelevant features. Modified Binary Grey Wolf Optimiser (MBGWO) is a modern metaheuristic algorithm that has successfully been used for FS for anomaly detection. However, the MBGWO has several issues in finding a good quality solution. Thus, this study proposes an enhanced binary grey wolf optimiser (EBGWO) algorithm for FS in anomaly detection to overcome the algorithm issues. The first modification enhances the initial population of the MBGWO using a heuristic based Ant Colony Optimisation algorithm. The second modification develops a new position update mechanism using the Bat Algorithm movement. The third modification improves the controlled parameter of the MBGWO algorithm using indicators from the search process to refine the solution. The EBGWO algorithm was evaluated on NSL-KDD and six (6) benchmark datasets from the University California Irvine (UCI) repository against ten (10) benchmark metaheuristic algorithms. Experimental results of the EBGWO algorithm on the NSL-KDD dataset in terms of number of selected features and classification accuracy are superior to other benchmark optimisation algorithms. Moreover, experiments on the six (6) UCI datasets showed that the EBGWO algorithm is superior to the benchmark algorithms in terms of classification accuracy and second best for the number of selected features. The proposed EBGWO algorithm can be used for FS in anomaly detection tasks that involve any dataset size from various application domains

An Evaluation of Performance Enhancements to Particle Swarm Optimisation on Real-World Data

Swarm Computation is a relatively new optimisation paradigm. The basic premise is to model the collective behaviour of self-organised natural phenomena such as swarms, flocks and shoals, in order to solve optimisation problems. Particle Swarm Optimisation (PSO) is a type of swarm computation inspired by bird flocks or swarms of bees by modelling their collective social influence as they search for optimal solutions. In many real-world applications of PSO, the algorithm is used as a data pre-processor for a neural network or similar post processing system, and is often extensively modified to suit the application. The thesis introduces techniques that allow unmodified PSO to be applied successfully to a range of problems, specifically three extensions to the basic PSO algorithm: solving optimisation problems by training a hyperspatial matrix, using a hierarchy of swarms to coordinate optimisation on several data sets simultaneously, and dynamic neighbourhood selection in swarms. Rather than working directly with candidate solutions to an optimisation problem, the PSO algorithm is adapted to train a matrix of weights, to produce a solution to the problem from the inputs. The search space is abstracted from the problem data. A single PSO swarm optimises a single data set and has difficulties where the data set comprises disjoint parts (such as time series data for different days). To address this problem, we introduce a hierarchy of swarms, where each child swarm optimises one section of the data set whose gbest particle is a member of the swarm above in the hierarchy. The parent swarm(s) coordinate their children and encourage more exploration of the solution space. We show that hierarchical swarms of this type perform better than single swarm PSO optimisers on the disjoint data sets used. PSO relies on interaction between particles within a neighbourhood to find good solutions. In many PSO variants, possible interactions are arbitrary and fixed on initialisation. Our third contribution is a dynamic neighbourhood selection: particles can modify their neighbourhood, based on the success of the candidate neighbour particle. As PSO is intended to reflect the social interaction of agents, this change significantly increases the ability of the swarm to find optimal solutions. Applied to real-world medical and cosmological data, this modification is and shows improvements over standard PSO approaches with fixed neighbourhoods

Traveling Salesman Problem

The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance

Cooperative control for multi-vehicle swarms

The cooperative control of large-scale multi-agent systems has gained a significant interest in recent years from the robotics and control communities for multi-vehicle control. One motivator for the growing interest is the application of spatially and temporally distributed multiple unmanned aerial vehicle (UAV) systems for distributed sensing and collaborative operations. In this research, the multi-vehicle control problem is addressed using a decentralised control system. The work aims to provide a decentralised control framework that synthesises the self-organised and coordinated behaviour of natural swarming systems into cooperative UAV systems. The control system design framework is generalised for application into various other multi-agent systems including cellular robotics, ad-hoc communication networks, and modular smart-structures. The approach involves identifying su itable relationships that describe the behaviour of the UAVs within the swarm and the interactions of these behaviours to produce purposeful high-level actions for system operators. A major focus concerning the research involves the development of suitable analytical tools that decomposes the general swarm behaviours to the local vehicle level. The control problem is approached using two-levels of abstraction; the supervisory level, and the local vehicle level. Geometric control techniques based on differential geometry are used at the supervisory level to reduce the control problem to a small set of permutation and size invariant abstract descriptors. The abstract descriptors provide an open-loop optimal state and control trajectory for the collective swarm and are used to describe the intentions of the vehicles. Decentralised optimal control is implemented at the local vehicle level to synthesise self-organised and cooperative behaviour. A deliberative control scheme is implemented at the local vehicle le vel that demonstrates autonomous, cooperative and optimal behaviour whilst the preserving precision and reliability at the local vehicle level

Stigmergy for autonomous distributed coordination of satellite clusters

EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Low-Cost Inventions and Patents

Inventions have led to the technological advances of mankind. There are inventions of all kinds, some of which have lasted hundreds of years or even longer. Low-cost technologies are expected to be easy to build, have little or no energy consumption, and be easy to maintain and operate. The use of sustainable technologies is essential in order to move towards a greater global coverage of technology, and therefore to improve human quality of life. Low-cost products always respond to a specific need, even if no in-depth analysis of the situation or possible solutions has been carried out. It is a consensus in all industrialized countries that patents have a decisive influence on the organization of the economy, as they are a key element in promoting technological innovation. Patents must aim to promote the technological development of countries, starting from their industrial situations

A complex systems approach to education in Switzerland

The insights gained from the study of complex systems in biological, social, and engineered systems enables us not only to observe and understand, but also to actively design systems which will be capable of successfully coping with complex and dynamically changing situations. The methods and mindset required for this approach have been applied to educational systems with their diverse levels of scale and complexity. Based on the general case made by Yaneer Bar-Yam, this paper applies the complex systems approach to the educational system in Switzerland. It confirms that the complex systems approach is valid. Indeed, many recommendations made for the general case have already been implemented in the Swiss education system. To address existing problems and difficulties, further steps are recommended. This paper contributes to the further establishment complex systems approach by shedding light on an area which concerns us all, which is a frequent topic of discussion and dispute among politicians and the public, where billions of dollars have been spent without achieving the desired results, and where it is difficult to directly derive consequences from actions taken. The analysis of the education system's different levels, their complexity and scale will clarify how such a dynamic system should be approached, and how it can be guided towards the desired performance

Mathematical modelling and brain dynamical networks

In this thesis, we study the dynamics of the Hindmarsh-Rose (HR) model which studies the spike-bursting behaviour of the membrane potential of a single neuron. We study the stability of the HR system and compute its Lyapunov exponents (LEs). We consider coupled general sections of the HR system to create an undirected brain dynamical network (BDN) of Nn neurons. Then, we study the concepts of upper bound of mutual information rate (MIR) and synchronisation measure and their dependence on the values of electrical and chemical couplings. We analyse the dynamics of neurons in various regions of parameter space plots for two elementary examples of 3 neurons with two different types of electrical and chemical couplings. We plot the upper bound Ic and the order parameter rho (the measure of synchronisation) and the two largest Lyapunov exponents LE1 and LE2 versus the chemical coupling gn and electrical coupling gl. We show that, even for small number of neurons, the dynamics of the system depends on the number of neurons and the type of coupling strength between them. Finally, we evolve a network of Hindmarsh-Rose neurons by increasing the entropy of the system. In particular, we choose the Kolmogorov-Sinai entropy: HKS (Pesin identity) as the evolution rule. First, we compute the HKS for a network of 4 HR neurons connected simultaneously by two undirected electrical and two undirected chemical links. We get different entropies with the use of different values for both the chemical and electrical couplings. If the entropy of the system is positive, the dynamics of the system is chaotic and if it is close to zero, the trajectory of the system converges to one of the fixed points and loses energy. Then, we evolve a network of 6 clusters of 10 neurons each. Neurons in each cluster are connected only by electrical links and their connections form small-world networks. The six clusters connect to each other only by chemical links. We compare between the combined effect of chemical and electrical couplings with the two concepts, the information flow capacity Ic and HKS in evolving the BDNs and show results that the brain networks might evolve based on the principle of the maximisation of their entropies

Applicable Solutions in Non-Linear Dynamical Systems

From Preface: The 15th International Conference „Dynamical Systems - Theory and Applications” (DSTA 2019, 2-5 December, 2019, Lodz, Poland) gathered a numerous group of outstanding scientists and engineers who deal with widely understood problems of theoretical and applied dynamics. Organization of the conference would not have been possible without great effort of the staff of the Department of Automation, Biomechanics and Mechatronics of the Lodz University of Technology. The patronage over the conference has been taken by the Committee of Mechanics of the Polish Academy of Sciences and Ministry of Science and Higher Education of Poland. It is a great pleasure that our event was attended by over 180 researchers from 35 countries all over the world, who decided to share the results of their research and experience in different fields related to dynamical systems. This year, the DSTA Conference Proceedings were split into two volumes entitled „Theoretical Approaches in Non-Linear Dynamical Systems” and „Applicable Solutions in Non-Linear Dynamical Systems”. In addition, DSTA 2019 resulted in three volumes of Springer Proceedings in Mathematics and Statistics entitled „Control and Stability of Dynamical Systems”, „Mathematical and Numerical Approaches in Dynamical Systems” and „Dynamical Systems in Mechatronics and Life Sciences”. Also, many outstanding papers will be recommended to special issues of renowned scientific journals.Cover design: Kaźmierczak, MarekTechnical editor: Kaźmierczak, Mare