System and method for knowledge based search system

• US 7,788,284 B2
• Filed: 06/26/2007
• Issued: 08/31/2010
• Est. Priority Date: 06/26/2007
• Status: Expired due to Fees

• Current Assignee: R2 Solutions LLC (Acacia Research Corporation)
• Original Assignee: Yahoo! Inc. (Apollo Global Management, Inc.)
• Inventors: Vandelle, Gilles, Gaillard, Matthieu, Brisbart, Franck
• Primary Examiner(s): Mahmoudi; Tony
• Assistant Examiner(s): Uddin; MD. I
• Application Number:
  US11/768,273
• Publication Number:
  US 20090006354A1
• Time in Patent Office: 1,162 Days
• Field of Search: 707/5, 707/3, 707/100, 707/731, 707/728, 707/749, 707/798, 705/3
• US Class Current: 707/798
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation

Abstract

The present invention provides functionality for conducting a knowledge based by finding search results from limited topic domains. According to one embodiment, the method of the present invention includes retrieving the context of a given user and identifying a plurality of characteristics associated with the user'"'"'s context. The one or more characteristics associated with the user'"'"'s context are displayed to the user and the user may select from the displayed characteristics. One or more items of content are retrieved based upon the user'"'"'s selection and presented to the user on the user'"'"'s client device.

Claims

1. A computerized method for creating an acyclic directed keyword graph, the method comprising:

electronically selecting a unique unused pair of terms from a keyword pool;

calculating, by using a processor, a plurality of cross reference matrices for each of the terms in the selected pair of terms, the plurality of cross reference matrices including results from a web search of each term in the unique unused pair of terms;

calculating, by using a processor, relevancy between the terms based on the plurality of cross reference matrices;

electronically creating a node connection based on the relevancy between the terms; and

repeating for another unique pair of terms until the acyclic directed keyword graph is of sufficient size.

2. The method of claim 1 wherein the keyword pool is a query log.

3. The method of claim 1 wherein the keyword pool is a dictionary.

6. The computer readable storage media of claim 1 wherein the keyword pool is a dictionary.

4. Computer readable storage media comprising program code for execution by a programmable processor to perform a method for creating an acyclic directed keyword graph, the computer readable storage media comprising:

program code for selecting a unique unused pair of terms from a keyword pool;

program code for calculating, by using a processor, a plurality of cross reference matrices for each of the terms in the selected pair of terms, the plurality of cross reference matrices including results from a web search of each term in the unique unused pair of terms;

program code for calculating relevancy between the terms based on the plurality of cross reference matrices;

program code for creating a node connection based on the relevancy between the terms; and

program code for repeating for another unique pair of terms until the acyclic directed keyword graph is of sufficient size.

5. The computer readable storage media of claim 4 wherein the keyword pool is a query log.