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

Hashing is an effective technique to address the largescale 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 lowrank 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 stateof-the-arts on various aspects.

Authors

• Yang Xu Purdue University
• Lei Zhu
• Zhiyong Cheng Qilu University of Technology (Shandong Academy of Sciences), JiNan, China
• Jingjing Li
• Jiande Sun

Keywords

No keywords are indexed for this paper.