By lumping all dangling nodes of a web graph into a single node, PageRankcomputation can be proceeded with a much smaller matrix on the case that thenumber of dangling nodes is large . Thus, it saves many computational cost and operations .

Author(s) : Yongxin Dong, Jianxin You, Yuehua Feng

Links : PDF - Abstract

Code :
Coursera

Keywords : dangling - nodes - lumping - - large -

Leave a Reply

Your email address will not be published. Required fields are marked *