Implementation of pagerank for huge matrices
1 vue (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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 commentaires
Réponses (0)
Voir également
Catégories
En savoir plus sur Sparse Matrices dans Help Center et File Exchange
Produits
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!