Login / Signup

NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph Laplacian of Fully Connected Networks.

Dominik AlfkeDaniel PottsMartin StollToni Volkmer
Published in: Frontiers Appl. Math. Stat. (2018)
Keyphrases
  • fully connected
  • supervised learning
  • random walk
  • social network analysis
  • spectral clustering