arrow
返回

Fast Matrix Factorization With Nonuniform Weights on Missing Data

delete2020-08-01
delete51
delete
OA
AI
Xiangnan He 封面图
Xiangnan He (Xiangnan He)
唐金辉 封面图
唐金辉 (Jinhui Tang) *
X
Xiaoyu Du
R
Richang Hong
T
Tongwei Ren
T
Tat‐Seng Chua
DOI:10.1109/TNNLS.2018.2890117delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Matrix factorization (MF) has been widely used to discover the low-rank structure and to predict the missing entries of data matrix. In many real-world learning systems, the data matrix can be very high dimensional but sparse. This poses an imbalanced learning problem since the scale of missing entries is usually much larger than that of the observed entries, but they cannot be ignored due to the valuable negative signal. For efficiency concern, existing work typically applies a uniform weight on missing entries to allow a fast learning algorithm. However, this simplification will decrease modeling fidelity, resulting in suboptimal performance for downstream applications. In this paper, we weight the missing data nonuniformly, and more generically, we allow any weighting strategy on the missing data. To address the efficiency challenge, we propose a fast learning method, for which the time complexity is determined by the number of observed entries in the data matrix rather than the matrix size. The key idea is twofold: 1) we apply truncated singular value decomposition on the weight matrix to get a more compact representation of the weights and 2) we learn MF parameters with elementwise alternating least squares (eALS) and memorize the key intermediate variables to avoid repeating computations that are unnecessary. We conduct extensive experiments on two recommendation benchmarks, demonstrating the correctness, efficiency, and effectiveness of our fast eALS method.
Keyword:
Data models
Learning systems
Optimization
Task analysis
Matrix decomposition
Predictive models
Complexity theory
Elementwise alternating least squares (eALS)
matrix factorization (MF)
missing data
recommendation system
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Neural Networks and Learning Systems 封面图
IEEE Transactions on Neural Networks and Learning Systems
IF:
8.9
论文数:
7.6K
被引数:
7.2W

机构

H
hefei university of technology
学者数:
2.5W
论文数: 1.7W
被引数: 35
U
university of science & technology of china, cas
学者数:
3.2W
论文数: 2.7W
被引数: 74
N
nanjing university
学者数:
7.8W
论文数: 5.6W
被引数: 87
C
chinese academy of sciences
学者数:
56.7W
论文数: 45.0W
被引数: 704
学者 查看更多机构
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
Seismic anisotropy indicates organized melt beneath the Mid-Atlantic Ridge aids seafloor spreading
err2023-08-04
err0
errOAAI
errJ.M. Kendall; D. Schlaphorst; C.A. Rychert; N. Harmon; M. Agius; S. Tharimena
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容