We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
大家好,在使用weighted pagerank这个算法的时候有一些疑问希望帮忙解答: 请问计算PageRank的公式,在算法里面是这样写的: https://github.com/Tencent/plato/blob/master/plato/algo/pagerank/weighted_pagerank.hpp#L140 但是pagerank的公式一般是(1-d)/N + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn)) 这里用的公式似乎是(1-d) + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn)) 请问这里为啥没有除以N,也就是所有node的总数?理论上应该是每个点的一跳有1-d的概率跳到图里面的所有点,所以需要除以N? 感谢!
The text was updated successfully, but these errors were encountered:
No branches or pull requests
大家好,在使用weighted pagerank这个算法的时候有一些疑问希望帮忙解答:
请问计算PageRank的公式,在算法里面是这样写的:
https://github.com/Tencent/plato/blob/master/plato/algo/pagerank/weighted_pagerank.hpp#L140
但是pagerank的公式一般是(1-d)/N + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn))
这里用的公式似乎是(1-d) + d (PR(T1)/C(T1) + ... + PR(Tn)/C(Tn))
请问这里为啥没有除以N,也就是所有node的总数?理论上应该是每个点的一跳有1-d的概率跳到图里面的所有点,所以需要除以N?
感谢!
The text was updated successfully, but these errors were encountered: