Low Rank Approximation and Decomposition of Large Matrices Using Error Correcting Codes

Low rank approximation is an important tool used in many applications of signal processing and machine learning. Recently, randomized sketching algorithms were proposed to effectively construct low rank approximations and obtain approximate singular value decompositions of large matrices. Similar id...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on information theory Ročník 63; číslo 9; s. 5544 - 5558
Hlavní autoři:	Ubaru, Shashanka, Mazumdar, Arya, Saad, Yousef
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.09.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Approximation Approximation algorithms Columns (structural) Decomposition Error correcting codes Error correction Error correction & detection Error correction codes Least squares method low rank approximation Machine learning Mathematical analysis Matrix decomposition Matrix methods randomized sketching algorithms Regression Regression analysis Signal processing Sparse matrices Statistical analysis subspace embedding Transforms
ISSN:	0018-9448, 1557-9654
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!