图 书 馆
快速子树核图Fast Subtree Kernels on Graphs |
|
| 课程网址: | http://videolectures.net/nips09_shervashidze_fsk/ |
| 主讲教师: | Nino Shervashidze |
| 开课单位: | 马克斯普朗克研究所 |
| 开课时间: | 2009-12-09 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | In this article, we propose fast subtree kernels on graphs. On graphs with n nodes and m edges and maximum degree d, these kernels comparing subtrees of height h can be computed in O(mh), whereas the classic subtree kernel by Ramon & Gärtner scales as O(n24dh). Key to this efficiency is the observation that the Weisfeiler-Lehman test of isomorphism from graph theory elegantly computes a subtree kernel as a byproduct. Our fast subtree kernels can deal with labeled graphs, scale up easily to large graphs and outperform state-of-the-art graph kernels on several classification benchmark datasets in terms of accuracy and runtime. |
| 关 键 词: | 计算机科学; 机器学习; 核方法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2021-01-08：yumf |
| 阅读次数: | 27 |