Disease diagnosis in smart healthcare: Innovation, technologies and applications

To promote sustainable development, the smart city implies a global vision that merges artificial intelligence, big data, decision making, information and communication technology (ICT), and the internet-of-things (IoT). The ageing issue is an aspect that researchers, companies and government should devote efforts in developing smart healthcare innovative technology and applications. In this paper, the topic of disease diagnosis in smart healthcare is reviewed. Typical emerging optimization algorithms and machine learning algorithms are summarized. Evolutionary optimization, stochastic optimization and combinatorial optimization are covered. Owning to the fact that there are plenty of applications in healthcare, four applications in the field of diseases diagnosis (which also list in the top 10 causes of global death in 2015), namely cardiovascular diseases, diabetes mellitus, Alzheimer’s disease and other forms of dementia, and tuberculosis, are considered. In addition, challenges in the deployment of disease diagnosis in healthcare have been discussed

The multiple pheromone Ant clustering algorithm

Ant Colony Optimisation algorithms mimic the way ants use pheromones for marking paths to important locations. Pheromone traces are followed and reinforced by other ants, but also evaporate over time. As a consequence, optimal paths attract more pheromone, whilst the less useful paths fade away. In the Multiple Pheromone Ant Clustering Algorithm (MPACA), ants detect features of objects represented as nodes within graph space. Each node has one or more ants assigned to each feature. Ants attempt to locate nodes with matching feature values, depositing pheromone traces on the way. This use of multiple pheromone values is a key innovation. Ants record other ant encounters, keeping a record of the features and colony membership of ants. The recorded values determine when ants should combine their features to look for conjunctions and whether they should merge into colonies. This ability to detect and deposit pheromone representative of feature combinations, and the resulting colony formation, renders the algorithm a powerful clustering tool. The MPACA operates as follows: (i) initially each node has ants assigned to each feature; (ii) ants roam the graph space searching for nodes with matching features; (iii) when departing matching nodes, ants deposit pheromones to inform other ants that the path goes to a node with the associated feature values; (iv) ant feature encounters are counted each time an ant arrives at a node; (v) if the feature encounters exceed a threshold value, feature combination occurs; (vi) a similar mechanism is used for colony merging. The model varies from traditional ACO in that: (i) a modified pheromone-driven movement mechanism is used; (ii) ants learn feature combinations and deposit multiple pheromone scents accordingly; (iii) ants merge into colonies, the basis of cluster formation. The MPACA is evaluated over synthetic and real-world datasets and its performance compares favourably with alternative approaches

Driving dynamic multi-objective optimizations constrained by decision-makers' preferences

Dissertation (MSc (Computer Science)) -- University of Pretoria, 2019.Dynamic multi-objective optimization problems (DMOOPs) are an interesting and a relatively complex class of optimization problems where elements of the problems, such as objective functions and/or constraints, change with time. These problems are characterized with at least two objective functions in con ict with one another. Sometimes, human decision-makers seek to in uence ways (by restricting the search to a specific region of the Pareto-optimal Front (POF)) in which algorithms that optimize these problems behave by incorporating personal preferences into the optimization process. This dissertation proposes approaches that enable decision-makers to in uence the optimization process with their preferences. The decision-makers' imparted preferences force a reformulation of the optimization problems as constrained problems, where the constraints are defined in the objective space. Consequently, the constrained problems are then solved using variations of constraint handling techniques, such as penalization of infeasible solutions and the restriction of the search to the feasible region. The proposed algorithmic approaches' performance are compared using standard performance measures for dynamic multi-objective optimization (DMOO) and newly proposed measures. The proposed measures estimate how well an algorithm is able to find solutions in the objective space that best re ect the decision-maker's preferences and the paretooptimality goal of DMOO. This dissertation also proposes a new di erential evolution algorithm, called dynamic di erential evolution vector-evaluated non-dominated sorting (2DEVENS). 2DEVENS combines elements of the dynamic non-dominated sort genetic algorithm version II (DNSGA-II) and the dynamic vector-evaluated particle swarm optimization (DVEPSO) algorithm to drive the search for solutions. The proposed 2DEVENS algorithm compared favorably with other nature-inspired algorithms that were used in the studies carried out for this dissertation. The proposed approaches used in incorporating decision-makers' preferences in the optimization process also demonstrated good results.Computer ScienceMSc (Computer Science)Unrestricte

An investigation into the utilization of swarm intellingence for the control of the doubly fed induction generator under the influence of symmetrical and assymmetrical voltage dips.

Doctoral Degree. University of KwaZulu-Natal, Durban.The rapid depletion of fossil, fuels, increase in population, and birth of various industries has put a severe strain on conventional electrical power generation systems. It is because of this, that Wind Energy Conversion Systems has recently come under intense investigation. Among all topologies, the Doubly Fed Induction Generator is the preferred choice, owing to its direct grid connection, and variable speed nature. However, this connection has disadvantages. Wind turbines are generally placed in areas where the national grid is weak. In the case of asymmetrical voltage dips, which is a common occurrence near wind farms, the operation of the DFIG is negatively affected. Further, in the case of symmetrical voltage dips, as in the case of a three-phase short circuit, this direct grid connection poses a severe threat to the health and subsequent operation of the machine. Owing to these risks, there has been various approaches which are utilized to mitigate the effect of such occurrences. Considering asymmetrical voltage dips, symmetrical component theory allows for decomposition and subsequent elimination of negative sequence components. The proportional resonant controller, which introduces an infinite gain at synchronous frequency, is another viable option. When approached with the case of symmetrical voltage dips, the crowbar is an established method to expedite the rate of decay of the rotor current and dc link voltage. However, this requires the DFIG to be disconnected from the grid, which is against the rules of recently grid codes. To overcome such, the Linear Quadratic Regulator may be utilized. As evident, there has been various approaches to these issues. However, they all require obtaining of optimized gain values. Whilst these controllers work well, poor optimization of gain quantities may result in sub-optimal performance of the controllers. This work provides an investigation into the utilization of metaheuristic optimization techniques for these purposes. This research focuses on swarm-intelligence, which have proven to provide good results. Various swarm techniques from across the timeline spectrum, beginning from the well-known Particle Swarm Optimization, to the recently proposed African Vultures Optimization Algorithm, have been applied and analysed

Evolving Artificial Neural Networks using Cartesian Genetic Programming

NeuroEvolution is the application of Evolutionary Algorithms to the training of Artificial Neural Networks. NeuroEvolution is thought to possess many benefits over traditional training methods including: the ability to train recurrent network structures, the capability to adapt network topology, being able to create heterogeneous networks of arbitrary transfer functions, and allowing application to reinforcement as well as supervised learning tasks. This thesis presents a series of rigorous empirical investigations into many of these perceived advantages of NeuroEvolution. In this work it is demonstrated that the ability to simultaneously adapt network topology along with connection weights represents a significant advantage of many NeuroEvolutionary methods. It is also demonstrated that the ability to create heterogeneous networks comprising a range of transfer functions represents a further significant advantage. This thesis also investigates many potential benefits and drawbacks of NeuroEvolution which have been largely overlooked in the literature. This includes the presence and role of genetic redundancy in NeuroEvolution's search and whether program bloat is a limitation. The investigations presented focus on the use of a recently developed NeuroEvolution method based on Cartesian Genetic Programming. This thesis extends Cartesian Genetic Programming such that it can represent recurrent program structures allowing for the creation of recurrent Artificial Neural Networks. Using this newly developed extension, Recurrent Cartesian Genetic Programming, and its application to Artificial Neural Networks, are demonstrated to be extremely competitive in the domain of series forecasting

Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available

Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available