Sublinear update time randomized algorithms for dynamic graph regression

DOI10.1016/j.amc.2021.126434OpenAlexW3174509068MaRDI QIDQ2245047

Mostafa Haghir Chehreghani

Publication date: 12 November 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2021.126434

zbMATH Keywords

least squares regressiondynamic networkscountsketchdynamic graph regressionsublinear update timesubsampled randomized Hadamard transform

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Artificial intelligence (68Txx) Graph theory (05Cxx)

Related Items (1)

On the theory of dynamic graph regression problem

Uses Software

• node2vec
• gBoost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vector representations of graphs
• Faster least squares approximation
• On multi-view learning with additive models
• Mining rooted ordered trees under subtree homeomorphism
• gBoost: a mathematical programming approach to graph classification and regression
• Learning representations from dendrograms
• Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform
• Low-Rank Approximation and Regression in Input Sparsity Time
• Approximation algorithms for classification problems with pairwise relationships
• Fully dynamic spectral vertex sparsifiers and applications
• Generalized Inversion of Modified Matrices

This page was built for publication: Sublinear update time randomized algorithms for dynamic graph regression