A Fast Frequent Directions Algorithm for Low Rank Approximation
Recently a deterministic method, frequent directions (FD) is proposed to solve the high dimensional low rank approximation problem. It works well in practice, but experiences high computational cost. In this paper, we establish a fast frequent directions algorithm for the low rank approximation prob...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 41(2019), 6 vom: 26. Juni, Seite 1279-1293 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2019
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Journal Article |
| Online verfügbar |
Volltext |