A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition

Abstract

In recent years graph embedding has emerged as a promising solution for enabling the expressive, convenient, powerful but computa tional expensive graph based representations to benefit from mature, less expensive and efficient state of the art machine learning models of statistical pattern recognition. In this paper we present a comparison of two implicit and three explicit state of the art graph embedding methodologies. Our preliminary experimentation on different chemoinformatics datasets illustrates that the two implicit and three explicit graph embedding approaches obtain competitive performance for the problem of graph classification.
Fichier principal
Vignette du fichier
GbR2013_011.pdf (401.23 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00829226 , version 1 (08-07-2013)

Identifiers

  • HAL Id : hal-00829226 , version 1

Cite

Donatello Conte, Jean-Yves Ramel, Nicolas Sidère, Muhammad Muzzamil Luqman, Benoit Gaüzère, et al.. A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition. 9th IAPR - TC 15 workshop on Graph Based Repesentations in Pattern Recognition, May 2013, Vienne, Austria. pp.81. ⟨hal-00829226⟩
292 View
1655 Download

Share

Gmail Facebook Twitter LinkedIn More