GCN-ALP: Addressing Matching Collisions in Anchor Link Prediction
- URL: http://arxiv.org/abs/2103.10600v1
- Date: Fri, 19 Mar 2021 02:41:55 GMT
- Title: GCN-ALP: Addressing Matching Collisions in Anchor Link Prediction
- Authors: Hao Gao, Yongqing Wang, Shanshan Lyu, Huawei Shen, Xueqi Cheng
- Abstract summary: 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.
- Score: 40.811988657941946
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Nowadays online users prefer to join multiple social media for the purpose of
socialized online service. The problem \textit{anchor link prediction} is
formalized to link user data with the common ground on user profile, content
and network structure across social networks. Most of the traditional works
concentrated on learning matching function with explicit or implicit features
on observed user data. However, the low quality of observed user data confuses
the judgment on anchor links, resulting in the matching collision problem in
practice. In this paper, we explore local structure consistency and then
construct a matching graph in order to circumvent matching collisions.
Furthermore, we propose graph convolution networks with mini-batch strategy,
efficiently solving anchor link prediction on matching graph. The experimental
results on three real application scenarios show the great potentials of our
proposed method in both prediction accuracy and efficiency. In addition, the
visualization of learned embeddings provides us a qualitative way to understand
the inference of anchor links on the matching graph.
Related papers
- PULL: PU-Learning-based Accurate Link Prediction [12.8532740199204]
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.
arXiv Detail & Related papers (2024-05-20T09:47:22Z) - CONVERT:Contrastive Graph Clustering with Reliable Augmentation [110.46658439733106]
We propose a novel CONtrastiVe Graph ClustEring network with Reliable AugmenTation (CONVERT)
In our method, the data augmentations are processed by the proposed reversible perturb-recover network.
To further guarantee the reliability of semantics, a novel semantic loss is presented to constrain the network.
arXiv Detail & Related papers (2023-08-17T13:07:09Z) - Drop Edges and Adapt: a Fairness Enforcing Fine-tuning for Graph Neural
Networks [9.362130313618797]
Link prediction algorithms tend to disfavor the links between individuals in specific demographic groups.
This paper proposes a novel way to enforce fairness on graph neural networks with a fine-tuning strategy.
One novelty of DEA is that we can use a discrete yet learnable adjacency matrix in our fine-tuning.
arXiv Detail & Related papers (2023-02-22T16:28:08Z) - 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) - 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) - 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) - Joint Graph Learning and Matching for Semantic Feature Correspondence [69.71998282148762]
We propose a joint emphgraph learning and matching network, named GLAM, to explore reliable graph structures for boosting graph matching.
The proposed method is evaluated on three popular visual matching benchmarks (Pascal VOC, Willow Object and SPair-71k)
It outperforms previous state-of-the-art graph matching methods by significant margins on all benchmarks.
arXiv Detail & Related papers (2021-09-01T08:24:02Z) - Locate Who You Are: Matching Geo-location to Text for Anchor Link
Prediction [40.654494490237]
We propose a novel anchor link prediction framework for matching users across networks.
Our approach outperforms existing methods and achieves state-of-the-art results.
arXiv Detail & Related papers (2021-04-19T08:15:28Z) - 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)
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.