GitHub user planvin opened a pull request:
https://github.com/apache/spark/pull/2738
fixed dynamic pagerank vertex update computation
There seems to be a typo here when comparing to static version or to the
usual pagerank algorithm. if we take a node in the graph, on each iteration, we
add a random jump to any node in the graph with equal probability of
resetProb/N. Then summing for all nodes in the graph yields the resetProb on
line 155, which has nothing to do with the pagerank value for last iteration.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/planvin/spark master
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/spark/pull/2738.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #2738
----
commit a582d1e8cc680ced2b906361f6ab1d2ed846c781
Author: planvin <[email protected]>
Date: 2014-10-09T22:13:49Z
fixed dynamic pagerank vertex update computation
There seems to be a typo here when comparing to static version or to the
usual pagerank algorithm. if we take a node in the graph, on each iteration, we
add a random jump to any node in the graph with equal probability of
resetProb/N. Then summing for all nodes in the graph yields the resetProb on
line 155, which has nothing to do with the pagerank value for last iteration.
----
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
