Graph-level Embeddings

Graph-Level Embeddings is a graph representation learning technique that generates a single, fixed-dimensional vector summarizing the global structural and semantic properties of an entire graph, distinguishing it from node- or edge-level embedding methods by capturing holistic topological patterns.

135

Publications

10.3K

Citations

547

Authors

195

Institutions

Publications per year

2017–2026

123

Authors

547

  1. HP
    Hao Peng

    Beihang University, China

    7 publications · 453 citations

    7

    h-index

  2. YS
    Yizhou Sun

    University of California, Los Angeles, United States

    6 publications · 508 citations

    6

    h-index

  3. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    6 publications · 3.2K citations

    6

    h-index

  4. WW
    Wei Wang

    University of California, Los Angeles, United States

    6 publications · 508 citations

    6

    h-index

  5. YB
    Yunsheng Bai

    University of California, Los Angeles, United States

    6 publications · 508 citations

    6

    h-index

1–5 of 547

Venues

  1. arXiv (Cornell University)

    Repository · 17 publications · 899 citations

    13

    h-index

  2. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 8 publications · 924 citations

    8

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 7 publications · 322 citations

    7

    h-index

  4. Pattern Recognition

    5 publications · 229 citations

    5

    h-index

  5. Knowledge-Based Systems

    5 publications · 243 citations

    5

    h-index

1–5