arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.3192cs.LGstat.ML
收藏

局部低秩假设下的矩阵逼近

Matrix Approximation under Local Low-Rank Assumption

Georgia Institute of Technology(佐治亚理工学院);Google Research(谷歌研究院)

Joonseok Lee, Seungyeon Kim, Guy Lebanon, Yoram Singer

摘要:

矩阵近似是机器学习中的一种常用工具,用于为推荐系统、文本挖掘和计算机视觉构建准确的预测模型。在构造矩阵近似时,一个普遍的假设是部分观测矩阵是低秩的。我们提出了一个新的矩阵近似模型,而不是我们假设的矩阵只是局部的低秩,导致观察到的矩阵表示为低秩矩阵的加权和。我们分析了所提出的局部低秩建模的准确性。我们的实验表明,在推荐任务的预测精度的改善。

英文摘要:

Matrix approximation is a common tool in machine learning for building accurate prediction models for recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model where we assume instead that the matrix is only locally of low-rank, leading to a representation of the observed matrix as a weighted sum of low-rank matrices. We analyze the accuracy of the proposed local low-rank modeling. Our experiments show improvements in prediction accuracy in recommendation tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑