Search using graph colorization and personalized bookmark processing

• US 20050216533A1
• Filed: 03/29/2004
• Published: 09/29/2005
• Est. Priority Date: 03/29/2004
• Status: Active Grant

• Current Assignee: R2 Solutions LLC (Acacia Research Corporation)
• Original Assignee: Yahoo! Inc. (Apollo Global Management, Inc.)
• Inventors: Berkhin, Pavel
• Granted Patent: US 7,343,374 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9538 Presentation of query results
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

In a search processing system, identifying input authority weights for a plurality of pages, wherein an input authority weight represents a user'"'"'s weight of a page in terms of interest; distributing a page'"'"'s input authority weight over one or more pages that are linked in a graph to the page; and using a resulting authority weight for a page in effecting a search result list. The search result list might comprise one or more of reordering search hits and highlighting search hits.

Claims

1. A computer-implemented method for generating search preferences from user input, the method comprising:

identifying input authority weights for a plurality of pages, wherein an input authority weight represents a user'"'"'s weight of a page in terms of interest;

distributing a page'"'"'s initial authority weight over one or more pages that are linked in a graph to the page with distribution occurring recursively over links and pages until an end condition is met; and

using a resulting authority weight for a page in effecting a search result list.

2. The method of claim 1, wherein effecting the search result list comprises one or more of reordering search hits and highlighting search hits.

3. The method of claim 1, wherein the end condition is that a predetermined number of links are traversed.

4. The method of claim 1, wherein the end condition is that a less than a predetermined threshold of authority weight remains to be distributed.

5. The method of claim 1, further comprising pre-computing an authority weight vector for a graph using a set of reference pages in the plurality of pages.

6. The method of claim 5, further comprising combining an authority vector for one or more predetermined reference pages with an authority vector for one or more user-specific reference pages of the plurality of pages.