| Analysis of cold-start recommendations in IPTV systems |
| Full text |
Pdf
(357 KB)
|
Source
|
ACM Conference On Recommender Systems
archive
Proceedings of the third ACM conference on Recommender systems
table of contents
New York, New York, USA
SESSION: Short papers
table of contents
Pages 233-236
Year of Publication: 2009
ISBN:978-1-60558-435-5
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 22, Downloads (12 Months): 22, Citation Count: 0
|
|
|
ABSTRACT
In this paper we evaluate the performance of different collaborative algorithms in cold-start situations, where the initial lack of ratings may affect the quality of the algorithms. The evaluation has been performed on the pay-per-view datasets collected by two IP-television providers over a period of several months. The analysis shows that item-based algorithms perform better with respect to SVD-based ones in the early stage of the cold-start problem. Moreover, the accuracy of SVD-based algorithms, when using few latent factors, decreases with the time-evolution of the dataset. On the contrary, the same algorithms used with a large-enough number of latent features increase their accuracy with time and may outperform the item-based algorithms.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
H. J. Ahn. A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem. Inf. Sci., 178(1):37--51, 2008.
|
| |
2
|
R. Bell, Y. Koren, and C. Volinsky. Modeling relationships at multiple scales to improve accuracy of large recommender systems. In KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 95--104, New York, NY, USA, 2007. ACM.
|
| |
3
|
M. Deshpande and G. Karypis. Item-based top-n recommendation algorithms. ACM Transactions on Information Systems (TOIS), 22(1):143--177, 2004.
|
| |
4
|
G. W. Furnas, S. Deerwester, S. T. Dumais, T. K. Landauer, R. A. Harshman, L. A. Streeter, and K. E. Lochbaum. Information retrieval using a singular value decomposition model of latent semantic structure. pages 465--480, New York, NY, USA, 1988. ACM Press.
|
| |
5
|
J. Herlocker, J. Konstan, L. Terveen, and J. Riedl. Evaluating collaborative filtering recommender systems. ACM Transactions on Information Systems (TOIS), 22(1):5--53, 2004.
|
| |
6
|
Z. Huang, H. Chen, and D. Zeng. Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Trans. Inf. Syst., 22(1):116--142, 2004.
|
| |
7
|
A. Paterek. Improving regularized singular value decomposition for collaborative filtering. Proceedings of KDD Cup and Workshop, 2007.
|
| |
8
|
B. Sarwar, G. Karypis, J. Konstan, and J. Reidl. Item-based collaborative filtering recommendation algorithms. 10th Int. Conf. on World Wide Web, pages 285--295, 2001.
|
| |
9
|
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Incremental singular value decomposition algorithms for highly scalable recommender systems. 5th Int. Conf. on Computer and Information Technology (ICCIT 2002), pages 399--404, 2002.
|
| |
10
|
J. Schafer, D. Frankowski, J. Herlocker, and S. Sen. Collaborative filtering recommender systems. pages 291--324. 2007.
|
|