Determining quality of linked documents

• US 8,176,056 B1
• Filed: 07/20/2010
• Issued: 05/08/2012
• Est. Priority Date: 06/30/2004
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Bharat, Krishna, Singhal, Amit, Haahr, Paul
• Primary Examiner(s): Lovel, Kimberly
• Assistant Examiner(s): REYES, MARIELA D
• Application Number:
  US12/840,128
• Time in Patent Office: 658 Days
• Field of Search: 707/748, 707/749
• US Class Current: 707/749
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

A ranking component ranks documents, such as web pages or web sites, to obtain a ranking score that defines a quality judgment of the document. The ranking score of a particular document is based on the ranking score of the documents which link to it and based on affiliation among the documents.

Claims

1. A device comprising:

a first component, implemented at least partially in hardware, to identify documents, where a first document of the documents is linked by a second document of the documents and the second document is one of a plurality of documents in an affiliated set of documents; and

a second component, implemented at least partially in hardware, to;

calculate a first value for each document in the affiliated set of documents based on a ranking score of the document and a number of outbound links from the document;

determine a value of a degree of affiliation for the plurality of documents, where the value of the degree of affiliation indicates whether the plurality of documents in the affiliated set of documents are weakly affiliated or strongly affiliated;

calculate a second value derived in part from the value of the degree of affiliation and a summation of the first values for the plurality of documents in the affiliated set of documents when the affiliated set of documents are weakly affiliated;

calculate the second value as a maximum of the first values for the plurality of documents in the affiliated set of documents when the affiliated set of documents are strongly affiliated;

assign a ranking score to the first document based the second value; and

store the ranking score.

2. The device of claim 1, where the first component is further to identify affiliations among the plurality of documents in the affiliated set of documents based on at least one of a link graph structure of the plurality of documents, traffic patterns to the plurality of documents, similarity of hostnames of the plurality of documents, or similarity of Internet Protocol (IP) addresses of the plurality of documents.

3. The device of claim 1, where, when assigning the ranking score, the second component is further to iteratively assign the ranking score.

4. The device of claim 3, where the second component is further to normalize the ranking score after the iterative assignment of the ranking score is complete.

5. The device of claim 1, where the value of the degree of affiliation among the plurality of documents in the affiliated set of documents is defined based on a binary model of affiliation.

6. The device of claim 1, where the value of the degree of affiliation among the plurality of documents in the affiliated set of documents is defined based on a continuous model of affiliation.

7. The device of claim 1, where the documents in the affiliated set of documents are most strongly affiliated when the value of the degree of affiliation is 0 and the documents in the affiliated set of documents are most weakly affiliated when the value of the degree of affiliation is 1.