A Vectorial Representation for the Indexation of Structural Informations

  • Nicolas Sidere
  • Pierre Heroux
  • Jean-Yves Ramel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5342)

Abstract

This article presents a vectorial representation of structured data to reduce the complexity of dissimilarity computations in an information retrieval context. This representation enables, via a computation of an adapted measure, to approximate the distance between structural representations in both context of distance between graphs and searching occurrences of subgraphs. Preliminary results show that the proposed representation offers comparable performance with those of the literature.

Keywords

graph signature structured information indexation and retrieval 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Lopresti, D., Wilfong, G.: A fast technique for comparing graph representations with applications to performance evaluation. Int. J. Doc. Anal. Recognit. 6(4), 219–229 (2003)CrossRefGoogle Scholar
  2. 2.
    Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. Proceedings of the IEEE (1992)Google Scholar
  3. 3.
    Barbu, E., Heroux, P., Adam, S., Trupin, E.: Clustering document images using a bag of symbols representation, ICDAR, pp. 1216–1220 (2005)Google Scholar
  4. 4.
    Ramel, J.Y., Busson, S., Demonet, M.L.: AGORA:the Interactive Document Image Analysis Tool of the BVH Project, DIAL, pp. 145–155 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Nicolas Sidere
    • 1
    • 2
  • Pierre Heroux
    • 1
  • Jean-Yves Ramel
    • 2
  1. 1.Université de Rouen, LITIS EA 4108 BP 12Saint-Etienne du RouvrayFrance
  2. 2.Laboratoire Informatique de ToursUniversité François Rabelais ToursToursFrance

Personalised recommendations