%0 Conference Proceedings
%T Vocabulary Selection for Graph of Words Embedding
%A Jaume Gibert
%A Ernest Valveny
%A Horst Bunke
%E Vitria, Jordi
%E Sanches, João Miguel Raposo
%E Hernández, Mario
%B 5th Iberian Conference on Pattern Recognition and Image Analysis
%D 2011
%V 6669
%I Springer
%C Berlin
%@ 978-3-642-21256-7
%F Jaume Gibert2011
%O DAG
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=1744), last updated on Thu, 17 May 2012 10:14:08 +0200
%X The Graph of Words Embedding consists in mapping every graph in a given dataset to a feature vector by counting unary and binary relations between node attributes of the graph. It has been shown to perform well for graphs with discrete label alphabets. In this paper we extend the methodology to graphs with n-dimensional continuous attributes by selecting node representatives. We propose three different discretization procedures for the attribute space and experimentally evaluate the dependence on both the selector and the number of node representatives. In the context of graph classification, the experimental results reveal that on two out of three public databases the proposed extension achieves superior performance over a standard reference system.
%U http://dx.doi.org/10.1007/978-3-642-21257-4_27
%P 216-223