.png){kind=icon}
返回
Discrete Listwise Content-aware Recommendation
.png){kind=icon}
PRE
AI
DOI：10.1145/3609334.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To perform online inference efficiently, hashing techniques, devoted to encoding model parameters as binary codes, play a key role in reducing the computational cost of content-aware recommendation (CAR), particularly on devices with limited computation resource. However, current hashing methods for CAR fail to align their learning objectives (e.g., squared loss) with the ranking-based metrics (e.g., Normalized Discounted Cumulative Gain (NDCG)), resulting in suboptimal recommendation accuracy. In this article, we propose a novel ranking-based CAR hashing method based on Factorization Machine (FM), called Discrete Listwise FM (DLFM), for fast and accurate recommendation. Concretely, our DLFM is to optimize NDCG in the Hamming space for preserving the listwise user-item relationships. We devise an efficient algorithm to resolve the challenging DLFM problem, which can directly learn binary parameters in a relaxed continuous solution space, without additional quantization. Particularly, our theoretical analysis shows that the optimal solution to the relaxed continuous optimization problem is approximately the same as that of the original discrete optimization problem. Through extensive experiments on two real-world datasets, we show that DLFM consistently outperforms state-of-the-art hashing-based recommendation techniques.
Keyword:
Learning to hash
NDCG
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
分享收藏Managing Service Productivity In Sub-saharan African Banks: The Case of Nigerian Knowledge Workers
PREAI
分享收藏AVALIAÇÃO DA COBERTURA FLORESTAL NA PAISAGEM DE MATA ATLÂNTICA NO ANO DE 2010, NA REGIÃO DE OURO PRETO - MG.png)
CERNE
OAAI
CERNEIF0
OAAI分享收藏
查看更多内容