Journal article
Graph Kernels for Molecular Similarity.
- Rupp M Beilstein Endowed Chair for Cheminformatics, Goethe University, Siesmayerstr. 70, 60323 Frankfurt am Main, Germany. mrupp@mrupp.info.
- Schneider G Institute of Pharmaceutical Sciences, Eidgenössische Technische Hochschule (ETH) Zürich, Wolfgang-Pauli-Str. 10, 8093 Zürich, Switzerland.
- 2016-07-28
Published in:
- Molecular informatics. - 2010
English
Molecular similarity measures are important for many cheminformatics applications like ligand-based virtual screening and quantitative structure-property relationships. Graph kernels are formal similarity measures defined directly on graphs, such as the (annotated) molecular structure graph. Graph kernels are positive semi-definite functions, i.e., they correspond to inner products. This property makes them suitable for use with kernel-based machine learning algorithms such as support vector machines and Gaussian processes. We review the major types of kernels between graphs (based on random walks, subgraphs, and optimal assignments, respectively), and discuss their advantages, limitations, and successful applications in cheminformatics.
- Language
-
- English
- Open access status
- closed
- Identifiers
-
- DOI 10.1002/minf.200900080
- PMID 27463053
- Persistent URL
- https://sonar.ch/global/documents/265817
Statistics
Document views: 44
File downloads: