Graph Feature Aggregation

Graph Feature Aggregation is a computational method that, by operating on graph-structured data, integrates node or edge features through neighborhood aggregation functions to produce enriched, holistic node representations while preserving topological dependencies.

45

Publications

1.9K

Citations

194

Authors

89

Institutions

Publications per year

2017–2026

45

Authors

194

  1. XW
    Xinchao Wang

    National University of Singapore, Singapore

    4 publications · 153 citations

    4

    h-index

  2. YY
    Yiding Yang

    Stevens Institute of Technology, United States

    4 publications · 153 citations

    4

    h-index

  3. MS
    Mingli Song

    Zhejiang University, China

    3 publications · 126 citations

    3

    h-index

  4. ZF
    Zunlei Feng

    Zhejiang University, China

    2 publications · 90 citations

    2

    h-index

  5. GS
    Guojie Song

    Peking University, China

    2 publications · 69 citations

    2

    h-index

1–5 of 194

Venues

  1. arXiv (Cornell University)

    Repository · 7 publications · 201 citations

    7

    h-index

  2. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 2 publications · 140 citations

    2

    h-index

  3. Pattern Recognition

    1 publications · 56 citations

    1

    h-index

  4. Information Fusion

    2 publications · 58 citations

    1

    h-index

  5. UTS ePRESS (University of Technology Sydney)

    Repository · 1 publications · 33 citations

    1

    h-index

1–5