8,839 research outputs found
Finding groups in data: Cluster analysis with ants
Wepresent in this paper a modification of Lumer and Faietaâs algorithm for data clustering. This approach
mimics the clustering behavior observed in real ant colonies. This algorithm discovers automatically
clusters in numerical data without prior knowledge of possible number of clusters. In this paper we focus
on ant-based clustering algorithms, a particular kind of a swarm intelligent system, and on the effects on
the final clustering by using during the classification differentmetrics of dissimilarity: Euclidean, Cosine,
and Gower measures. Clustering with swarm-based algorithms is emerging as an alternative to more
conventional clustering methods, such as e.g. k-means, etc. Among the many bio-inspired techniques, ant
clustering algorithms have received special attention, especially because they still require much
investigation to improve performance, stability and other key features that would make such algorithms
mature tools for data mining.
As a case study, this paper focus on the behavior of clustering procedures in those new approaches.
The proposed algorithm and its modifications are evaluated in a number of well-known benchmark
datasets. Empirical results clearly show that ant-based clustering algorithms performs well when
compared to another techniques
Bio-inspired Mechanisms for Artificial Self-organised Systems
Research on self-organization tries to describe and explain forms, complex patterns and behaviours that arise from a collection of entities without an external organizer. As researchers in artificial systems, our aim is not to mimic self-organizing phenomena arising in Nature, but to understand and to control underlying mechanisms allowing desired emergence of forms, complex patterns and behaviours. In this paper we analyze three forms of self-organization: stigmergy, reinforcement mechanisms and cooperation. For each forms of self-organisation, we present a case study to show how we transposed it to some artificial systems and then analyse the strengths and weaknesses of such an approach
Computational Chemotaxis in Ants and Bacteria over Dynamic Environments
Chemotaxis can be defined as an innate behavioural response by an organism to
a directional stimulus, in which bacteria, and other single-cell or
multicellular organisms direct their movements according to certain chemicals
in their environment. This is important for bacteria to find food (e.g.,
glucose) by swimming towards the highest concentration of food molecules, or to
flee from poisons. Based on self-organized computational approaches and similar
stigmergic concepts we derive a novel swarm intelligent algorithm. What strikes
from these observations is that both eusocial insects as ant colonies and
bacteria have similar natural mechanisms based on stigmergy in order to emerge
coherent and sophisticated patterns of global collective behaviour. Keeping in
mind the above characteristics we will present a simple model to tackle the
collective adaptation of a social swarm based on real ant colony behaviors (SSA
algorithm) for tracking extrema in dynamic environments and highly multimodal
complex functions described in the well-know De Jong test suite. Later, for the
purpose of comparison, a recent model of artificial bacterial foraging (BFOA
algorithm) based on similar stigmergic features is described and analyzed.
Final results indicate that the SSA collective intelligence is able to cope and
quickly adapt to unforeseen situations even when over the same cooperative
foraging period, the community is requested to deal with two different and
contradictory purposes, while outperforming BFOA in adaptive speed. Results
indicate that the present approach deals well in severe Dynamic Optimization
problems.Comment: 8 pages, 6 figures, in CEC 07 - IEEE Congress on Evolutionary
Computation, ISBN 1-4244-1340-0, pp. 1009-1017, Sep. 200
Recommended from our members
Personal mobile grids with a honeybee inspired resource scheduler
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The overall aim of the thesis has been to introduce Personal Mobile Grids (PMGrids)
as a novel paradigm in grid computing that scales grid infrastructures to mobile devices and extends grid entities to individual personal users. In this thesis, architectural designs as well as simulation models for PM-Grids are developed.
The core of any grid system is its resource scheduler. However, virtually all current conventional grid schedulers do not address the non-clairvoyant scheduling problem, where job information is not available before the end of execution. Therefore, this thesis proposes a honeybee inspired resource scheduling heuristic for PM-Grids (HoPe) incorporating a radical approach to grid resource scheduling to tackle this problem. A detailed design and implementation of HoPe with a decentralised self-management and adaptive policy are initiated.
Among the other main contributions are a comprehensive taxonomy of grid systems as well as a detailed analysis of the honeybee colony and its nectar acquisition process (NAP), from the resource scheduling perspective, which have not been presented in any previous work, to the best of our knowledge.
PM-Grid designs and HoPe implementation were evaluated thoroughly through a strictly controlled empirical evaluation framework with a well-established heuristic in high throughput computing, the opportunistic scheduling heuristic (OSH), as a benchmark algorithm. Comparisons with optimal values and worst bounds are conducted to gain a clear insight into HoPe behaviour, in terms of stability, throughput, turnaround time and speedup, under different running conditions of number of jobs and grid scales.
Experimental results demonstrate the superiority of HoPe performance where it
has successfully maintained optimum stability and throughput in more than 95%
of the experiments, with HoPe achieving three times better than the OSH under
extremely heavy loads. Regarding the turnaround time and speedup, HoPe has
effectively achieved less than 50% of the turnaround time incurred by the OSH, while doubling its speedup in more than 60% of the experiments.
These results indicate the potential of both PM-Grids and HoPe in realising futuristic grid visions. Therefore considering the deployment of PM-Grids in real life scenarios and the utilisation of HoPe in other parallel processing and high throughput computing systems are recommended
- âŠ