Block-Aware Item Similarity Models for Top-N Recommendation
| Authors | |
|---|---|
| Publication date | 10-2020 |
| Journal | ACM Transactions on Information Systems |
| Article number | 42 |
| Volume | Issue number | 38 | 4 |
| Number of pages | 26 |
| Organisations |
|
| Abstract |
Top-N recommendations have been studied extensively. Promising
results have been achieved by recent item-based collaborative filtering
(ICF) methods. The key to ICF lies in the estimation of item
similarities. Observing the block-diagonal structure of the item
similarities in practice, we propose a block-diagonal regularization
(BDR) over item similarities for ICF. The intuitions behind BDR are as
follows: (1) with BDR, item clustering is embedded into the learning of
ICF methods; (2) BDR induces sparsity of item similarities, which
guarantees recommendation efficiency; and (3) BDR captures in-block
transitivity to overcome rating sparsity. By regularizing the item
similarity matrix of item similarity models with BDR, we obtain a
block-aware item similarity model. Our experimental evaluations on a
large number of datasets show that the block-diagonal structure is
crucial to the performance of top-N recommendation.
|
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1145/3411754 |
| Permalink to this page | |
