Implementation of pagerank for huge matrices

1 次查看（过去 30 天）
Kris zenitis
Kris zenitis 2014-7-11
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 个）

类别

在 Help Center 和 File Exchange 中查找有关 Creating and Concatenating Matrices 的更多信息

标签

产品

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by