TY - CONF AU - Jaume Gibert AU - Ernest Valveny AU - Horst Bunke A2 - IbPRIA ED - Vitria, Jordi ED - Sanches, João Miguel Raposo ED - Hernández, Mario PY - 2011// TI - Vocabulary Selection for Graph of Words Embedding T2 - LNCS BT - 5th Iberian Conference on Pattern Recognition and Image Analysis SP - 216 EP - 223 VL - 6669 PB - Springer CY - Berlin N2 - 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. SN - 978-3-642-21256-7 UR - http://dx.doi.org/10.1007/978-3-642-21257-4_27 N1 - DAG ID - Jaume Gibert2011 ER -