Cited by 3,191Advanced Graph Neural NetworksGraph Theory and AlgorithmsRecommender Systems and Techniques

Heterogeneous Graph Attention Network

Open access
Wang, Xiao, Ji, Houye, Shi, Chuan, Wang, Bai, Ye, Yanfang, Cui, Peng, Yu, Philip S·2019·The World Wide Web Conference

Abstract

Graph neural network, as a powerful graph representation technique based on deep learning, has shown superior performance and attracted considerable research interest. However, it has not been fully considered in graph neural network for heterogeneous graph which contains different types of nodes and links. The heterogeneity and rich semantic information bring great challenges for designing a graph neural network for heterogeneous graph. Recently, one of the most exciting advancements in deep learning is the attention mechanism, whose great potential has been well demonstrated in various areas. In this paper, we first propose a novel heterogeneous graph neural network based on the hierarchical attention, including node-level and semantic-level attentions. Specifically, the node-level attention aims to learn the importance between a node and its meta-path based neighbors, while the semantic-level attention is able to learn the importance of different meta-paths. With the learned importance from both node-level and semantic-level attention, the importance of node and meta-path can be fully considered. Then the proposed model can generate node embedding by aggregating features from meta-path based neighbors in a hierarchical manner. Extensive experimental results on three real-world heterogeneous graphs not only show the superior performance of our proposed model over the state-of-the-arts, but also demonstrate its potentially good interpretability for graph analysis.

Integrity signals

Registry

Crossref · 10.1145/3308558.3313562

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Detecting edge anomalies requires sensitivity to both relational semantics and temporal evolution; HGNN-based models address this by learning edge-aware representations, capturing interaction dynamics across time, and incorporating context through attention-based aggregation mechanisms.

    “Detecting these anomalies requires sensitivity to both relational semantics and temporal evolution. HGNN-based models address this by learning edge-aware representations, capturing interaction dynamics across time, and incorporating context through attention-based aggregation mechanisms. [18], [33]”
  • Traditional homogeneous graphs assume a single type of node and relation, which limits their expressiveness in real-world scenarios.

    “Traditional homogeneous graphs assume a single type of node and relation, which limits their expressiveness in real-world scenarios.”
  • Heterogeneous graphs support multiple node and edge types, capturing rich semantic information essential for modeling diverse cybersecurity behaviors.

    “In contrast, heterogeneous graphs [18], [19] involve multiple types of nodes and/or edges.”
  • Several obstacles remain before heterogeneous graph neural network methods for anomaly detection can be reliably deployed in real-world cybersecurity systems.

    “Despite notable progress in heterogeneous graph neural networks (HGNNs) for anomaly detection, several obstacles remain before such methods can be reliably deployed in real-world cybersecurity systems [3], [18], [75].”
  • Generating representations of atoms, distances, and angles propagated along a molecular graph has allowed identification of the angle and direction of interactions between atoms.

    “For example, generating representations of the atoms, distances, and angles to be propagated along the molecular graph has allowed us to identify the angle and direction of interactions between atoms [84].”

    From Graph representation learning in biomedicine and healthcare (2022) · cites this paper as [84]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Wang, X., Ji, H., Shi, C., Wang, B., Ye, Y., Cui, P., & Yu, P. S.
Affiliations
  • Beijing University of Posts and Telecommunications (CN)
  • West Virginia University (US)
  • Tsinghua University (CN)
  • University of Illinois Chicago (US)
Venue
The World Wide Web Conference
Publisher
ACM
Published
2019-05-13
Pages
2022-2032
OpenAlex
W2911286998
Cited by
3,191
References
35
Citations by year
2026: 392 · 2025: 618 · 2024: 561 · 2023: 561 · 2022: 444 · 2021: 408 · 2020: 184 · 2019: 21 · 2018: 1
FWCI
101.12
Type
conference paper
Language
en
Open access
Locations
  • International World Wide Web Conference (WWW) (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Tencent
  • National Natural Science Foundation of China (61702296, 61532006, 61772082)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Graph Theory and Algorithms
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
Keywords
heterogeneous graph neural networks, graph attention networks, hierarchical attention, meta-paths, node embeddings, feature aggregation, interpretability

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review