Hanane Azzag
ABSTRACT
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way real ants build structures with self-assembly behaviors. We show that our method outperforms standard algorithms for building such neighborhood graphs (up to 2230 times faster on the tested databases with equal quality) and how the user may interactively explore the graph.
- H. Azzag, C. Guinot, and G. Venturini. Anttree: web document clustering using artificial ants. In R. L. de M'antaras and L. Saitta, editors, Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 04), pages 480--484. IOS Press, 8 2004.Google Scholar
- T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. In Software -- Practice and Experience, volume 21, pages 1129--1164, 1991. Google ScholarDigital Library
- C. Guinot, D. J.-M. Malvy, F. Morizot, M. Tenenhaus, J. Latreille, S. Lopez, E. Tschachler, and L. Dubertret. Classification of healthy human facial skin. Textbook of Cosmetic Dermatology Third edition, 2003.Google Scholar
- H. Hacid and D. A. Zighed. An effective method for locally neighborhood graphs updating. In DEXA 2005, pages 930--939, 2005. Google ScholarDigital Library
- E.-H. Han, D. Boley, M. Gini, R. Gross, K. Hastings, G. Karypis, V. Kumar, B. Mobasher, and J. Moore. Webace: a web agent for document categorization and exploration. In AGENTS '98: Proceedings of the second international conference on Autonomous agents, pages 408--415, New York, NY, USA, 1998. ACM Press. Google ScholarDigital Library
- G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. Inf. Process. Manage., 24(5):513--523, 1988. Google ScholarDigital Library
- G. T. Toussaint. The relative neighborhood graphs in a finite planar set. In Pattern recognition, chapter 12, pages 261--268. 1980.Google Scholar
Index Terms
- On building graphs of documents with artificial ants
Recommendations
Equimatchable Graphs on Surfaces
A graph G is equimatchable if each matching in G is a subset of a maximum-size matching and it is factor critical if G-v has a perfect matching for each vertex v of G. It is known that any 2-connected equimatchable graph is either bipartite or factor ...
Color quantization with Particle swarm optimization and artificial ants
AbstractThis article describes a color quantization algorithm that combines two swarm-based methods: Particle swarm optimization and artificial ants. The proposed method is based on a previous method that solves the quantization problem by combining the ...
Restrained domination in cubic graphs
Let G =( V , E ) be a graph. A set S V is a restrained dominating set if every vertex in V S is adjacent to a vertex in S and to a vertex in V S . The restrained domination number of G , denoted r ( G ), is the smallest ...
Reviews
Suma Adabala
The task of clustering similar or related documents is important to information retrieval systems, like search engines. This is done by building graphs, where the given set of documents form the nodes and the edges represent the similarity between the documents and nodes. The authors present a graph-building algorithm that closely follows the self-assembly behavior observed when ants build living structures by connecting their bodies together. The tabulated results show that the proposed algorithm outperforms standard methods, such as relative neighborhood graphs (RNG) methods, for building graphs, while finding more similarity, that is, creating more links between documents. The key principle of the proposed algorithm is that the graph is built incrementally. When a new document is added, it follows the path of maximum similarity: it is connected to all neighboring nodes and documents whose similarity to the new document is higher than a given similarity threshold. As this is a short poster session paper, details of the algorithm and evaluation are omitted. It may be worthwhile to investigate other related publications by the authors, as the high performance of this algorithm makes it a promising substitute for current clustering algorithms. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments