用形式概念分析与变压器编码器高效预测二分网络链接。
BicliqueEncoder: An Efficient Method for Link Prediction in Bipartite Networks using Formal Concept Analysis and Transformer Encoder
- 基于冰山概念格和变压器编码器,减少计算开销。
- 在五个大规模数据集上表现优异,超越以往方法。
- 适合处理超大规模二分网络链接预测任务。
我们提出一种新颖高效的二分网络链接预测方法,结合形式概念分析(FCA)与Transformer编码器。该任务在电商推荐、药物-疾病互作预测等领域有广泛应用。现有基于双团(bi-cliques)的方法虽有效,但在大规模数据上因计算资源消耗大而难以扩展。为此,我们引入冰山概念格与Transformer编码器,显著降低资源需求,同时保持高预测性能。我们在五个超过以往方法容量的大规模真实数据集上验证了有效性,并在五个小数据集上与已有方法对比,结果表明本方法更高效。
原文摘要 · Abstract (English)
We propose a novel and efficient method for link prediction in bipartite networks, using \textit{formal concept analysis} (FCA) and the Transformer encoder. Link prediction in bipartite networks finds practical applications in various domains such as product recommendation in online sales, and prediction of chemical-disease interaction in medical science. Since for link prediction, the topological structure of a network contains valuable information, many approaches focus on extracting structural features and then utilizing them for link prediction. Bi-cliques, as a type of structural feature of bipartite graphs, can be utilized for link prediction. Although several link prediction methods utilizing bi-cliques have been proposed and perform well in rather small datasets, all of them face challenges with scalability when dealing with large datasets since they demand substantial computational resources. This limits the practical utility of these approaches in real-world applications. To overcome the limitation, we introduce a novel approach employing iceberg concept lattices and the Transformer encoder. Our method requires fewer computational resources, making it suitable for large-scale datasets while maintaining high prediction performance. We conduct experiments on five large real-world datasets that exceed the capacity of previous bi-clique-based approaches to demonstrate the efficacy of our method. Additionally, we perform supplementary experiments on five small datasets to compare with the previous bi-clique-based methods for bipartite link prediction and demonstrate that our method is more efficient than the previous ones.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。