.png){kind=icon}
返回
Fast Algorithms for Approximating the Singular Value Decomposition
.png){kind=icon}
PRE
AI
DOI：10.1145/1921632.1921639.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A low-rank approximation to a matrix A is a matrix with significantly smaller rank than A, and which is close to A according to some norm. Many practical applications involving the use of large matrices focus on low-rank approximations. By reducing the rank or dimensionality of the data, we reduce the complexity of analyzing the data. The singular value decomposition is the most popular low-rank matrix approximation. However, due to its expensive computational requirements, it has often been considered intractable for practical applications involving massive data. Recent developments have tried to address this problem, with several methods proposed to approximate the decomposition with better asymptotic runtime. We present an empirical study of these techniques on a variety of dense and sparse datasets. We find that a sampling approach of Drineas, Kannan and Mahoney is often, but not always, the best performing method. This method gives solutions with high accuracy much faster than classical SVD algorithms, on large sparse datasets in particular. Other modern methods, such as a recent algorithm by Rokhlin and Tygert, also offer savings compared to classical SVD algorithms. The older sampling methods of Achlioptas and McSherry are shown to sometimes take longer than classical SVD.
Keyword:
Singular value decomposition
low rank approximation
experimental evaluation
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
.png){kind=icon}
Results of a Multicenter Trial for the Treatment of Traumatic Vascular Injury with a Covered Stent
PREAI
分享收藏分享收藏Morphology and Anatomy of Croomia pauciflora (Stemonaceae)Croomia pauciflora (Stemonaceae)的形态学与解剖学
OAAI
OAAI分享收藏
查看更多内容