On the theory of dynamic graph regression problem

DOI10.1007/s40314-022-02071-2OpenAlexW2924154620MaRDI QIDQ2091389

Mostafa Haghir Chehreghani

Publication date: 1 November 2022

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

Full work available at URL: https://arxiv.org/abs/1903.10699

zbMATH Keywords

linear regressiondynamic graphsupdate timeupdate-efficient matrix embeddings

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational aspects of data analysis and big data (68T09)

Uses Software

• node2vec

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vector representations of graphs
• Mining rooted ordered trees under subtree homeomorphism
• gBoost: a mathematical programming approach to graph classification and regression
• Graph-valued regression: prediction of unlabelled networks in a non-Euclidean graph space
• Sublinear update time randomized algorithms for dynamic graph regression
• Computational Advertising: Techniques for Targeting Relevant Ads
• Powers of tensors and fast matrix multiplication
• Approximation algorithms for classification problems with pairwise relationships
• The Gromov–Wasserstein distance between networks and stable network invariants
• Some Applications of the Pseudoinverse of a Matrix
• Generalized Inversion of Modified Matrices

This page was built for publication: On the theory of dynamic graph regression problem