Name
Abstract | ||
|---|---|---|
Organization is a central concept in systems. In this paper an ant algorithm for detecting organizations is presented. In a discrete-time context, at each time-step, an organization corresponds to a set of closely interacting entities in a system. This system is mapped to a graph where nodes represent enti- ties and edges represent interrelations. Several colonies of ants compete, and inside each colony, ants collaborate in order to colonize the graph. Detected organizations emerge from the global behavior of the ants. The proposed approach is com- pared to other methods on a graph where the organizations are already known. It is then tested on two real world graphs stud- ied in the related literature. |
Year | Venue | Keywords |
|---|---|---|
2006 | ITSSA | organization,dynamic graph,ant algorithm.,community,dy- namic network,discrete time |
Field | DocType | Volume |
Computer science,Artificial intelligence,Distributed computing | Journal | 2 |
Issue | Citations | PageRank |
1 | 3 | 0.42 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cyrille Bertelle | 1 | 81 | 20.42 |
| Antoine Dutot | 2 | 20 | 4.53 |
| F. Guinand | 3 | 189 | 25.84 |
| Damien Olivier | 4 | 42 | 6.95 |