【作者单位】1School of Economics and Management, Tongji University, Shanghai; 200092, China;2School of Mathematics, Physics and Statistics, Shanghai University of Engineering Science, Shanghai; 201620, China;3Department of Mathematics, Taiyuan Normal University, Shanxi; 030619, China
【年份】2021
【摘要】 On the case that the number of dangling nodes is large, PageRank computation can be proceeded with a much smaller matrix through lumping all dangling nodes of a web graph into a single node. Thus, it saves many computational cost and operations. Ther...
