.png){kind=icon}
Return
Collaborative filtering using orthogonal nonnegative matrix tri-factorization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ipm.2008.12.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Collaborative filtering aims at predicting a test user's ratings for new items by integrating other like-minded users' rating information. The key assumption is that users sharing the same ratings on past items tend to agree on new items. Traditional collaborative filtering methods can mainly be divided into two classes: memory-based and model-based. The memory-based approaches generally suffer from two fundamental problems: sparsity and scalability, and the model-based approaches usually cost too much on establishing a model and have many parameters to be tuned. In this paper, we propose a novel framework for collaborative filtering by applying orthogonal nonnegative matrix tri-factorization (ONMTF), which (1) alleviates the sparsity problem via matrix factorization; (2) solves the scalability problem by simultaneously clustering rows and columns of the user-item matrix. Experiments on the benchmark data set show that our algorithm is indeed more tolerant against both sparsity and scalability, and achieves good performance in the mean time. Crown Copyright (C) 2008 Published by Elsevier Ltd. All rights reserved.
Keywords:
Collaborative filtering
Orthogonal nonnegative matrix tri-factorization
Co-clustering
Fusion
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
6.9
Papers:
5.2K
Citations:
1.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more