Multi-feature Discrete Collaborative Filtering For Fast Cold-start Recommendation

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

Stats

• citations18
• S2 citations—
• github stars0
• HF likes0
• heat score9.59
• arxiv keyxu2020multi

Related papers

• Content-aware Neural Hashing For Cold-start Recommendation (2020)10.97
• Collaborative Generative Hashing For Marketing And Fast Cold-start Recommendation (2020)7.81
• Collaborative Group-aware Hashing For Fast Recommender Systems (2025)0.00
• Deep Pairwise Hashing For Cold-start Recommendation (2020)6.34
• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
• Learning To Hash For Recommendation: A Survey (2024)0.00
• Learning To Collide: Recommendation System Model Compression With Learned Hash Functions (2022)0.00
• Learning Similarity Preserving Binary Codes For Recommender Systems (2022)0.00