An improvement of the parameterized frequent directions algorithm
From MaRDI portal
Publication:1741237
DOI10.1007/S10618-017-0542-XzbMATH Open1411.68100OpenAlexW2756236744WikidataQ94499458 ScholiaQ94499458MaRDI QIDQ1741237FDOQ1741237
Authors: Deena P. Francis, Kumudha Raimond 
Publication date: 3 May 2019
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10618-017-0542-x
Recommendations
Cites Work
- On Information and Sufficiency
- Low-Rank Approximation and Regression in Input Sparsity Time
- Randomized Algorithms for Matrices and Data
- Title not available (Why is that?)
- Sequential Karhunen-Loève basis extraction and its application to images
- Fast computation of low-rank matrix approximations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- An improved approximation algorithm for the column subset selection problem
- Sketching as a tool for numerical linear algebra
- Relative errors for deterministic low-rank matrix approximations
- Quasi-polynomial time approximation scheme for sparse subsets of polygons
- Characterizing concept drift
- Frequent directions: simple and deterministic matrix sketching
- Improved practical matrix sketching with guarantees
Cited In (2)
Uses Software
This page was built for publication: An improvement of the parameterized frequent directions algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741237)
