An improvement of the parameterized frequent directions algorithm
From MaRDI portal
Publication:1741237
DOI10.1007/S10618-017-0542-XzbMATH Open1411.68100OpenAlexW2756236744WikidataQ94499458 ScholiaQ94499458MaRDI QIDQ1741237FDOQ1741237
Kumudha Raimond, Deena P. Francis
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Information and Sufficiency
- Low-Rank Approximation and Regression in Input Sparsity Time
- Randomized Algorithms for Matrices and Data
- 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
- Computational Advertising: Techniques for Targeting Relevant Ads
- 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 (1)
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)
