- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper introduces CTAP, which extends subgraph representation learning to heterogeneous graphs, providing a more diverse and flexible setting.
CTAP first decomposes a shared base heterogeneous graph into node-overlap and edge-connectivity views for each node type, followed by GCN-like message passing, SeHGNN-like semantic fusion, and finally membership pooling.
Experiments show promising gains over existing homogeneous subgraph-based GNNs as well as heterogeneous GNN baselines on five datasets.
Critical strengths
- Empirical validation is conducted thoroughly.
- The illustration figures are helpful.
- Strong gains over existing baselines.
- One of the first extensions of subgraph representation learning to heterogeneous graphs.
Critical weaknesses
-
[Presentation] The challenges of extending existing methods to heterogeneous graphs are not clearly discussed in the main text. Explaining why such an extension is difficult and non-trivial should be one of the most important elements in establishing the significance of this work.
-
[Presentation] Some experiments lack informative discussion. For example, Section 6.2, "Performance with Reduced Training Data", plainly shows the superior performance of the proposed method. However, the discussion does not explain why or how CTAP is particularly effective in limited-data scenarios, nor does it justify why reducing the training data is particularly meaningful in this setting. A similar concern applies to Figure 6.
Questions for authors
-
How are homogeneous subgraph baselines (e.g., SubGNN) adapted to heterogeneous graphs, given that they typically expect homogeneous graphs as input and may not support heterogeneous features across different node types? Are the heterogeneous graphs converted into homogeneous graphs for these baselines?
-
How are node features constructed in the datasets? Heterogeneous graphs such as DBLP and Movie (IMDB) often lack intrinsic features and typically use bias features (e.g., node-type IDs or zero features), identity features (e.g., node IDs), propagated features (e.g., propagated term IDs as bag-of-words features) [1], or PLM-based term embeddings [2].
-
As discussed in [1], the choice of node features (e.g., bias features, identity features) can have a large impact on downstream performance. This may be particularly relevant to the proposed approach due to its decomposition and projection. Could the authors briefly discuss how feature construction affects the proposed method?
[1]: Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networks. KDD 2021 [2]: Open Graph Benchmark: Datasets for Machine Learning on Graphs. NIPS 2020
Hi Reviewers,
We are now near the end of the rebuttal period. If you haven't done so yet, please review the authors' responses and post a reply addressing whether their clarifications or new results resolve your concerns. Even if your score or recommendation remains unchanged, a brief note confirming what did or didn't shift your assessment—and why—is essential for the discussion and final decision. Thank you for your time and engagement.
Best regards,
Area Chair