Skip to Main content Skip to Navigation
Book sections

Graph Embedding Using Constant Shift Embedding

Salim Jouili 1 Salvatore Tabbone 1 
1 QGAR - Querying Graphics through Analysis and Recognition
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In the literature, although structural representations (e.g. graph) are more powerful than feature vectors in terms of representational abilities, many robust and efficient methods for classification (unsupervised and supervised) have been developed for feature vector representations. In this paper, we propose a graph embedding technique based on the constant shift embedding which transforms a graph to a real vector. This technique gives the abilities to perform the graph classification tasks by procedures based on feature vectors. Through a set of experiments we show that the proposed technique outperforms the classification in the original graph domain and the other graph embedding techniques.
Document type :
Book sections
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Salim Jouili Connect in order to contact the contributor
Submitted on : Sunday, October 17, 2010 - 6:55:17 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Long-term archiving on: : Tuesday, January 18, 2011 - 2:36:11 AM


Files produced by the author(s)


  • HAL Id : inria-00526993, version 1



Salim Jouili, Salvatore Tabbone. Graph Embedding Using Constant Shift Embedding. D. Ünay, Z. Cataltepe, and S. Aksoy. International Conference on Pattern Recognition - ICPR 2010, 6388, Springer Berlin / Heidelberg, pp.83-92, 2010, Lecture Notes in Computer Science. ⟨inria-00526993⟩



Record views


Files downloads