Implementation of pagerank for huge matrices
조회 수: 1 (최근 30일)
이전 댓글 표시
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
답변 (0개)
참고 항목
제품
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!