Name
Abstract | ||
|---|---|---|
AntClust is a clustering algorithm that is inspired by the chemical recognition system of real ants. It associates the genome of each artificial ant to an object of the initial data set and simulates meetings between ants to create nests of individuals that share a similar genome. Thus, the nests realize a partition of the original data set with no hypothesis concerning the output clusters (number, shape, size...) and with minimum input parameters. Due to an internal mechanism of nest selection and finalization, AntClust runs in the worst case in quadratic time complexity with the number of ants. In this paper, we evaluate new heuristics for nest selection and finalization that allows AntClust to run on linear time complexity with the number of ants. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30217-9_115 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
linear time,time complexity | Recognition system,Computer science,Heuristics,Artificial intelligence,Finalization,Cluster analysis,Time complexity,Nest,Partition (number theory),Artificial Ants | Conference |
Volume | ISSN | Citations |
3242 | 0302-9743 | 8 |
PageRank | References | Authors |
0.68 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Labroche | 1 | 139 | 17.87 |
| Christiane Guinot | 2 | 95 | 15.88 |
| Gilles Venturini | 3 | 660 | 82.45 |