IP Library Granted Patent US 7,689,540
Granted Patent B2
US 7,689,540 · App. 11/613,004 · Granted Mar 30, 2010

Collaborative user query refinement

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,689,540
App. No.
11/613,004
Granted
Mar 30, 2010
Kind
B2
Abstract

A first query and a second query, both of which were submitted by a first user to identify information that satisfies a single information need of the first user, are received. The first query and the second query are stored in association with one another and based on a chronological order in which the first query and the second query were submitted by the first user to generate a first query reformulation path. A query is received from a user and more than one query reformulation path is accessed. The received query is compared with queries included in the accessed query reformulation paths to identify a relationship between the received query and a query included in a relevant query reformulation path. One or more prevalent end points is determined based on the relevant query reformulation path and at least one of the prevalent end points is presented to the user.

Claims (62)

1. A computer-implemented method comprising:

receiving multiple series of queries;

determining that each of the multiple series of queries were submitted by a user when seeking information that satisfies a single information need;

determining that a starting point of each of the multiple series of queries is the same, the starting point being at least one query submitted chronologically before other queries included in the multiple series of queries;

determining that an end point of at least some of the multiple series of queries differs, the end point being at least one query submitted chronologically after the at least one query representing the starting point;

in response to determining that the starting point of each of the multiple series of queries is the same and that the ending point of at least some of the multiple series of queries differs:

identifying a subset of end points of the multiple series of queries that excludes at least the end point found in a minimum number of the multiple series of queries; and

generating a query reformulation path that associates the starting point with the subset of end points; and

storing the generated query reformulation path to enable presentation of the subset of end points in response to receipt of the at least one query representing the starting point.

2. The method of claim 1 further comprising:

accessing at least one second query reformulation path;

comparing the query reformulation path with the at least one second query reformulation path;

recognizing a pattern common to the query reformulation path and the at least one second query reformulation path; and

generating a query reformulation pattern based on the recognized pattern.

3. The method of claim 2 wherein generating a query reformulation pattern includes generating a query reformulation pattern in which at least a portion of the query reformulation pattern is related to higher level semantics.

4. The method of claim 3 wherein the higher level semantics include a classification of at least one query within each of the query reformulation paths that were used to generate the query reformulation pattern, such that the query reformulation pattern is more generic than each of its component query reformulation paths.

5. The method of claim 1 wherein:

identifying the subset of end points of the multiple series of queries that excludes at least the end point found in the minimum number of the multiple series of queries comprises identifying the end point found in a maximum number of the multiple series of queries;

generating the query reformulation path that associates the starting point with the subset of end points comprises generating the query reformulation path that associates the starting point with the end point found in the maximum number of the multiple series of queries; and

storing the generated query reformulation path to enable presentation of the subset of end points in response to receipt of the at least one query representing the staffing point comprises storing the generated query reformulation path to enable presentation of the end point found in the maximum number of the multiple series of queries in response to receipt of the at least one query representing the staffing point.

6. A computer-readable storage medium encoded with a computer program comprising instructions that, when executed, operate to cause a computer to perform operations comprising:

receiving multiple series of queries;

determining that each of the multiple series of queries were submitted by a user when seeking information that satisfies a single information need;

determining that a starting point of each of the multiple series of queries is the same, the starting point being at least one query submitted chronologically before other queries included in the multiple series of queries;

determining that an end point of at least some of the multiple series of queries differs, the end point being at least one query submitted chronologically after the at least one query representing the starting point;

in response to the determination that the starting point of each of the multiple series of queries is the same and the determination that the ending point of at least some of the multiple series of queries differs:

identifying a subset of end points of the multiple series of queries that excludes at least the end point found in a minimum number of the multiple series of queries; and

generating a query reformulation path that associates the starting point with the subset of end points; and

storing the generated query reformulation path to enable presentation of the subset of end points in response to receipt of the at least one query representing the starting point.

7. The computer-readable storage medium of claim 6 wherein the operations further comprise:

accessing at least one second query reformulation path:

comparing the query reformulation path with the at least one second query reformulation path:

recognizing a pattern common to the query reformulation path and the at least one second query reformulation path; and

generating a query reformulation pattern based on the recognized pattern.

8. The computer-readable storage medium of claim 7 wherein generating a query reformulation pattern includes generating a query reformulation pattern in which at least a portion of the query reformulation pattern is related to higher level semantics.

9. The computer-readable storage medium of claim 8 wherein the higher level semantics include a classification of at least one query within each of the query reformulation paths that were used to generate the query reformulation pattern, such that the query reformulation pattern is more generic than each of its component query reformulation paths.

10. The computer-readable storage medium of claim 6 wherein:

identifying the subset of end points of the multiple series of queries that excludes at least the end point found in the minimum number of the multiple series of queries comprises identifying the end point found in a maximum number of the multiple series of queries;

generating the query reformulation path that associates the starting point with the subset of end points comprises generating the query reformulation path that associates the starting point with the end point found in the maximum number of the multiple series of queries; and

storing the generated query reformulation path to enable presentation of the subset of end points in response to receipt of the at least one query representing the starting point comprises storing the generated query reformulation path to enable presentation of the end point found in the maximum number of the multiple series of queries in response to receipt of the at least one query representing the starting point.

11. A system comprising:

at least one computer; and

at least one computer-readable medium coupled to the at least one computer having instructions stored thereon which, when executed by the at least one computer, cause the at least one computer to perform operations comprising:

receiving multiple series of queries:

determining that each of the multiple series of queries were submitted by a user when seeking information that satisfies a single information need;

determining that a starting point of each of the multiple series of queries is the same, the starting point being at least one query submitted chronologically before other queries included in the multiple series of queries;

determining that an end point of at least some of the multiple series of queries differs, the end point being at least one query submitted chronologically after the at least one query representing the starting point;

in response to the determination that the starting point of each of the multiple series of queries is the same and the determination that the ending point of at least some of the multiple series of queries differs:

identifying a subset of end points of the multiple series of queries that excludes at least the end point found in a minimum number of the multiple series of queries; and

generating a query reformulation path that associates the starting point with the subset of end points; and

storing the generated query reformulation path to enable presentation of the subset of end points in response to receipt of the at least one query representing the starting point.

12. The system of claim 11 wherein the operations further comprise:

accessing at least one second query reformulation path;

comparing the query reformulation path with the at least one second query reformulation path;

recognizing a pattern common to the query reformulation path and the at least one second query reformulation path; and

generating a query reformulation pattern based on the recognized pattern.

13. The system of claim 12 wherein generating a query reformulation pattern includes generating a query reformulation pattern in which at least a portion of the query reformulation pattern is related to higher level semantics.

14. The system of claim 13 wherein the higher level semantics include a classification of at least one query within each of the query reformulation paths that were used to generate the query reformulation pattern, such that the query reformulation pattern is more generic than each of its component query reformulation paths.

15. The system of claim 11 wherein:

identifying the subset of end points of the multiple series of queries that excludes at least the end point found in the minimum number of the multiple series of queries comprises identifying the end point found in a maximum number of the multiple series of queries;

generating the query reformulation path that associates the starting point with the subset of end points comprises generating the query reformulation path that associates the starting point with the end point found in the maximum number of the multiple series of queries; and

storing the generated query reformulation path to enable presentation of the subset of end points in response to receipt of the at least one query representing the starting point comprises storing the generated query reformulation path to enable presentation of the end point found in the maximum number of the multiple series of queries in response to receipt of the at least one query representing the starting point.

Assignments (6)
PATENT SECURITY AGREEMENT (FIRST LIEN) Recorded Sep 29, 2022
From: YAHOO ASSETS LLC
To: ROYAL BANK OF CANADA, AS COLLATERAL AGENT
Reel/Frame 061571/0773 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 16, 2021
From: YAHOO AD TECH LLC (FORMERLY VERIZON MEDIA INC.)
To: YAHOO ASSETS LLC
Reel/Frame 058982/0282 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 26, 2020
From: OATH INC.
To: VERIZON MEDIA INC.
Reel/Frame 054258/0635 →
TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS Recorded Nov 16, 2010
From: BANK OF AMERICA, N A
To: AOL INC; AOL ADVERTISING INC; GOING INC; LIGHTNINGCAST LLC; MAPQUEST, INC; NETSCAPE COMMUNICATIONS CORPORATION; QUIGO TECHNOLOGIES LLC; SPHERE SOURCE, INC; TACODA LLC; TRUVEO, INC; YEDDA, INC
Reel/Frame 025323/0416 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 31, 2009
From: AOL LLC
To: AOL INC.
Reel/Frame 023723/0645 →
SECURITY AGREEMENT Recorded Dec 14, 2009
From: AOL INC.; AOL ADVERTISING INC.; BEBO, INC.; ICQ LLC; GOING, INC.; LIGHTNINGCAST LLC; MAPQUEST, INC.; NETSCAPE COMMUNICATIONS CORPORATION; QUIGO TECHNOLOGIES LLC; SPHERE SOURCE, INC.; TACODA LLC; TRUVEO, INC.; YEDDA, INC.
To: BANK OF AMERICAN, N.A. AS COLLATERAL AGENT
Reel/Frame 023649/0061 →