Embedding labeled graphs into occurence matrix - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Embedding labeled graphs into occurence matrix

Résumé

This paper presents an approach to the classification of structured data with graphs. We suggest to use a graph signature in order to solve the problem of complexity in measuring the distance between graphs. We choose a numerical matrix to embed both topological and labeling information. The use of this matrix allows us to use some classical tools of classification, computation of distances or feature selection. After a description of the matrix and the method to extract it, we compare the results achieved on public graph databases for the classification of symbols and letters using this graph signature.
Fichier principal
Vignette du fichier
embedding.pdf (409.38 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-00601844 , version 1 (20-06-2011)

Identifiants

  • HAL Id : hal-00601844 , version 1

Citer

Nicolas Sidère, Pierre Héroux, Jean-Yves Ramel. Embedding labeled graphs into occurence matrix. IAPR Workshop on Graphics Recognition, 2009, La Rochelle, France. pp.44-50. ⟨hal-00601844⟩
202 Consultations
113 Téléchargements

Partager

Gmail Facebook X LinkedIn More