Graph Embeddings

Graph Embeddings is a computational technique that maps the structural and semantic information of a graph into a low-dimensional vector space while preserving its topological properties and relational patterns.

2.5K

Publications

203.3K

Citations

6.3K

Authors

1.4K

Institutions

Publications per year

2017–2026

1.7K

Authors

6.3K

  1. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    32 publications · 2.2K citations

    22

    h-index

  2. JH
    Jiawei Han

    University of Illinois Urbana-Champaign, United States

    22 publications · 1.5K citations

    18

    h-index

  3. SP
    Shirui Pan

    Monash University, Australia

    20 publications · 2.5K citations

    17

    h-index

  4. PC
    Peng Cui

    Tsinghua University, China

    18 publications · 7.1K citations

    17

    h-index

  5. YS
    Yizhou Sun

    University of California, Los Angeles, United States

    18 publications · 1.6K citations

    17

    h-index

1–5 of 6.3K

Venues

  1. arXiv (Cornell University)

    Repository · 302 publications · 26.1K citations

    68

    h-index

  2. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 87 publications · 21.9K citations

    50

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 68 publications · 9.6K citations

    34

    h-index

  4. Pattern Recognition

    46 publications · 2.9K citations

    29

    h-index

  5. 26

    h-index

1–5