%0 Conference Proceedings
%T Multiple Classifiers for Graph of Words Embedding
%A Jaume Gibert
%A Ernest Valveny
%A Oriol Ramos Terrades
%A Horst Bunke
%E Carlo Sansone
%E Josef Kittler
%E Fabio Roli
%B 10th International Conference on Multiple Classifier Systems
%D 2011
%V 6713
%@ 978-3-642-21556-8
%F Jaume Gibert2011
%O DAG
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=1745), last updated on Thu, 17 May 2012 10:14:57 +0200
%X During the last years, there has been an increasing interest in applying the multiple classifier framework to the domain of structural pattern recognition. Constructing base classifiers when the input patterns are graph based representations is not an easy problem. In this work, we make use of the graph embedding methodology in order to construct different feature vector representations for graphs. The graph of words embedding assigns a feature vector to every graph by counting unary and binary relations between node representatives and combining these pieces of information into a single vector. Selecting different node representatives leads to different vectorial representations and therefore to different base classifiers that can be combined. We experimentally show how this methodology significantly improves the classification of graphs with respect to single base classifiers.
%U http://dx.doi.org/10.1007/978-3-642-21557-5_6
%P 36-45