Collaborative Group-Aware Hashing for Fast Recommender Systems

• URL: http://arxiv.org/abs/2512.20172v1
• Date: Tue, 23 Dec 2025 09:07:28 GMT
• Title: Collaborative Group-Aware Hashing for Fast Recommender Systems
• Authors: Yan Zhang, Li Deng, Lixin Duan, Ivor W. Tsang, Guowu Yang,
• Abstract summary: Hash technique has shown its superiority for speeding up the online recommendation by bit operations on Hamming distance computations.<n>Existing hashing-based recommendations suffer from low accuracy, especially with sparse settings.<n>This paper lodges a Collaborative Group-Aware Hashing (CGAH) method for both collaborative filtering and content-aware recommendations.
• Score: 66.92426381995695
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 similarity of hash codes. By learning hash codes with the inherent group information, CGAH obtains more effective hash codes than other discrete methods with sparse interactive data. Extensive experiments on three public datasets show the superior performance of our proposed CGAH and CGAH-CF over the state-of-the-art discrete collaborative filtering methods and discrete content-aware recommendations under different sparse settings.

Related papers

• Online Clustering of Dueling Bandits [59.09590979404303]
  We introduce the first "clustering of dueling bandit algorithms" to enable collaborative decision-making based on preference feedback.<n>We propose two novel algorithms: (1) Clustering of Linear Dueling Bandits (COLDB) which models the user reward functions as linear functions of the context vectors, and (2) Clustering of Neural Dueling Bandits (CONDB) which uses a neural network to model complex, non-linear user reward functions.
  arXiv  Detail & Related papers  (2025-02-04T07:55:41Z)
• Learning to Hash for Recommendation: A Survey [49.943390288789494]
  This survey provides a comprehensive overview of state-of-the-art HashRec algorithms.<n>We categorize existing works into a three-tier taxonomy based on: (i) learning objectives, (ii) optimization strategies, and (iii) recommendation scenarios.
  arXiv  Detail & Related papers  (2024-12-05T05:07:19Z)
• End-to-end Learnable Clustering for Intent Learning in Recommendation [54.157784572994316]
  We propose a novel intent learning method termed underlineELCRec. It unifies behavior representation learning into an underlineEnd-to-end underlineLearnable underlineClustering framework. We deploy this method on the industrial recommendation system with 130 million page views and achieve promising results.
  arXiv  Detail & Related papers  (2024-01-11T15:22:55Z)
• HCFRec: Hash Collaborative Filtering via Normalized Flow with Structural Consensus for Efficient Recommendation [23.73674947905047]
  Hash-based collaborative filtering (Hash-CF) approaches employ efficient Hamming distance of learned binary representations of users and items to accelerate recommendations. We propose HCFRec, a novel Hash-CF approach for effective and efficient recommendations.
  arXiv  Detail & Related papers  (2022-05-24T12:51:52Z)
• Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach [56.12815715932561]
  We propose a new broad recommender system called Broad Collaborative Filtering (BroadCF) Instead of Deep Neural Networks (DNNs), Broad Learning System (BLS) is used as a mapping function to learn the complex nonlinear relationships between users and items. Extensive experiments conducted on seven benchmark datasets have confirmed the effectiveness of the proposed BroadCF algorithm.
  arXiv  Detail & Related papers  (2022-04-20T01:25:08Z)
• Learning to Hash Naturally Sorts [84.90210592082829]
  We introduce Naturally-Sorted Hashing (NSH) to train a deep hashing model with sorted results end-to-end. NSH sort the Hamming distances of samples' hash codes and accordingly gather their latent representations for self-supervised training. We describe a novel Sorted Noise-Contrastive Estimation (SortedNCE) loss that selectively picks positive and negative samples for contrastive learning.
  arXiv  Detail & Related papers  (2022-01-31T16:19:02Z)
• Local Clustering in Contextual Multi-Armed Bandits [44.11480686973274]
  We study identifying user clusters in contextual multi-armed bandits (MAB) We propose a bandit algorithm, LOCB, embedded with local clustering procedure. We evaluate the proposed algorithm from various aspects, which outperforms state-of-the-art baselines.
  arXiv  Detail & Related papers  (2021-02-26T21:59:29Z)
• Deep Hashing with Hash-Consistent Large Margin Proxy Embeddings [65.36757931982469]
  Image hash codes are produced by binarizing embeddings of convolutional neural networks (CNN) trained for either classification or retrieval. The use of a fixed set of proxies (weights of the CNN classification layer) is proposed to eliminate this ambiguity. The resulting hash-consistent large margin (HCLM) proxies are shown to encourage saturation of hashing units, thus guaranteeing a small binarization error.
  arXiv  Detail & Related papers  (2020-07-27T23:47:43Z)
• Multi-Feature Discrete Collaborative Filtering for Fast Cold-start Recommendation [31.69262747122024]
  We propose a fast cold-start recommendation method, called Multi-Feature Discrete Collaborative Filtering (MFDCF) Specifically, a low-rank self-weighted multi-feature fusion module is designed to adaptively project the multiple content features into binary hash codes. MFDCF outperforms the state-of-the-arts on various aspects.
  arXiv  Detail & Related papers  (2020-03-24T08:55:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.