Heterogeneous information network (HIN) has been widely used to characterize entities of
various types and their complex relations. Recent attempts either rely on explicit path
reachability to leverage path-based semantic relatedness or graph neighborhood to learn
heterogeneous network representations before predictions. These weakly coupled manners
overlook the rich interactions among neighbor nodes, which introduces an early
summarization issue. In this article, we propose GraphHINGE (H eterogeneous IN teract and …