Simulation of Ant Based Clustering Algorithm Based on Cemetery Organization (Lumer&Faeita Method)
by Heidar Rastiveis
05 Jun 2011
(Updated 07 Jun 2011)
This code shows the process of Lumer and Faeita algorithm in data clustering.
|
Watch this File
|
| File Information |
| Description |
Many ant species exhibit the behavior of clustering corpses to form cemeteries. Each ant seems to behave individually, moving randomly in space while picking up or depositing (dropping) corpses. The decision to pick up or drop a corpse is based on local information of the ant’s current position. Lumer and Faeita applied this concepts in data clustering.
In this code the process of moving, picking up/dropping patterns, etc in the algorithm is shown.
After Generating sample patterns and setting the parameters you can run the process.
For generating sample data, the number of clusters, features and patterns should be selected.
The default value of parameters can be easily changed.
It should be noted that any graphical parts presented by check-boxes (Ants, Neighborhood, Patterns, Grid Lines) can be shown on/off during the iteration. They should just be checked or unchecked. |
| MATLAB release |
MATLAB 7.8 (R2009a)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Updates |
| 07 Jun 2011 |
Description, summary and title have been corrected. |
|
Contact us at files@mathworks.com