Graph Embedding Using Constant Shift Embedding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2010

Graph Embedding Using Constant Shift Embedding

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.
Fichier principal
Vignette du fichier
Embedding.pdf (148.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00526993 , version 1 (17-10-2010)

Identifiers

  • HAL Id : inria-00526993 , version 1

Cite

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⟩
111 View
742 Download

Share

Gmail Facebook X LinkedIn More