Hashing-accelerated Graph Neural Networks For Link Prediction

Abstract

Networks are ubiquitous in the real world. Link prediction, as one of the key problems for network-structured data, aims to predict whether there exists a link between two nodes. The traditional approaches are based on the explicit similarity computation between the compact node representation by embedding each node into a low-dimensional space. In order to efficiently handle the intensive similarity computation in link prediction, the hashing technique has been successfully used to produce the node representation in the Hamming space. However, the hashing-based link prediction algorithms face accuracy loss from the randomized hashing techniques or inefficiency from the learning to hash techniques in the embedding process. Currently, the Graph Neural Network (GNN) framework has been widely applied to the graph-related tasks in an end-to-end manner, but it commonly requires substantial computational resources and memory costs due to massive parameter learning, which makes the GNN-based

Stats

• citations33
• S2 citations—
• github stars0
• HF likes0
• heat score11.49
• arxiv keywu2021hashing

Related papers

• Position-based Hash Embeddings For Scaling Graph Neural Networks (2021)2.26
• Learning To Hash With Graph Neural Networks For Recommender Systems (2020)14.02
• Embedding Compression With Hashing For Efficient Representation Learning In Large-scale Graph (2022)8.60
• Deep Hashing For Signed Social Network Embedding (2019)0.00
• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• Towards Effective Top-n Hamming Search Via Bipartite Graph Contrastive Hashing (2024)6.34
• Bipartite Graph Convolutional Hashing For Effective And Efficient Top-n Search In Hamming Space (2023)8.82
• Hessian-aware Quantized Node Embeddings For Recommendation (2023)2.26