An Investigation Into the use of Swarm Intelligence for an Evolutionary Algorithm Optimisation; The Optimisation Performance of Differential Evolution Algorithm Coupled with Stochastic Diffusion Search

The integration of Swarm Intelligence (SI) algorithms and Evolutionary algorithms (EAs) might be one of the future approaches in the Evolutionary Computation (EC). This work narrates the early research on using Stochastic Diffusion Search (SDS) -- a swarm intelligence algorithm -- to empower the Differential Evolution (DE) -- an evolutionary algorithm -- over a set of optimisation problems. The results reported herein suggest that the powerful resource allocation mechanism deployed in SDS has the potential to improve the optimisation capability of the classical evolutionary algorithm used in this experiment. Different performance measures and statistical analyses were utilised to monitor the behaviour of the final coupled algorithm

The Infinite Hierarchical Factor Regression Model

We propose a nonparametric Bayesian factor regression model that accounts for uncertainty in the number of factors, and the relationship between factors. To accomplish this, we propose a sparse variant of the Indian Buffet Process and couple this with a hierarchical model over factors, based on Kingman's coalescent. We apply this model to two problems (factor analysis and factor regression) in gene-expression data analysis

Laplacian Mixture Modeling for Network Analysis and Unsupervised Learning on Graphs

Laplacian mixture models identify overlapping regions of influence in unlabeled graph and network data in a scalable and computationally efficient way, yielding useful low-dimensional representations. By combining Laplacian eigenspace and finite mixture modeling methods, they provide probabilistic or fuzzy dimensionality reductions or domain decompositions for a variety of input data types, including mixture distributions, feature vectors, and graphs or networks. Provable optimal recovery using the algorithm is analytically shown for a nontrivial class of cluster graphs. Heuristic approximations for scalable high-performance implementations are described and empirically tested. Connections to PageRank and community detection in network analysis demonstrate the wide applicability of this approach. The origins of fuzzy spectral methods, beginning with generalized heat or diffusion equations in physics, are reviewed and summarized. Comparisons to other dimensionality reduction and clustering methods for challenging unsupervised machine learning problems are also discussed.Comment: 13 figures, 35 reference

Cooperation of Nature and Physiologically Inspired Mechanism in Visualisation

A novel approach of integrating two swarm intelligence algorithms is considered, one simulating the behaviour of birds flocking (Particle Swarm Optimisation) and the other one (Stochastic Diffusion Search) mimics the recruitment behaviour of one species of ants – Leptothorax acervorum. This hybrid algorithm is assisted by a biological mechanism inspired by the behaviour of blood flow and cells in blood vessels, where the concept of high and low blood pressure is utilised. The performance of the nature-inspired algorithms and the biologically inspired mechanisms in the hybrid algorithm is reflected through a cooperative attempt to make a drawing on the canvas. The scientific value of the marriage between the two swarm intelligence algorithms is currently being investigated thoroughly on many benchmarks and the results reported suggest a promising prospect (al-Rifaie, Bishop & Blackwell, 2011). We also discuss whether or not the ‘art works’ generated by nature and biologically inspired algorithms can possibly be considered as ‘computationally creative’

Salience-based selection: attentional capture by distractors less salient than the target

Current accounts of attentional capture predict the most salient stimulus to be invariably selected first. However, existing salience and visual search models assume noise in the map computation or selection process. Consequently, they predict the first selection to be stochastically dependent on salience, implying that attention could even be captured first by the second most salient (instead of the most salient) stimulus in the field. Yet, capture by less salient distractors has not been reported and salience-based selection accounts claim that the distractor has to be more salient in order to capture attention. We tested this prediction using an empirical and modeling approach of the visual search distractor paradigm. For the empirical part, we manipulated salience of target and distractor parametrically and measured reaction time interference when a distractor was present compared to absent. Reaction time interference was strongly correlated with distractor salience relative to the target. Moreover, even distractors less salient than the target captured attention, as measured by reaction time interference and oculomotor capture. In the modeling part, we simulated first selection in the distractor paradigm using behavioral measures of salience and considering the time course of selection including noise. We were able to replicate the result pattern we obtained in the empirical part. We conclude that each salience value follows a specific selection time distribution and attentional capture occurs when the selection time distributions of target and distractor overlap. Hence, selection is stochastic in nature and attentional capture occurs with a certain probability depending on relative salience