IMPROVED METHODS FOR RANKING NODES IN LARGE DIRECTED GRAPHS

摘要

A kind of system and method are disclosed, wherein one group of document ranking function grade point is relative to the document for iteratively solving one group of link, until the first stability condition is met. Met in this condition, certain grades there will be convergence. Ranking functions are modified to consider that these assemble grade to reduce the calculating cost of ranking function. Modified ranking function is that solve until the second stability condition is met. Obtaining meeting more the ranks in this condition will restrain. Continuation is modified again and handled to ranking functions, until completing.