Bipartite Graph Convolutional Hashing For Effective And Efficient Top-n Search In Hamming Space
2023 · Yankai Chen, Yixiang Fang, Yifei Zhang, et al.
Abstract
Searching on bipartite graphs is basal and versatile to many real-world Web applications, e.g., online recommendation, database retrieval, and query-document searching. Given a query node, the conventional approaches rely on the similarity matching with the vectorized node embeddings in the continuous Euclidean space. To efficiently manage intensive similarity computation, developing hashing techniques for graph structured data has recently become an emerging research direction. Despite the retrieval efficiency in Hamming space, prior work is however confronted with catastrophic performance decay. In this work, we investigate the problem of hashing with Graph Convolutional Network on bipartite graphs for effective Top-N search. We propose an end-to-end Bipartite Graph Convolutional Hashing approach, namely BGCH, which consists of three novel and effective modules: (1) adaptive graph convolutional hashing, (2) latent feature dispersion, and (3) Fourier serialized gradient estimation. Sp
Authors
(none)
Tags
Stats
Related papers
- Towards Effective Top-n Hamming Search Via Bipartite Graph Contrastive Hashing (2024)6.34
- Sign-guided Bipartite Graph Hashing For Hamming Space Search (2024)0.00
- HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
- Multiple Code Hashing For Efficient Image Retrieval (2020)0.00
- Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
- Hashing-accelerated Graph Neural Networks For Link Prediction (2021)11.49
- Query-adaptive Hash Code Ranking For Large-scale Multi-view Visual Search (2019)13.74
- Comprehensive Graph-conditional Similarity Preserving Network For Unsupervised Cross-modal Hashing (2020)3.14