Graph Kernels

Graph Kernels is a class of kernel methods in machine learning that measures similarity between graphs by mapping them into a high-dimensional feature space through subtree patterns, random walks, or other graph-based structures.

460

Publications

38K

Citations

1.1K

Authors

492

Institutions

Publications per year

2017–2026

187

Authors

1.1K

  1. KB
    Karsten Borgwardt

    ETH Zurich, Switzerland

    14 publications · 4.2K citations

    14

    h-index

  2. SS
    Saket Saurabh

    Institute of Mathematical Sciences, India

    14 publications · 530 citations

    12

    h-index

  3. ER
    Edwin R. Hancock

    University of York, United Kingdom

    14 publications · 874 citations

    12

    h-index

  4. HG
    Hortensia Galeana‐Sánchez

    Universidad Nacional Autónoma de México, Mexico

    10 publications · 197 citations

    10

    h-index

  5. FV
    Fedor V. Fomin

    University of Bergen, Norway

    10 publications · 455 citations

    10

    h-index

1–5 of 1.1K

Venues

  1. arXiv (Cornell University)

    Repository · 49 publications · 4.3K citations

    29

    h-index

  2. Discrete Mathematics

    13 publications · 291 citations

    11

    h-index

  3. Pattern Recognition

    11 publications · 860 citations

    11

    h-index

  4. ACM Transactions on Algorithms

    TALG · 9 publications · 632 citations

    9

    h-index

  5. 8

    h-index

1–5