ALPINE: Active Link Prediction using Network Embedding
- URL: http://arxiv.org/abs/2002.01227v1
- Date: Tue, 4 Feb 2020 11:09:03 GMT
- Title: ALPINE: Active Link Prediction using Network Embedding
- Authors: Xi Chen, Bo Kang, Jefrey Lijffijt and Tijl De Bie
- Abstract summary: We propose ALPINE (Active Link Prediction usIng Network Embedding) for link prediction based on network embedding.
We show that ALPINE is scalable, and boosts link prediction accuracy with far fewer queries.
- Score: 20.976178936255927
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Many real-world problems can be formalized as predicting links in a partially
observed network. Examples include Facebook friendship suggestions,
consumer-product recommendations, and the identification of hidden interactions
between actors in a crime network. Several link prediction algorithms, notably
those recently introduced using network embedding, are capable of doing this by
just relying on the observed part of the network. Often, the link status of a
node pair can be queried, which can be used as additional information by the
link prediction algorithm. Unfortunately, such queries can be expensive or
time-consuming, mandating the careful consideration of which node pairs to
query. In this paper we estimate the improvement in link prediction accuracy
after querying any particular node pair, to use in an active learning setup.
Specifically, we propose ALPINE (Active Link Prediction usIng Network
Embedding), the first method to achieve this for link prediction based on
network embedding. To this end, we generalized the notion of V-optimality from
experimental design to this setting, as well as more basic active learning
heuristics originally developed in standard classification settings. Empirical
results on real data show that ALPINE is scalable, and boosts link prediction
accuracy with far fewer queries.
Related papers
- PageRank Bandits for Link Prediction [72.61386754332776]
Link prediction is a critical problem in graph learning with broad applications such as recommender systems and knowledge graph completion.
This paper reformulates link prediction as a sequential decision-making process, where each link prediction interaction occurs sequentially.
We propose a novel fusion algorithm, PRB (PageRank Bandits), which is the first to combine contextual bandits with PageRank for collaborative exploitation and exploration.
arXiv Detail & Related papers (2024-11-03T02:39:28Z) - Parallel Reasoning Network for Human-Object Interaction Detection [53.422076419484945]
We propose a new transformer-based method named Parallel Reasoning Network(PR-Net)
PR-Net constructs two independent predictors for instance-level localization and relation-level understanding.
Our PR-Net has achieved competitive results on HICO-DET and V-COCO benchmarks.
arXiv Detail & Related papers (2023-01-09T17:00:34Z) - An Approach for Link Prediction in Directed Complex Networks based on
Asymmetric Similarity-Popularity [0.0]
This paper introduces a link prediction method designed explicitly for directed networks.
It is based on the similarity-popularity paradigm, which has recently proven successful in undirected networks.
The algorithms approximate the hidden similarities as shortest path distances using edge weights that capture and factor out the links' asymmetry and nodes' popularity.
arXiv Detail & Related papers (2022-07-15T11:03:25Z) - Link Prediction with Contextualized Self-Supervision [63.25455976593081]
Link prediction aims to infer the existence of a link between two nodes in a network.
Traditional link prediction algorithms are hindered by three major challenges -- link sparsity, node attribute noise and network dynamics.
We propose a Contextualized Self-Supervised Learning framework that fully exploits structural context prediction for link prediction.
arXiv Detail & Related papers (2022-01-25T03:12:32Z) - Adversarial Robustness of Probabilistic Network Embedding for Link
Prediction [24.335469995826244]
We study adversarial robustness of Conditional Network Embedding (CNE) for link prediction.
We measure the sensitivity of the link predictions of the model to small adversarial perturbations of the network.
Our approach allows one to identify the links and non-links in the network that are most vulnerable to such perturbations.
arXiv Detail & Related papers (2021-07-05T11:07:35Z) - Edge Proposal Sets for Link Prediction [39.33358136412426]
Link prediction aims to predict future edges or infer missing edges in the graph, and has diverse applications in recommender systems, experimental design, and complex systems.
Here, we demonstrate how simply adding a set of edges, which we call a emphproposal set, to the graph as a pre-processing step can improve the performance of several link prediction algorithms.
arXiv Detail & Related papers (2021-06-30T04:59:19Z) - 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) - Interpretable Signed Link Prediction with Signed Infomax Hyperbolic
Graph [54.03786611989613]
signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes)
We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG)
In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
arXiv Detail & Related papers (2020-11-25T05:09:03Z) - 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) - Benchmarking Network Embedding Models for Link Prediction: Are We Making
Progress? [84.43405961569256]
We shed light on the state-of-the-art of network embedding methods for link prediction.
We show, using a consistent evaluation pipeline, that only thin progress has been made over the last years.
We argue that standardized evaluation tools can repair this situation and boost future progress in this field.
arXiv Detail & Related papers (2020-02-25T16:59:09Z)
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.