Multistrategy Self-Organizing Map Learning for Classification Problems

Multistrategy Learning of Self-Organizing Map (SOM) and Particle Swarm Optimization (PSO) is commonly implemented in clustering domain due to its capabilities in handling complex data characteristics. However, some of these multistrategy learning architectures have weaknesses such as slow convergence time always being trapped in the local minima. This paper proposes multistrategy learning of SOM lattice structure with Particle Swarm Optimisation which is called ESOMPSO for solving various classification problems. The enhancement of SOM lattice structure is implemented by introducing a new hexagon formulation for better mapping quality in data classification and labeling. The weights of the enhanced SOM are optimised using PSO to obtain better output quality. The proposed method has been tested on various standard datasets with substantial comparisons with existing SOM network and various distance measurement. The results show that our proposed method yields a promising result with better average accuracy and quantisation errors compared to the other methods as well as convincing significant test

A Hybrid PSO Based on Dynamic Clustering for Global Optimization

Particle swarm optimization is a population-based global search method, and known to suffer from premature convergence prior to discovering the true global minimizer for global optimization problems. Taking balance of local intensive exploitation and global exploration into account, a novel algorithm is presented in the paper, called dynamic clustering hybrid particle swarm optimization (DC-HPSO). In the method, particles are constantly and dynamically clustered into several groups (sub-swarms) corresponding to promising sub-regions in terms of similarity of their generalized particles. In each group, a dominant particle is chosen to take responsibility for local intensive exploitation, while the rest are responsible for exploration by maintaining diversity of the swarm. The simultaneous perturbation stochastic approximation (SPSA) is introduced into our work in order to guarantee the implementation of exploitation and the standard PSO is modified for exploration. The experimental results show the efficiency of the proposed algorithm in comparison with several other peer algorithms

Data-Driven Predictive Modeling to Enhance Search Efficiency of Glowworm-Inspired Robotic Swarms in Multiple Emission Source Localization Tasks

In time-sensitive search and rescue applications, a team of multiple mobile robots broadens the scope of operational capabilities. Scaling multi-robot systems (\u3c 10 agents) to larger robot teams (10 – 100 agents) using centralized coordination schemes becomes computationally intractable during runtime. One solution to this problem is inspired by swarm intelligence principles found in nature, offering the benefits of decentralized control, fault tolerance to individual failures, and self-organizing adaptability. Glowworm swarm optimization (GSO) is unique among swarm-based algorithms as it simultaneously focuses on searching for multiple targets. This thesis presents GPR-GSO—a modification to the GSO algorithm that incorporates Gaussian Process Regression (GPR) based data-driven predictive modeling—to improve the search efficiency of robotic swarms in multiple emission source localization tasks. The problem formulation and methods are presented, followed by numerical simulations to illustrate the working of the algorithm. Results from a comparative analysis show that the GPR-GSO algorithm exceeds the performance of the benchmark GSO algorithm on evaluation metrics of swarm size, search completion time, and travel distance

Spatial information of fuzzy clustering based mean best artificial bee colony algorithm for phantom brain image segmentation

Fuzzy c-means algorithm (FCM) is among the most commonly used in the medical image segmentation process. Nevertheless, the traditional FCM clustering approach has been several weaknesses such as noise sensitivity and stuck in local optimum, due to FCM hasn’t able to consider the information of contextual. To solve FCM problems, this paper presented spatial information of fuzzy clustering-based mean best artificial bee colony algorithm, which is called SFCM-MeanABC. This proposed approach is used contextual information in the spatial fuzzy clustering algorithm to reduce sensitivity to noise and its used MeanABC capability of balancing between exploration and exploitation that is explore the positive and negative directions in search space to find the best solutions, which leads to avoiding stuck in a local optimum. The experiments are carried out on two kinds of brain images the Phantom MRI brain image with a different level of noise and simulated image. The performance of the SFCM-MeanABC approach shows promising results compared with SFCM-ABC and other stats of the arts

Development of a R package to facilitate the learning of clustering techniques

This project explores the development of a tool, in the form of a R package, to ease the process of learning clustering techniques, how they work and what their pros and cons are. This tool should provide implementations for several different clustering techniques with explanations in order to allow the student to get familiar with the characteristics of each algorithm by testing them against several different datasets while deepening their understanding of them through the explanations. Additionally, these explanations should adapt to the input data, making the tool not only adept for self-regulated learning but for teaching too.Grado en Ingeniería Informátic

Spatial fuzzy c-mean sobel algorithm with grey wolf optimizer for MRI brain image segmentation

Segmentation is the process of dividing the original image into multiple sub regions called segments in such a way that there is no intersection between any two regions. In medical images, the segmentation is hard to obtain due to the intensity similarity among various regions and the presence of noise in medical images. One of the most popular segmentation algorithms is Spatial Fuzzy C-means (SFCM). Although this algorithm has a good performance in medical images, it suffers from two issues. The first problem is lack of a proper strategy for point initialization step, which must be performed either randomly or manually by human. The second problem of SFCM is having inaccurate segmented edges. The goal of this research is to propose a robust medical image segmentation algorithm that overcomes these weaknesses of SFCM for segmenting magnetic resonance imaging (MRI) brain images with less human intervention. First, in order to find the optimum initial points, a histogram based algorithm in conjunction with Grey Wolf Optimizer (H-GWO) is proposed. The proposed H-GWO algorithm finds the approximate initial point values by the proposed histogram based method and then by taking advantage of GWO, which is a soft computing method, the optimum initial values are found. Second, in order to enhance SFCM segmentation process and achieve higher accurate segmented edges, an edge detection algorithm called Sobel was utilized. Therefore, the proposed hybrid SFCM-Sobel algorithm first finds the edges of the original image by Sobel edge detector algorithm and finally extends the edges of SFCM segmented images to the edges that are detected by Sobel. In order to have a robust segmentation algorithm with less human intervention, the H-GWO and SFCM-Sobel segmentation algorithms are integrated to have a semi-automatic robust segmentation algorithm. The results of the proposed H-GWO algorithms show that optimum initial points are achieved and the segmented images of the SFCM-Sobel algorithm have more accurate edges as compared to recent algorithms. Overall, quantitative analysis indicates that better segmentation accuracy is obtained. Therefore, this algorithm can be utilized to capture more accurate segmented in images in the era of medical imaging

Projection-Based Clustering through Self-Organization and Swarm Intelligence

It covers aspects of unsupervised machine learning used for knowledge discovery in data science and introduces a data-driven approach to cluster analysis, the Databionic swarm (DBS). DBS consists of the 3D landscape visualization and clustering of data. The 3D landscape enables 3D printing of high-dimensional data structures. The clustering and number of clusters or an absence of cluster structure are verified by the 3D landscape at a glance. DBS is the first swarm-based technique that shows emergent properties while exploiting concepts of swarm intelligence, self-organization and the Nash equilibrium concept from game theory. It results in the elimination of a global objective function and the setting of parameters. By downloading the R package DBS can be applied to data drawn from diverse research fields and used even by non-professionals in the field of data mining

Parallel bio-inspired methods for model optimization and pattern recognition

Nature based computational models are usually inherently parallel. The collaborative intelligence in those models emerges from the simultaneous instruction processing by simple independent units (neurons, ants, swarm members, etc...). This dissertation investigates the benefits of such parallel models in terms of efficiency and accuracy. First, the viability of a parallel implementation of bio-inspired metaheuristics for function optimization on consumer-level graphic cards is studied in detail. Then, in an effort to expose those parallel methods to the research community, the metaheuristic implementations were abstracted and grouped in an open source parameter/function optimization library libCudaOptimize. The library was verified against a well known benchmark for mathematical function minimization, and showed significant gains in both execution time and minimization accuracy. Crossing more into the application side, a parallel model of the human neocortex was developed. This model is able to detect, classify, and predict patterns in time-series data in an unsupervised way. Finally, libCudaOptimize was used to find the best parameters for this neocortex model, adapting it to gesture recognition within publicly available datasets