ACM Home Page
Please provide us with feedback. Feedback
On building graphs of documents with artificial ants
Full text PdfPdf (675 KB)
Source
International World Wide Web Conference archive
Proceedings of the 16th international conference on World Wide Web table of contents
Banff, Alberta, Canada
POSTER SESSION: Systems table of contents
Pages: 1299 - 1300  
Year of Publication: 2007
ISBN:978-1-59593-654-7
Authors
Hanane Azzag  Laboratoire d'Informatique de l'Université de Paris-Nord, Villetaneuse, France
Julien Lavergne  Laboratoire d'Informatique de l'Université de Tours, Tours, France
Christiane Guinot  CE.R.I.E.S., Neuilly sur Seine, France
Gilles Venturini  Laboratoire d'Informatique de l'Université de Tours, Tours, France
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 52,   Citation Count: 0
Additional Information:

abstract   references   index terms   review   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1242572.1242818
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
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.
 
2
 
3
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.
 
4
H. Hacid and D. A. Zighed. An effective method for locally neighborhood graphs updating. In DEXA 2005, pages 930--939, 2005.
5
 
6
 
7
G. T. Toussaint. The relative neighborhood graphs in a finite planar set. In Pattern recognition, chapter 12, pages 261--268. 1980.


REVIEW

"Suma Adabala : Reviewer"

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  more...

Collaborative Colleagues:
Hanane Azzag: colleagues
Julien Lavergne: colleagues
Christiane Guinot: colleagues
Gilles Venturini: colleagues