Multi-Feature Discrete Collaborative Filtering for Fast Cold-start Recommendation

• URL: http://arxiv.org/abs/2003.10719v1
• Date: Tue, 24 Mar 2020 08:55:15 GMT
• Title: Multi-Feature Discrete Collaborative Filtering for Fast Cold-start Recommendation
• Authors: Yang Xu, Lei Zhu, Zhiyong Cheng, Jingjing Li, Jiande Sun
• Abstract summary: 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.
• Score: 31.69262747122024
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hashing is an effective technique to address the large-scale recommendation problem, due to its high computation and storage efficiency on calculating the user preferences on items. However, existing hashing-based recommendation methods still suffer from two important problems: 1) Their recommendation process mainly relies on the user-item interactions and single specific content feature. When the interaction history or the content feature is unavailable (the cold-start problem), their performance will be seriously deteriorated. 2) Existing methods learn the hash codes with relaxed optimization or adopt discrete coordinate descent to directly solve binary hash codes, which results in significant quantization loss or consumes considerable computation time. In this paper, we propose a fast cold-start recommendation method, called Multi-Feature Discrete Collaborative Filtering (MFDCF), to solve these problems. Specifically, a low-rank self-weighted multi-feature fusion module is designed to adaptively project the multiple content features into binary yet informative hash codes by fully exploiting their complementarity. Additionally, we develop a fast discrete optimization algorithm to directly compute the binary hash codes with simple operations. Experiments on two public recommendation datasets demonstrate that MFDCF outperforms the state-of-the-arts on various aspects.

Related papers

• Fast Asymmetric Factorization for Large Scale Multiple Kernel Clustering [5.21777096853979]
  Multiple Kernel Clustering (MKC) has emerged as a solution, allowing the fusion of information from multiple base kernels for clustering. We propose Efficient Multiple Kernel Concept Factorization (EMKCF), which constructs a new sparse kernel matrix inspired by local regression to achieve memory efficiency.
  arXiv  Detail & Related papers  (2024-05-26T06:29:12Z)
• Asymmetric Scalable Cross-modal Hashing [51.309905690367835]
  Cross-modal hashing is a successful method to solve large-scale multimedia retrieval issue. We propose a novel Asymmetric Scalable Cross-Modal Hashing (ASCMH) to address these issues. Our ASCMH outperforms the state-of-the-art cross-modal hashing methods in terms of accuracy and efficiency.
  arXiv  Detail & Related papers  (2022-07-26T04:38:47Z)
• 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)
• BanditMF: Multi-Armed Bandit Based Matrix Factorization Recommender System [0.0]
  Multi-armed bandits (MAB) provide a principled online learning approach to attain the balance between exploration and exploitation. collaborative filtering (CF) is arguably the earliest and most influential method in the recommender system. BanditMF is designed to address two challenges in the multi-armed bandits algorithm and collaborative filtering.
  arXiv  Detail & Related papers  (2021-06-21T07:35:39Z)
• A non-alternating graph hashing algorithm for large scale image search [5.221613241320111]
  We propose a novel relaxed formulation for spectral hashing that adds no additional variables to the problem. Instead of solving the problem in original space where number of variables is equal to the data points, we solve the problem in a much smaller space. This trick reduces both the memory and computational complexity at the same time.
  arXiv  Detail & Related papers  (2020-12-24T06:41:54Z)
• Modurec: Recommender Systems with Feature and Time Modulation [50.51144496609274]
  We propose Modurec: an autoencoder-based method that combines all available information using the feature-wise modulation mechanism. We show on Movielens datasets that these modifications produce state-of-the-art results in most evaluated settings.
  arXiv  Detail & Related papers  (2020-10-13T09:18:33Z)
• Deep Momentum Uncertainty Hashing [65.27971340060687]
  We propose a novel Deep Momentum Uncertainty Hashing (DMUH) It explicitly estimates the uncertainty during training and leverages the uncertainty information to guide the approximation process. Our method achieves the best performance on all of the datasets and surpasses existing state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2020-09-17T01:57:45Z)
• 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)
• Learning to Hash with Graph Neural Networks for Recommender Systems [103.82479899868191]
  Graph representation learning has attracted much attention in supporting high quality candidate search at scale. Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous. We propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
  arXiv  Detail & Related papers  (2020-03-04T06:59:56Z)

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.