Method for node ranking in a linked database
View Patent ↗A method assigns importance ranks to nodes in a linked database, such as any database of documents containing citations, the world wide web or any other hypermedia database. The rank assigned to a document is calculated from the ranks of documents citing it. In addition, the rank of a document is calculated from a constant representing the probability that a browser through the database will randomly jump to the document. The method is particularly useful in enhancing the performance of search engine results for hypermedia databases, such as the world wide web, whose documents have a large variation in quality.
1. A computer implemented method of scoring a plurality of linked documents, comprising:
identifying a plurality of documents, at least some of the documents being linked documents, at least some of the documents being linking documents, and at least some of the documents being both linked documents and linking documents, each of the linked documents being pointed to by a link in one or more of the linking documents;
assigning a score to each of the linked documents based on scores associated with the one or more linking documents; and
processing the linked documents according to the assigned scores.
2. A computer implemented method of scoring a plurality of documents, comprising:
identifying a plurality of linked documents;
identifying linking documents that link to the linked documents;
determining a score for each of the linked documents based on scores of the linking documents that link to the linked document; and
processing the linked document according to the determined scores.