今天讀了http://infolab.stanford.edu/~backrub/google.html 一文,發現我畢業那年(2000年)google已有如此成果。
PageRank or PR(A) can be calculated using a simple iterative algorithm, and corresponds to the principal eigenvector of the normalized link matrix of the web. Also, a PageRank for 26 million web pages can be computed in a few hours on a medium size workstation.
最酷的就是這句話了,真酷的algorithm啊,我想破頭想不出頭緒來達到這個效率。
呵呵,從wikipedia開始,發現很有意思的文章越來越多:)
http://en.wikipedia.org/wiki/HITS_algorithm
PageRank or PR(A) can be calculated using a simple iterative algorithm, and corresponds to the principal eigenvector of the normalized link matrix of the web. Also, a PageRank for 26 million web pages can be computed in a few hours on a medium size workstation.
最酷的就是這句話了,真酷的algorithm啊,我想破頭想不出頭緒來達到這個效率。
呵呵,從wikipedia開始,發現很有意思的文章越來越多:)
http://en.wikipedia.org/wiki/HITS_algorithm