The PageRank algorithm provides a wonderful applicaton of linear algebra on a massive scale.
The modified adjancency matrix E provides a natural way to define the importance of a page in terms of the importance of other pages.
A "source vector" E allows adjustment of the algorithm to give priority to a pre-determined Web sites.
PageRank translates naturally to the problem of finding the principal eigenvector that corresponds to the dominant eigenvalue.
|
created: 10 February 2007 last revised: 16 February 2007 | previous |
|