Graph kernels for chemoinformatics – a critical discussion
Journal of Cheminformatics volume 3, Article number: O8 (2011)
We analyze the use, advantages, and drawbacks of graph kernels in chemoin-formatics, including a comparison of kernel-based approaches with other methodology, as well as examples of applications.
Kernel-based machine learning , now widely applied in chemoinformatics, delivers state-of-the-art performance  in tasks like classification and regression. Molecular graph kernels  are a recent development where kernels are defined directly on the molecular structure graph. This allows the adaptation of methods from graph theory to structure graphs and their direct use with kernel learning algorithms. The main advantage of kernel learning, the so-called "kernel trick", allows for a systematic, computationally feasible, and often globally optimal search for non-linear patterns, as well as the direct use of non-numerical inputs such as strings and graphs. A drawback is that solutions are expressed indirectly in terms of similarity to training samples, and runtimes that are typically quadratic or cubic in the number of training samples.
Graph kernels  are positive semidefinite functions defined directly on graphs. The most important types are based on random walks, subgraph patterns, optimal assignments, and graphlets. Molecular structure graphs have strong properties that can be exploited , e.g., they are undirected, have no self-loops and no multiple edges, are connected (except for salts), annotated, often planar in the graph-theoretic sense, and their vertex degree is bounded by a small constant. In many applications, they are small. Many graph kernels are general-purpose, some are suitable for structure graphs, and a few have been explicitly designed for them.
We present three exemplary applications of the iterative similarity optimal assignment kernel , which was designed for the comparison of small structure graphs: The discovery of novel agonists of the peroxisome proliferator-activated receptor γ  (ligand-based virtual screening), the estimation of acid dissociation constants  (quantitative structure-property relationships), and molecular de novo design .
Hofmann T, Schölkopf B, Smola A: Kernel methods in machine learning. Ann Stat. 2008, 36 (6): 1171-1220. 10.1214/009053607000000677.
Invanciuc O: Applications of Support Vector Machines in Chemistry. Reviews in Computational Chemistry 23. Edited by: Lipkowitz K, Cundari T. 2007, Weinheim: Wiley-VCH, 291-400. full_text.
Rupp M, Schneider G: Graph kernels for molecular similarity. Mol Inf. 2010, 29 (4): 266-273.
Rupp M: Kernel Methods for Virtual Screening. PhD thesis. 2009
Rupp M, Proschak E, Schneider G: Kernel approach to molecular similarity based on iterative graph similarity. J Chem Inf Model. 2007, 47 (6): 2280-2286. 10.1021/ci700274r.
Rupp M, Schroeter T, Steri R, Zettl H, Proschak E, Hansen K, Rau O, Schwarz O, Müller-Kuhrt L, Schubert-Zsilavecz M, Müller K-R, Schneider G: From machine learning to natural produt derivatives selectively activating transcription factor PPARg. ChemMedChem. 2010, 5 (2): 191-194. 10.1002/cmdc.200900469.
Rupp M, Körner R, Tetko I: 2010, submitted
Hartenfeller M, Schneider G: De novo drug design. Meth Mol Biol. 2011, 672: 299-323. full_text.
About this article
Cite this article
Rupp, M. Graph kernels for chemoinformatics – a critical discussion. J Cheminform 3 (Suppl 1), O8 (2011). https://doi.org/10.1186/1758-2946-3-S1-O8
- Virtual Screening
- Structure Graph
- Optimal Assignment
- Kernel Learning
- Acid Dissociation Constant