Graph indexing and retrieval based on median graphs

  • Authors:
  • Francesc Serratosa;Albert Solé-Ribalta;Enric Vidiella

  • Affiliations:
  • Universitat Rovira i Virgili, Computer Science Department, Spain;Universitat Rovira i Virgili, Computer Science Department, Spain;Universitat Rovira i Virgili, Computer Science Department, Spain

  • Venue:
  • MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

M-trees are used to organize and define fast queries on large databases of Attributed Graphs. In classical schemes based on metric trees, the routing information stored in a routing tree node is a selected Attributed Graph from the sub-cluster the node represents. Depending on the sub-cluster and the application, it is difficult to select a good representative of the sub-cluster. To that aim, we propose to use Generalized Median Graphs as the main information kept in the routing nodes of the m-tree. Experimental validation shows that in database queries, the decrease of the nodes explored in the m-tree while using a Generalized Median Graph is about 20% respect using a selected Attributed Graph.