%0 Journal Article
%T Feature Selection on Node Statistics Based Embedding of Graphs
%A Jaume Gibert
%A Ernest Valveny
%A Horst Bunke
%J Pattern Recognition Letters
%D 2012
%V 33
%N 15
%F Jaume Gibert2012
%O DAG
%O exported from refbase (http://refbase.cvc.uab.es/show.php?record=1993), last updated on Thu, 13 Mar 2014 15:56:29 +0100
%X Representing a graph with a feature vector is a common way of making statistical machine learning algorithms applicable to the domain of graphs. Such a transition from graphs to vectors is known as graphembedding. A key issue in graphembedding is to select a proper set of features in order to make the vectorial representation of graphs as strong and discriminative as possible. In this article, we propose features that are constructed out of frequencies of node label representatives. We first build a large set of features and then select the most discriminative ones according to different ranking criteria and feature transformation algorithms. On different classification tasks, we experimentally show that only a small significant subset of these features is needed to achieve the same classification rates as competing to state-of-the-art methods.
%K Structural pattern recognition
%K Graph embedding
%K Feature ranking
%K PCA
%K Graph classification
%U http://refbase.cvc.uab.es/files/GVB2012b.pdf
%U http://dx.doi.org/10.1016/j.patrec.2012.03.017
%P 1980–1990