21e colloque GRETSI sur le traitement du signal et des images 11-14 septembre 2007, Troyes, France www.gretsi2007.org

Abstract

A common approach for classifying shock graphs is to use a dissimilarity measure on graphs and a distance based classifier. In this paper, we propose the use of kernel functions for data mining problems on shock graphs. The first contribution of the paper is to extend the class of graph kernel by proposing kernels based on bag of paths. Then, we propose a methodology for using these kernels for shock graphs retrieval. Our experimental results show that our approach is very competitive compared to graph matching approaches and is rather robust.