Towards Effective Top-n Hamming Search Via Bipartite Graph Contrastive Hashing

Abstract

Searching on bipartite graphs serves as a fundamental task for various real-world applications, such as recommendation systems, database retrieval, and document querying. Conventional approaches rely on similarity matching in continuous Euclidean space of vectorized node embeddings. To handle intensive similarity computation efficiently, hashing techniques for graph-structured data have emerged as a prominent research direction. However, despite the retrieval efficiency in Hamming space, previous studies have encountered catastrophic performance decay. To address this challenge, we investigate the problem of hashing with Graph Convolutional Network for effective Top-N search. Our findings indicate the learning effectiveness of incorporating hashing techniques within the exploration of bipartite graph reception fields, as opposed to simply treating hashing as post-processing to output embeddings. To further enhance the model performance, we advance upon these findings and propose Bipart

Stats

• citations6
• S2 citations—
• github stars0
• HF likes0
• heat score6.34
• arxiv keychen2024towards

Related papers

• Bipartite Graph Convolutional Hashing For Effective And Efficient Top-n Search In Hamming Space (2023)8.82
• Sign-guided Bipartite Graph Hashing For Hamming Space Search (2024)0.00
• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• Learning To Hash With Graph Neural Networks For Recommender Systems (2020)14.02
• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
• Hashing As Tie-aware Learning To Rank (2017)13.11
• Hashing-accelerated Graph Neural Networks For Link Prediction (2021)11.49
• Auto-encoding Twin-bottleneck Hashing (2020)19.34