A structural cluster kernel for learning on graphs

Madeleine Seeland, Andreas Karwath, Stefan Kramer

Research output: Contribution to conference (unpublished)Paperpeer-review

9 Citations (Scopus)


In recent years, graph kernels have received considerable interest within the machine learning and data mining community. Here, we introduce a novel approach enabling kernel methods to utilize additional information hidden in the structural neighborhood of the graphs under consideration. Our novel structural cluster kernel (SCK) incorporates similarities induced by a structural clustering algorithm to improve state-of-the-art graph kernels. The approach taken is based on the idea that graph similarity can not only be described by the similarity between the graphs themselves, but also by the similarity they possess with respect to their structural neighborhood. We applied our novel kernel in a supervised and a semi-supervised setting to regression and classification problems on a number of real-world datasets of molecular graphs. Our results show that the structural cluster similarity information can indeed leverage the prediction performance of the base kernel, particularly when the dataset is structurally sparse and consequently structurally diverse. By additionally taking into account a large number of unlabeled instances the performance of the structural cluster kernel can further be improved.
Original languageEnglish
Publication statusPublished - 2012


  • cheminformatics, clustering, data mining, kernels, QSAR, suport vector machines


Dive into the research topics of 'A structural cluster kernel for learning on graphs'. Together they form a unique fingerprint.

Cite this