By Topic

Spectral Regression with Low-Rank Approximation for Dynamic Graph Link Prediction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
chunsheng fang ; University of Cincinnati ; Anca Ralescu ; Mojtaba Kohram

The paper mentions that the temporal regression model for the dynamic graph link prediction problem rests on spectral graph theory and low-rank approximation for the graph Laplacian matrix.

Published in:

IEEE Intelligent Systems  (Volume:26 ,  Issue: 4 )