PULL: PU-Learning-based Accurate Link Prediction

• URL: http://arxiv.org/abs/2405.11911v1
• Date: Mon, 20 May 2024 09:47:22 GMT
• Title: PULL: PU-Learning-based Accurate Link Prediction
• Authors: Junghun Kim, Ka Hyun Park, Hoyoung Yoon, U Kang,
• Abstract summary: Given an edge-incomplete graph, how can we accurately find the missing links? We propose PULL (PU-Learning-based Link predictor), an accurate link prediction method based on the positive-unlabeled (PU) learning. PULL consistently outperforms the baselines for predicting links in edge-incomplete graphs.
• Score: 12.8532740199204
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Given an edge-incomplete graph, how can we accurately find the missing links? The link prediction in edge-incomplete graphs aims to discover the missing relations between entities when their relationships are represented as a graph. Edge-incomplete graphs are prevalent in real-world due to practical limitations, such as not checking all users when adding friends in a social network. Addressing the problem is crucial for various tasks, including recommending friends in social networks and finding references in citation networks. However, previous approaches rely heavily on the given edge-incomplete (observed) graph, making it challenging to consider the missing (unobserved) links during training. In this paper, we propose PULL (PU-Learning-based Link predictor), an accurate link prediction method based on the positive-unlabeled (PU) learning. PULL treats the observed edges in the training graph as positive examples, and the unconnected node pairs as unlabeled ones. PULL effectively prevents the link predictor from overfitting to the observed graph by proposing latent variables for every edge, and leveraging the expected graph structure with respect to the variables. Extensive experiments on five real-world datasets show that PULL consistently outperforms the baselines for predicting links in edge-incomplete graphs.

Related papers

• 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)
• Rethinking Explaining Graph Neural Networks via Non-parametric Subgraph Matching [68.35685422301613]
  We propose a novel non-parametric subgraph matching framework, dubbed MatchExplainer, to explore explanatory subgraphs. It couples the target graph with other counterpart instances and identifies the most crucial joint substructure by minimizing the node corresponding-based distance. Experiments on synthetic and real-world datasets show the effectiveness of our MatchExplainer by outperforming all state-of-the-art parametric baselines with significant margins.
  arXiv  Detail & Related papers  (2023-01-07T05:14:45Z)
• FakeEdge: Alleviate Dataset Shift in Link Prediction [16.161812856581676]
  In a link prediction task, links in the training set are always present while ones in the testing set are not yet formed, resulting in a discrepancy of the connectivity pattern and bias of the learned representation. We propose FakeEdge, a model-agnostic technique, to address the problem by mitigating the graph topological gap between training and testing sets.
  arXiv  Detail & Related papers  (2022-11-29T03:36:01Z)
• Line Graph Contrastive Learning for Link Prediction [4.876567687745239]
  We propose a Line Graph Contrastive Learning (LGCL) method to obtain multiview information. With experiments on six public datasets, LGCL outperforms current benchmarks on link prediction tasks.
  arXiv  Detail & Related papers  (2022-10-25T06:57:00Z)
• Node Classification Meets Link Prediction on Knowledge Graphs [16.37145148171519]
  We study the problems of transductive node classification over incomplete graphs and link prediction over graphs with node features. Our model performs very strongly when compared to the respective state-of-the-art models for node classification and link prediction.
  arXiv  Detail & Related papers  (2021-06-14T10:52:52Z)
• Training Robust Graph Neural Networks with Topology Adaptive Edge Dropping [116.26579152942162]
  Graph neural networks (GNNs) are processing architectures that exploit graph structural information to model representations from network data. Despite their success, GNNs suffer from sub-optimal generalization performance given limited training data. This paper proposes Topology Adaptive Edge Dropping to improve generalization performance and learn robust GNN models.
  arXiv  Detail & Related papers  (2021-06-05T13:20:36Z)
• GCN-ALP: Addressing Matching Collisions in Anchor Link Prediction [40.811988657941946]
  The problem textitanchor link prediction is formalized to link user data with the common ground on user profile, content and network structure across social networks. We propose graph convolution networks with mini-batch strategy, efficiently solving anchor link prediction on matching graph.
  arXiv  Detail & Related papers  (2021-03-19T02:41:55Z)
• Handling Missing Data with Graph Representation Learning [62.59831675688714]
  We propose GRAPE, a graph-based framework for feature imputation as well as label prediction. Under GRAPE, the feature imputation is formulated as an edge-level prediction task and the label prediction as a node-level prediction task. Experimental results on nine benchmark datasets show that GRAPE yields 20% lower mean absolute error for imputation tasks and 10% lower for label prediction tasks.
  arXiv  Detail & Related papers  (2020-10-30T17:59:13Z)
• Line Graph Neural Networks for Link Prediction [71.00689542259052]
  We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. In this formalism, a link prediction problem is converted to a graph classification task. We propose to seek a radically different and novel path by making use of the line graphs in graph theory. In particular, each node in a line graph corresponds to a unique edge in the original graph. Therefore, link prediction problems in the original graph can be equivalently solved as a node classification problem in its corresponding line graph, instead of a graph classification task.
  arXiv  Detail & Related papers  (2020-10-20T05:54:31Z)
• 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.