An unsupervised cluster-level based method for learning node representations of heterogeneous graphs in scientific papers
Learning knowledge representation of scientific paper data is a problem to be solved, and how to learn the representation of paper nodes in scientific paper heterogeneous network is the core to solve this problem. This paper proposes an unsupervised cluster-level scientific paper heterogeneous graph node representation learning method (UCHL), aiming at obtaining the representation of nodes (authors, institutions, papers, etc.) in the heterogeneous graph of scientific papers. Based on the heterogeneous graph representation, this paper performs link prediction on the entire heterogeneous graph and obtains the relationship between the edges of the nodes, that is, the relationship between papers and papers. Experiments results show that the proposed method achieves excellent performance on multiple evaluation metrics on real scientific paper datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Link PredictionRepresentation LearningSimilar Papers 제목 키워드 기반
Heterogeneous Deep Graph Infomax
Graph representation learning is to learn universal node representations that preserve both node attributes and structural information. The derived node representations can be used to serve various downstream tasks, such…
ClassificationClusteringGeneral ClassificationGraph Neural Network+5Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning
Unsupervised (or self-supervised) graph representation learning is essential to facilitate various graph data mining tasks when external supervision is unavailable. The challenge is to encode the information about the gr…
ClusteringGraph Representation LearningLink PredictionNode Classification+2Heterogeneous Graph Condensation via Role-Aware Clustering
Heterogeneous Graph Neural Networks (HGNNs) have exhibited remarkable efficacy in modeling complex systems with multiple types of nodes and relations, yet their training on large-scale heterogeneous graphs remains comput…
Bilevel OptimizationGeometry Contrastive Learning on Heterogeneous Graphs
Self-supervised learning (especially contrastive learning) methods on heterogeneous graphs can effectively get rid of the dependence on supervisory data. Meanwhile, most existing representation learning methods embed the…
Contrastive LearningNode ClassificationNode ClusteringRepresentation Learning+1Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective
Self-supervised heterogeneous graph learning (SHGL) has shown promising potential in diverse scenarios. However, while existing SHGL methods share a similar essential with clustering approaches, they encounter two signif…
ClusteringGraph Learning