Collaborative Group-aware Hashing For Fast Recommender Systems

Abstract

The fast online recommendation is critical for applications with large-scale databases; meanwhile, it is challenging to provide accurate recommendations in sparse scenarios. Hash technique has shown its superiority for speeding up the online recommendation by bit operations on Hamming distance computations. However, existing hashing-based recommendations suffer from low accuracy, especially with sparse settings, due to the limited representation capability of each bit and neglected inherent relations among users and items. To this end, this paper lodges a Collaborative Group-Aware Hashing (CGAH) method for both collaborative filtering (namely CGAH-CF) and content-aware recommendations (namely CGAH) by integrating the inherent group information to alleviate the sparse issue. Firstly, we extract inherent group affinities of users and items by classifying their latent vectors into different groups. Then, the preference is formulated as the inner product of the group affinity and the simil

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyzhang2025collaborative

Related papers

• Collaborative Generative Hashing For Marketing And Fast Cold-start Recommendation (2020)7.81
• Multi-feature Discrete Collaborative Filtering For Fast Cold-start Recommendation (2020)9.59
• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• Content-aware Neural Hashing For Cold-start Recommendation (2020)10.97
• Deep Pairwise Hashing For Cold-start Recommendation (2020)6.34
• Learning To Hash For Recommendation: A Survey (2024)0.00
• Learning Similarity Preserving Binary Codes For Recommender Systems (2022)0.00