Implementation of pagerank for huge matrices
1 Ansicht (letzte 30 Tage)
Ältere Kommentare anzeigen
I am trying to calculate the most important nodes in an adjacency matrix. I am trying to find the best implementation of pagerank. My matrix contains 400.000 nodes and 400.000 edges approximately. Which is the complexity of pagerank algorith? I ve downloaded the following implementation but I am getting out of memory error (I am using sparse representation with spconvert). Is there any implemention that could handle huge matrix, and what duration should I expect??
0 Kommentare
Antworten (0)
Siehe auch
Kategorien
Mehr zu Sparse Matrices finden Sie in Help Center und File Exchange
Produkte
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!