An improvement of the parameterized frequent directions algorithm

DOI10.1007/s10618-017-0542-xzbMath1411.68100OpenAlexW2756236744WikidataQ94499458 ScholiaQ94499458MaRDI QIDQ1741237

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

zbMATH Keywords

streaming data\(\beta\)-FDfrequent directionsmatrix sketchingparameterized FD

Mathematics Subject Classification ID

Uses Software

• MNIST
• Caltech-UCSD Birds

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing concept drift
• Sequential Karhunen-Loeve basis extraction and its application to images
• Frequent Directions: Simple and Deterministic Matrix Sketching
• Improved Practical Matrix Sketching with Guarantees
• Computational Advertising: Techniques for Targeting Relevant Ads
• Randomized Algorithms for Matrices and Data
• Low-Rank Approximation and Regression in Input Sparsity Time
• Fast computation of low-rank matrix approximations
• Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
• Relative Errors for Deterministic Low-Rank Matrix Approximations
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• On Information and Sufficiency

This page was built for publication: An improvement of the parameterized frequent directions algorithm