Subgraph Mining

Subgraph Mining is a graph mining task that involves discovering recurring, significant, or anomalous substructures within a graph or a collection of graphs, distinguished from other graph mining tasks by its focus on identifying patterns that are themselves graphs, smaller in size and embedded within larger graph topologies.

1.1K

Publications

64.3K

Citations

2.8K

Authors

840

Institutions

Publications per year

2017–2026

403

Authors

2.8K

  1. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    21 publications · 1.7K citations

    19

    h-index

  2. XL
    Xuemin Lin

    UNSW Sydney, Australia

    24 publications · 994 citations

    19

    h-index

  3. LQ
    Lu Qin

    University of Technology Sydney, Australia

    19 publications · 715 citations

    15

    h-index

  4. XY
    Xifeng Yan

    University of California, Santa Barbara, United States

    15 publications · 3.7K citations

    15

    h-index

  5. JX
    Jeffrey Xu Yu

    Chinese University of Hong Kong, Hong Kong SAR China

    17 publications · 728 citations

    15

    h-index

1–5 of 2.8K

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 44 publications · 3.4K citations

    28

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 31 publications · 2.3K citations

    22

    h-index

  3. arXiv (Cornell University)

    Repository · 49 publications · 2.4K citations

    21

    h-index

  4. Discrete Mathematics

    24 publications · 604 citations

    17

    h-index

  5. Journal of Combinatorial Theory Series B

    14 publications · 848 citations

    13

    h-index

1–5