HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation

Abstract

An efficient solution to the large-scale recommender system is to represent users and items as binary hash codes in the Hamming space. Towards this end, existing methods tend to code users by modeling their Hamming similarities with the items they historically interact with, which are termed as the first-order similarities in this work. Despite their efficiency, these methods suffer from the suboptimal representative capacity, since they forgo the correlation established by connecting multiple first-order similarities, i.e., the relation among the indirect instances, which could be defined as the high-order similarity. To tackle this drawback, we propose to model both the first- and the high-order similarities in the Hamming space through the user-item bipartite graph. Therefore, we develop a novel learning to hash framework, namely Hamming Spatial Graph Convolutional Networks (HS-GCN), which explicitly models the Hamming similarity and embeds it into the codes of users and items. Exte

Stats

• citations35
• S2 citations—
• github stars0
• HF likes0
• heat score11.67
• arxiv keyliu2023hs

Related papers

• Learning To Hash With Graph Neural Networks For Recommender Systems (2020)14.02
• Combigcn: An Effective GCN Model For Recommender System (2025)6.77
• Collaborative Group-aware Hashing For Fast Recommender Systems (2025)0.00
• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
• Learning Similarity Preserving Binary Codes For Recommender Systems (2022)0.00
• Hessian-aware Quantized Node Embeddings For Recommendation (2023)2.26
• Collaborative Generative Hashing For Marketing And Fast Cold-start Recommendation (2020)7.81
• Unsupervised Graph Embeddings For Session-based Recommendation With Item Features (2025)0.00