Graph descriptors from B-matrix representation

  • Authors:
  • Wojciech Czech

  • Affiliations:
  • AGH University of Science and Technology, Kraków, Poland

  • Venue:
  • GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose graph descriptors derived from B-matrices, which are built on the basis of distances between graph vertices. The B-matrices, being invariant under graph isomorphism, are a rich source of information about graph structure. We explore this representation and propose several new graph characteristics that can be used for efficient graph comparison. Experiments on clusterization and classification with synthetic and real-world data revealed, that new descriptors allow for distinguishing graphs with non trivial structural differences. Moreover, they appear to outperform descriptors based on heat kernel matrix, being at the same time more effective computationally.