H2CGL: Modeling Dynamics of Citation Network for Impact Prediction
- URL: http://arxiv.org/abs/2305.01572v3
- Date: Sun, 15 Oct 2023 15:21:35 GMT
- Title: H2CGL: Modeling Dynamics of Citation Network for Impact Prediction
- Authors: Guoxiu He, Zhikai Xue, Zhuoren Jiang, Yangyang Kang, Star Zhao, Wei Lu
- Abstract summary: We construct hierarchical and heterogeneous graphs for target papers with an annual perspective.
The graphs can record the annual dynamics of target papers' scientific context information.
A novel graph neural network, Hierarchical and Heterogeneous Contrastive Graph Learning Model, is proposed.
- Score: 13.00224680454585
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The potential impact of a paper is often quantified by how many citations it
will receive. However, most commonly used models may underestimate the
influence of newly published papers over time, and fail to encapsulate this
dynamics of citation network into the graph. In this study, we construct
hierarchical and heterogeneous graphs for target papers with an annual
perspective. The constructed graphs can record the annual dynamics of target
papers' scientific context information. Then, a novel graph neural network,
Hierarchical and Heterogeneous Contrastive Graph Learning Model (H2CGL), is
proposed to incorporate heterogeneity and dynamics of the citation network.
H2CGL separately aggregates the heterogeneous information for each year and
prioritizes the highly-cited papers and relationships among references,
citations, and the target paper. It then employs a weighted GIN to capture
dynamics between heterogeneous subgraphs over years. Moreover, it leverages
contrastive learning to make the graph representations more sensitive to
potential citations. Particularly, co-cited or co-citing papers of the target
paper with large citation gap are taken as hard negative samples, while
randomly dropping low-cited papers could generate positive samples. Extensive
experimental results on two scholarly datasets demonstrate that the proposed
H2CGL significantly outperforms a series of baseline approaches for both
previously and freshly published papers. Additional analyses highlight the
significance of the proposed modules. Our codes and settings have been released
on Github (https://github.com/ECNU-Text-Computing/H2CGL)
Related papers
- Reproducibility Study Of Learning Fair Graph Representations Via Automated Data Augmentations [0.0]
We explore the performance of the Graphair framework in link prediction tasks.
Our findings underscore Graphair's potential for wider adoption in graph-based learning.
arXiv Detail & Related papers (2024-08-31T11:28:22Z) - Temporal Graph Neural Network-Powered Paper Recommendation on Dynamic Citation Networks [4.666226480911492]
This paper introduces a temporal dimension to paper recommendation strategies.
The core idea is to continuously update a paper's embedding when new citation relationships appear.
A learnable memory update module based on a Recurrent Neural Network (RNN) is utilized to study the evolution of the embedding.
arXiv Detail & Related papers (2024-08-27T19:10:21Z) - Predicting Scientific Impact Through Diffusion, Conformity, and Contribution Disentanglement [11.684776349325887]
Existing models typically rely on static graphs for citation count estimation.
We introduce a novel model, DPPDCC, which Disentangles the Potential impacts of Papers into Diffusion, Conformity, and Contribution values.
arXiv Detail & Related papers (2023-11-15T07:21:11Z) - Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
We present a code that successfully replicates results from six popular and recent graph recommendation models.
We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations.
By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
arXiv Detail & Related papers (2023-08-01T09:31:44Z) - Modeling Dynamic Heterogeneous Graph and Node Importance for Future
Citation Prediction [26.391252682418607]
We propose a Dynamic heterogeneous Graph and Node Importance network (DGNI) learning framework to predict future citation trends of newly published papers.
First, a dynamic heterogeneous network embedding module is provided to capture the dynamic evolutionary trends of the whole academic network.
A node importance embedding module is proposed to capture the global consistency relationship to figure out each paper's node importance.
arXiv Detail & Related papers (2023-05-27T08:53:26Z) - You Only Transfer What You Share: Intersection-Induced Graph Transfer
Learning for Link Prediction [79.15394378571132]
We investigate a previously overlooked phenomenon: in many cases, a densely connected, complementary graph can be found for the original graph.
The denser graph may share nodes with the original graph, which offers a natural bridge for transferring selective, meaningful knowledge.
We identify this setting as Graph Intersection-induced Transfer Learning (GITL), which is motivated by practical applications in e-commerce or academic co-authorship predictions.
arXiv Detail & Related papers (2023-02-27T22:56:06Z) - A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic,
and Multimodal [57.8455911689554]
Knowledge graph reasoning (KGR) aims to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs)
It has been proven to significantly benefit the usage of KGs in many AI applications, such as question answering, recommendation systems, and etc.
arXiv Detail & Related papers (2022-12-12T08:40:04Z) - Scientific Paper Extractive Summarization Enhanced by Citation Graphs [50.19266650000948]
We focus on leveraging citation graphs to improve scientific paper extractive summarization under different settings.
Preliminary results demonstrate that citation graph is helpful even in a simple unsupervised framework.
Motivated by this, we propose a Graph-based Supervised Summarization model (GSS) to achieve more accurate results on the task when large-scale labeled data are available.
arXiv Detail & Related papers (2022-12-08T11:53:12Z) - Graph Neural Networks for Graphs with Heterophily: A Survey [98.45621222357397]
We provide a comprehensive review of graph neural networks (GNNs) for heterophilic graphs.
Specifically, we propose a systematic taxonomy that essentially governs existing heterophilic GNN models.
We discuss the correlation between graph heterophily and various graph research domains, aiming to facilitate the development of more effective GNNs.
arXiv Detail & Related papers (2022-02-14T23:07:47Z) - Enhancing Scientific Papers Summarization with Citation Graph [78.65955304229863]
We redefine the task of scientific papers summarization by utilizing their citation graph.
We construct a novel scientific papers summarization dataset Semantic Scholar Network (SSN) which contains 141K research papers in different domains.
Our model can achieve competitive performance when compared with the pretrained models.
arXiv Detail & Related papers (2021-04-07T11:13:35Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.