Method for scoring documents in a linked database

• US 6,799,176 B1
• Filed: 07/06/2001
• Issued: 09/28/2004
• Est. Priority Date: 01/10/1997
• Status: Expired due to Term

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Board of Trustees of the Leland Stanford Junior University (Stanford Management Co.)
• Inventors: Page, Lawrence
• Primary Examiner(s): LE, UYEN T
• Application Number:
  US09/899,068
• Time in Patent Office: 1,180 Days
• Field of Search: 707/5, 707/7, 707/10, 707/1-3, 715/501.1, 702/179, 702/181
• US Class Current: 1/1
• CPC Class Codes: G06F 16/382 using citations hypermedia G06F16/94
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99937 Sorting

Abstract

A method is presented for scoring documents stored in a network. The method includes identifying links from linking documents to linked documents in the network and determining an importance of the identified links. The method further includes weighting the identified links based on the determined importance and scoring the linked documents based on the weighted links.

Claims

1. A computer implemented method for scoring documents, at least some of the documents containing links to other ones of the documents, the method comprising:

determining a probability that a searcher will access each of the documents after following a number of the links; and

scoring each of the documents based on the determined probability.