PREDICTIVE INDEXING FOR FAST SEARCH

• US 20100131496A1
• Filed: 11/26/2008
• Published: 05/27/2010
• Est. Priority Date: 11/26/2008
• Status: Abandoned Application

• Current Assignee: Oath Inc. (Verizon Communications Inc.)
• Original Assignee: Yahoo! Inc. (Apollo Global Management, Inc.)
• Inventors: STREHL, Alexander L., LANGFORD, John, GOEL, Sharad
• Application Number:
  US12/324,154
• Publication Number:
  US 20100131496A1
• Time in Patent Office: Days
• US Class Current: 707/722
• CPC Class Codes: G06F 16/954 Navigation, e.g. using categorised browsing
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising

Abstract

A system comprises a machine readable storage medium having an index that, given a set of inputs, a set of outputs, a set of input categories, and a scoring rule, provides an ordered subset of the outputs for each input category. The outputs within each subset are ordered by predicted score with respect to an input from one of the input categories. At least one processor is capable of receiving an input corresponding to at least one of the set of input categories. The processor is configured for scoring a reduced set of outputs against the received input using the scoring rule. The reduced set of outputs includes a union of the subsets of outputs associated with each input category to which the received inputs correspond. The processor is configured for outputting a list including a subset of the reduced set of outputs having the highest scores.

Claims

1. A processor implemented method comprising:

(a) providing an index which, given a set of inputs, a set of outputs, a set of input categories, and a scoring rule, provides a respective ordered subset of the outputs for each input category, the outputs within each subset ordered by predicted score of those outputs with respect to a respective input from a respective one of the input categories;

(b) receiving an input after step (a), the input corresponding to at least one of the set of input categories;

(c) scoring a reduced set of outputs against the received input using the scoring rule, the reduced set of outputs including a union of the respective subsets of the set of outputs associated with each of the input categories to which the received input corresponds; and

(d) outputting to a tangible machine readable storage medium, display or network a list including a subset of the reduced set of outputs having the highest scores.

2. The method of claim 1, wherein the outputs are web pages, and the plurality of inputs includes at least one of the group consisting of words and phrases.

3. The method of claim 2, wherein the query is a request for a list of web pages most relevant to words or phrases in the query.

4. The method of claim 1, wherein the outputs are advertisements, and the inputs are web pages.

5. The method of claim 4, wherein the query is a request for a list of advertisements most likely to be clicked if rendered in conjunction with a web page identified in the query.

6. The system of claim 1, wherein the inputs are points in a Euclidean space, and the respective outputs are nearest neighbors to the respective input points.

7. A system comprising:

a machine readable storage medium having an index that, given a set of inputs, a set of outputs, a set of input categories, and a scoring rule, provides a respective ordered subset of the outputs for each input category, the outputs within each subset ordered by predicted score of those outputs with respect to a respective input from a respective one of the input categories;

at least one processor capable of receiving an input corresponding to at least one of the set of input categories;

;

the at least one processor configured for scoring a reduced set of outputs against the received input using the scoring rule, the reduced set of outputs including a union of the respective subsets of the set of outputs associated with each of the input categories to which the received input corresponds; and

the at least one processor configured for outputting a list including a subset of the reduced set of outputs having the highest scores.

8. The system of claim 7, wherein the inputs are points in a Euclidean space, and the respective outputs are nearest neighbors to the respective input points.

9. The system of claim 7, wherein, the plurality of inputs includes at least one of words or phrases, and the outputs are web pages relevant to the words or phrases.

10. The system of claim 7, wherein the, the inputs are web pages, and the outputs are advertisements likely to be clicked when rendered in conjunction with the web pages.

11. The system of claim 7, wherein the inputs and outputs are represented in the index as sparse binary feature vectors in a Euclidean space.

12. The system of claim 11, wherein the index has a first value corresponding to a combination of one of the inputs and one of the outputs if that output satisfies a predetermined criterion given the input.

13. The system of claim 11, wherein the index has a first value corresponding to a combination of one of the inputs and one of the outputs if that output satisfies a predetermined criterion given the input.

14. The system of claim 11, wherein

the plurality of inputs includes at least one of words or phrases,

the outputs are web pages relevant to the words or phrases,

the index has a first value corresponding to a combination of one of the words or phrases and one of the web pages if that web page contains the one word or phrase;

and

the index has a second value corresponding to the combination of the one word or phrase and the one web page if that web page does not contain the one word or phrase.

15. The system of claim 11, wherein the first value

the plurality of inputs includes at least one of words or phrases,

the outputs are web pages relevant to the words or phrases,

the index has a respective value corresponding to each combination of one of the words or phrases and one of the web pages, the value being the number of times that one word or phrase appears in that web page.

16. A machine readable storage medium encoded with computer program code, such that, when the computer program code is executed by a processor, the processor performs a method comprising:

(a) providing an index that, given a set of inputs, a set of outputs, a set of input categories, and a scoring rule, provides a respective ordered subset of the outputs for each input category, the outputs within each subset ordered by predicted score of those outputs with respect to a respective input from a respective one of the input categories;

(b) receiving an input after step (a), the input corresponding to at least one of the set of input categories;

(c) scoring a reduced set of outputs against the received input using the scoring rule, the reduced set of outputs including a union of the respective subsets of the set of outputs associated with each of the input categories to which the received input corresponds; and

(d) outputting to a tangible machine readable storage medium, display or network a list including a subset of the reduced set of outputs having the highest scores.

17. The machine readable storage medium of claim 16, wherein the outputs are web pages, and the plurality of inputs includes at least one of the group consisting of words and phrases.

18. The machine readable storage medium of claim 17, wherein the query is a request for a list of web pages most relevant to words or phrases in the query.

19. The machine readable storage medium of claim 16, wherein the outputs are advertisements, and the inputs are web pages.

20. The machine readable storage medium of claim 19, wherein the query is a request for a list of advertisements most likely to be clicked if rendered in conjunction with a web page identified in the query.

21. The machine readable storage medium of claim 16, wherein the inputs are points in a Euclidean space, and the respective outputs are nearest neighbors to the respective input points.