返回
Enhancing recommendation on extremely sparse data with blocks-coupled non-negative matrix factorization
DOI:10.1016/j.neucom.2017.04.080.png)
摘要
En 中文
Recommender systems have been comprehensively analyzed in the past decade and made great achievement in various fields. Generally speaking, the recommendation of information of interests is based on the potential connections among users and items implied in 'User-Item Matrix'. However, the existing algorithm for recommendation will be degraded and ever fail in the case of sparseness of matrix. To resolve this problem, a new algorithm called B-NMF (blocks-coupled non-negative matrix factorization) is proposed in this paper. With this algorithm: (1) the reconstruction performance of matrix of extreme sparseness is improved as a result of blocking the matrix and modeling based on full use of the coupling between blocks; (2) the coupling between different blocks is ensured via a coupling mechanism that imposes constraints on consistency as the matrix is decomposed. In addition, we provide an approach to exploiting homophily effect in prediction via homophily regularization and thus, the coupling between blocks is improved via extra homophily regularization constraints. Experiment results show that our solution is superior to the existing ones in dealing with the problem of extremely sparse matrix. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Recommender systems
Sparse data
Block couple
Non-negative matrix factorization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Quantitative Performance Evaluation of Uncertainty-Aware Hybrid AADL Designs Using Statistical Model Checking使用统计模型检查对不确定性感知的混合AADL设计进行定量性能评估
Graph regularized discriminative non-negative matrix factorization for face recognition用于人脸识别的图正则判别非负矩阵分解
Improving non-negative matrix factorizations through structured initialization
PATTERN RECOGNITION
IF7.6

