Structured Citation Trend Prediction Using Graph Neural Networks
- URL: http://arxiv.org/abs/2104.02562v1
- Date: Tue, 6 Apr 2021 14:58:29 GMT
- Title: Structured Citation Trend Prediction Using Graph Neural Networks
- Authors: Daniel Cummings, Marcel Nassar
- Abstract summary: We present a GNN-based architecture that predicts the top set of papers at the time of publication.
For experiments, we curate a set of academic citation graphs for a variety of conferences and show that the proposed model outperforms other classic machine learning models in terms of the F1-score.
- Score: 6.325999141414098
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Academic citation graphs represent citation relationships between
publications across the full range of academic fields. Top cited papers
typically reveal future trends in their corresponding domains which is of
importance to both researchers and practitioners. Prior citation prediction
methods often require initial citation trends to be established and do not take
advantage of the recent advancements in graph neural networks (GNNs). We
present GNN-based architecture that predicts the top set of papers at the time
of publication. For experiments, we curate a set of academic citation graphs
for a variety of conferences and show that the proposed model outperforms other
classic machine learning models in terms of the F1-score.
Related papers
- 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) - 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) - Citation Trajectory Prediction via Publication Influence Representation
Using Temporal Knowledge Graph [52.07771598974385]
Existing approaches mainly rely on mining temporal and graph data from academic articles.
Our framework is composed of three modules: difference-preserved graph embedding, fine-grained influence representation, and learning-based trajectory calculation.
Experiments are conducted on both the APS academic dataset and our contributed AIPatent dataset.
arXiv Detail & Related papers (2022-10-02T07:43:26Z) - Discovering the Representation Bottleneck of Graph Neural Networks from
Multi-order Interactions [51.597480162777074]
Graph neural networks (GNNs) rely on the message passing paradigm to propagate node features and build interactions.
Recent works point out that different graph learning tasks require different ranges of interactions between nodes.
We study two common graph construction methods in scientific domains, i.e., emphK-nearest neighbor (KNN) graphs and emphfully-connected (FC) graphs.
arXiv Detail & Related papers (2022-05-15T11:38:14Z) - 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) - Benchmarking Graph Neural Networks on Link Prediction [80.2049358846658]
We benchmark several existing graph neural network (GNN) models on different datasets for link predictions.
Our experiments show these GNN architectures perform similarly on various benchmarks for link prediction tasks.
arXiv Detail & Related papers (2021-02-24T20:57:16Z) - Longitudinal Citation Prediction using Temporal Graph Neural Networks [27.589741169713825]
We introduce the task of sequence citation prediction.
The goal is to accurately predict the trajectory of the number of citations a scholarly work receives over time.
arXiv Detail & Related papers (2020-12-10T15:25:16Z) - A comparative study of similarity-based and GNN-based link prediction
approaches [1.0441880303257467]
The graph neural network (GNN) is able to learn hidden features from graphs which can be used for link prediction task in graphs.
This paper studies some similarity and GNN-based link prediction approaches in the domain of homogeneous graphs.
arXiv Detail & Related papers (2020-08-20T10:41:53Z) - Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph
Link Prediction [69.1473775184952]
We introduce a realistic problem of few-shot out-of-graph link prediction.
We tackle this problem with a novel transductive meta-learning framework.
We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
arXiv Detail & Related papers (2020-06-11T17:42:46Z)
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.