Metapath Sampling in MECCH vs Random Walks for Heterogeneous Graph Classification

Abstract

Abstract: This report synthesises findings from 8 peer-reviewed papers addressing the following research question: How do different metapath sampling strategies in MECCH compare to traditional random walk sampling in heterogeneous graph node classification benchmarks like ACM or DBLP in terms of classification. Heterogeneous graph neural networks (HGNNs) were proposed for representation learning on structural data with multiple types of nodes and edges. To deal with the performance degradation issue when HGNNs become deep, researchers combine metapaths into HGNNs to associate nodes. 11 claims were extracted from source literature; 0 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 3.5/10. This report is a machine-generated literature synthesis and does not constitute original research.

Research Question

How do different metapath sampling strategies in MECCH compare to traditional random walk sampling in heterogeneous graph node classification benchmarks like ACM or DBLP in terms of classification accuracy and training efficiency?

Verification Level

Descriptive public verification status only; aggregate claim counts are public, but individual claim records are not exposed here.

Quality Tier

Descriptive public triage only; this tier does not alter current publication or DOI behavior.

Quality Dimensions

Automated triage signals derived from public fields; not human peer review or independent validation.

Correction Record

Public corrections are additive records. Current status does not claim the synthesis is error-free.

Provenance