Machine learningGraph mining
图核
图核是正半定核函数，通过比较两个图的共享子结构（例如随机游走、最短路径或子树模式）来衡量它们之间的相似性。Vishwanathan、Schraudolph、Kondor 和 Borgwardt (2010) 在统一框架中引入了图核，它们连接了核方法和图结构数据，使得支持向量机等算法能够直接在图上操作，而无需显式的向量化步骤。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Vishwanathan, S. V. N., Schraudolph, N. N., Kondor, R., & Borgwardt, K. M. (2010). Graph kernels. Journal of Machine Learning Research, 11, 1201–1242. link ↗
如何引用本页
ScholarGate. (2026, June 2). Graph Kernels for Structured Data. ScholarGate. https://scholargate.app/zh/network-analysis/graph-kernels
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →