.png){kind=icon}
返回
Graph kernels based on tree patterns for molecules
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-008-5086-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Motivated by chemical applications, we revisit and extend a family of positive definite kernels for graphs based on the detection of common subtrees, initially proposed by Ramon and Gartner (Proceedings of the first international workshop on mining graphs, trees and sequences, pp. 65-74, 2003). We propose new kernels with a parameter to control the complexity of the subtrees used as features to represent the graphs. This parameter allows to smoothly interpolate between classical graph kernels based on the count of common walks, on the one hand, and kernels that emphasize the detection of large common subtrees, on the other hand. We also propose two modular extensions to this formulation. The first extension increases the number of subtrees that define the feature space, and the second one removes noisy features from the graph representations. We validate experimentally these new kernels on problems of toxicity and anti-cancer activity prediction for small molecules with support vector machines.
Keyword:
Graph kernels
Support vector machines
Chemoinformatics
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
Constructing the Microbial Association Network from Large-Scale Time Series Data Using Granger Causality.png)
Genes
OAAI
GenesIF0
OAAI分享收藏分享收藏Graph kernels for molecular structure-activity relationship analysis with support vector machinesOAAI
OAAI分享收藏Complete mining of frequent patterns from graphs: Mining graph data从图中完全挖掘频繁模式: 挖掘图数据MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏
查看更多内容