BERT4FCA: A Method for Bipartite Link Prediction using Formal Concept Analysis and BERT

• URL: http://arxiv.org/abs/2402.08236v1
• Date: Tue, 13 Feb 2024 06:02:05 GMT
• Title: BERT4FCA: A Method for Bipartite Link Prediction using Formal Concept Analysis and BERT
• Authors: Siqi Peng, Hongyuan Yang, Akihiro Yamamoto
• Abstract summary: We propose BERT4FCA, a novel method for link prediction in bipartite networks, using formal concept analysis (FCA) and BERT. We conduct experiments on three real-world bipartite networks and demonstrate that our method outperforms previous FCA-based methods.
• Score: 1.104960878651584
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We propose BERT4FCA, a novel method for link prediction in bipartite networks, using formal concept analysis (FCA) and BERT. Link prediction in bipartite networks is an important task that can solve various practical problems like friend recommendation in social networks and co-authorship prediction in author-paper networks. Recent research has found that in bipartite networks, maximal bi-cliques provide important information for link prediction, and they can be extracted by FCA. Some FCA-based bipartite link prediction methods have achieved good performance. However, we figured out that their performance could be further improved because these methods did not fully capture the rich information of the extracted maximal bi-cliques. To address this limitation, we propose an approach using BERT, which can learn more information from the maximal bi-cliques extracted by FCA and use them to make link prediction. We conduct experiments on three real-world bipartite networks and demonstrate that our method outperforms previous FCA-based methods, and some classic methods such as matrix-factorization and node2vec.

Related papers

• Cyber Attacks Prevention Towards Prosumer-based EV Charging Stations: An Edge-assisted Federated Prototype Knowledge Distillation Approach [25.244719630000407]
  This paper covers two aspects: 1) cyber-attack detection on prosumers' network traffic (NT) data, and 2) cyber-attack intervention. We propose an edge-assisted federated prototype knowledge distillation (E-FPKD) approach, where each client is deployed on a dedicated local edge server (DLES) Experimental analysis demonstrates that the proposed E-FPKD can achieve the largest ODC on NSL-KDD, UNSW-NB15, and IoTID20 datasets.
  arXiv  Detail & Related papers  (2024-10-17T06:31:55Z)
• Link Prediction in Bipartite Networks [1.7446992240872337]
  We compare 19 link prediction methods able to handle bipartite graphs. We propose to repurpose recommendation systems based on graph convolutional networks (GCN) as a novel link prediction solution. Our results indicate that GCN-based personalized recommendation systems, which have received significant attention in recent years, can produce successful results for link prediction in bipartite networks.
  arXiv  Detail & Related papers  (2024-06-10T11:23:30Z)
• Faithful Explanations of Black-box NLP Models Using LLM-generated Counterfactuals [67.64770842323966]
  Causal explanations of predictions of NLP systems are essential to ensure safety and establish trust. Existing methods often fall short of explaining model predictions effectively or efficiently. We propose two approaches for counterfactual (CF) approximation.
  arXiv  Detail & Related papers  (2023-10-01T07:31:04Z)
• Improving Link Prediction in Social Networks Using Local and Global Features: A Clustering-based Approach [0.0]
  We propose an approach based on the combination of first and second group methods to tackle the link prediction problem. Our two-phase developed method firstly determines new features related to the position and dynamic behavior of nodes. Then, a subspace clustering algorithm is applied to group social objects based on the computed similarity measures.
  arXiv  Detail & Related papers  (2023-05-17T14:45:02Z)
• Binarizing Sparse Convolutional Networks for Efficient Point Cloud Analysis [93.55896765176414]
  We propose binary sparse convolutional networks called BSC-Net for efficient point cloud analysis. We employ the differentiable search strategies to discover the optimal opsitions for active site matching in the shifted sparse convolution. Our BSC-Net achieves significant improvement upon our srtong baseline and outperforms the state-of-the-art network binarization methods.
  arXiv  Detail & Related papers  (2023-03-27T13:47:06Z)
• Contrastive variational information bottleneck for aspect-based sentiment analysis [36.83876224466177]
  We propose to reduce spurious correlations for aspect-based sentiment analysis (ABSA) via a novel Contrastive Variational Information Bottleneck framework (called CVIB) The proposed CVIB framework is composed of an original network and a self-pruned network, and these two networks are optimized simultaneously via contrastive learning. Our approach achieves better performance than the strong competitors in terms of overall prediction performance, robustness, and generalization.
  arXiv  Detail & Related papers  (2023-03-06T02:52:37Z)
• Binary Graph Convolutional Network with Capacity Exploration [58.99478502486377]
  We propose a Binary Graph Convolutional Network (Bi-GCN), which binarizes both the network parameters and input node attributes. Our Bi-GCN can reduce the memory consumption by an average of 31x for both the network parameters and input data, and accelerate the inference speed by an average of 51x.
  arXiv  Detail & Related papers  (2022-10-24T12:05:17Z)
• 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)
• Learning to Perform Downlink Channel Estimation in Massive MIMO Systems [72.76968022465469]
  We study downlink (DL) channel estimation in a Massive multiple-input multiple-output (MIMO) system. A common approach is to use the mean value as the estimate, motivated by channel hardening. We propose two novel estimation methods.
  arXiv  Detail & Related papers  (2021-09-06T13:42:32Z)
• A Transductive Multi-Head Model for Cross-Domain Few-Shot Learning [72.30054522048553]
  We present a new method, Transductive Multi-Head Few-Shot learning (TMHFS), to address the Cross-Domain Few-Shot Learning challenge. The proposed methods greatly outperform the strong baseline, fine-tuning, on four different target domains.
  arXiv  Detail & Related papers  (2020-06-08T02:39:59Z)
• ALPINE: Active Link Prediction using Network Embedding [20.976178936255927]
  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.
  arXiv  Detail & Related papers  (2020-02-04T11:09:03Z)

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.