Optimal assignment kernels for attributed molecular graphs

We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another one, including information on neighborhood, membership to a certain structural element and other characteristics for each atom. As a byproduct this leads to a new class of kernel functions. We demonstrate how the necessary computations can be carried out efficiently. Compared to marginalized graph kernels our method in some cases leads to a significant reduction of the prediction error. Further improvement can be gained, if expert knowledge is combined with our method. We also investigate a reduced graph representation of molecules by collapsing certain structural elements, like e.g. rings, into a single node of the molecular graph.

• Type: Conference
• Year: 2005
• Where: ICML
• Authors: Andreas Zell, Florian Sieker, Holger Fröhlich, Jörg K. Wegner
• Keywords: Certain Structural Element, Certain Structural Elements, ICML 2005, Machine Learning, Reduced Graph Representation