Automated message selection for robust Heterogeneous Graph Contrastive Learning

Published: 2025, Last Modified: 22 Jan 2026Knowl. Based Syst. 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Robustness of heterogeneous graph contrastive learning has not been studied yet.•Automated message selection resists the harmful messages.•The selection performs in relation and meta-path views to protect complex features.•The categorical distribution enhances the interpretability of robust learning.•A novel cross-view contrastive loss function is proposed for model optimization.
Loading