Pith. sign in

REVIEW 1 cited by

Hybrid Micro/Macro Level Convolution for Heterogeneous Graph Learning

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 2012.14722 v1 pith:GCBMS3EO submitted 2020-12-29 cs.LG

classification cs.LG
keywords heterogeneousgraphsconvolutiongraphhgconvinformationnodedesigned
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Heterogeneous graphs are pervasive in practical scenarios, where each graph consists of multiple types of nodes and edges. Representation learning on heterogeneous graphs aims to obtain low-dimensional node representations that could preserve both node attributes and relation information. However, most of the existing graph convolution approaches were designed for homogeneous graphs, and therefore cannot handle heterogeneous graphs. Some recent methods designed for heterogeneous graphs are also faced with several issues, including the insufficient utilization of heterogeneous properties, structural information loss, and lack of interpretability. In this paper, we propose HGConv, a novel Heterogeneous Graph Convolution approach, to learn comprehensive node representations on heterogeneous graphs with a hybrid micro/macro level convolutional operation. Different from existing methods, HGConv could perform convolutions on the intrinsic structure of heterogeneous graphs directly at both micro and macro levels: A micro-level convolution to learn the importance of nodes within the same relation, and a macro-level convolution to distinguish the subtle difference across different relations. The hybrid strategy enables HGConv to fully leverage heterogeneous information with proper interpretability. Moreover, a weighted residual connection is designed to aggregate both inherent attributes and neighbor information of the focal node adaptively. Extensive experiments on various tasks demonstrate not only the superiority of HGConv over existing methods, but also the intuitive interpretability of our approach for graph analysis.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. MiGHT-EHR: A Multi-task Graph Transformer for Heterogeneous Temporal Electronic Health Records

    cs.LG 2026-08 reject novelty 6.0 of 10

    A heterogeneous graph transformer with temporal attention and balanced multi-task training reports state-of-the-art average performance on four EHR prediction tasks on MIMIC-III and MIMIC-IV, but the evaluation may le...

Pith tools