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.
Chapter PDF
Similar content being viewed by others
References
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)
Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. Proceedings of the IEEE (1992)
Barbu, E., Heroux, P., Adam, S., Trupin, E.: Clustering document images using a bag of symbols representation, ICDAR, pp. 1216–1220 (2005)
Ramel, J.Y., Busson, S., Demonet, M.L.: AGORA:the Interactive Document Image Analysis Tool of the BVH Project, DIAL, pp. 145–155 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sidere, N., Heroux, P., Ramel, JY. (2008). A Vectorial Representation for the Indexation of Structural Informations. In: da Vitoria Lobo, N., et al. Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2008. Lecture Notes in Computer Science, vol 5342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89689-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-89689-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89688-3
Online ISBN: 978-3-540-89689-0
eBook Packages: Computer ScienceComputer Science (R0)