Pith. sign in

REVIEW 3 cited by

Heterogeneous Graph Attention Network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.07293 v2 pith:TV6KRRGT submitted 2019-03-18 cs.SI

classification cs.SI
keywords graphattentionheterogeneousnetworkimportanceneuralnodenode-level
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 metapath 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. TRAVELFRAUDBENCH: A Configurable Evaluation Framework for GNN Fraud Ring Detection in Travel Networks

    cs.LG 2026-04 unverdicted novelty 7.0 of 10

    TravelFraudBench is a new configurable benchmark for GNN-based fraud ring detection in travel networks, simulating star, clique, and chain topologies and showing GraphSAGE outperforming MLP baselines on AUC and ring recovery.

  2. Heterogeneous Sheaf Neural Networks

    cs.LG 2024-09 unverdicted novelty 7.0 of 10

    HetSheaf applies cellular sheaves and type-conditioned restriction maps to heterogeneous graphs, plus SheafPool for basis-invariant graph-level representations, delivering competitive accuracy with substantially reduc...

  3. LLM-Enhanced Hierarchical Heterogeneous Graph Representation Learning for Malicious Python Package Detection

    cs.CR 2026-07 conditional novelty 5.5 of 10

    H2GLM combines LLM-inferred function roles with hierarchical heterogeneous GNN message passing to detect and localize malicious Python packages more accurately than prior ML, graph, and LLM baselines.

Pith tools