IP Library Granted Patent US 8,548,999
Granted Patent B1
US 8,548,999 · App. 13/210,328 · Granted Oct 1, 2013

Query expansion

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 8,548,999
App. No.
13/210,328
Granted
Oct 1, 2013
Kind
B1
Abstract

An expanded queries data structure is described. The data structure is produced on the basis of a set of seed queries, and consists of entries each specifying an expanded query submitted by a user that has been determined to have a high degree of relatedness to at least a plurality of the seed queries of the set. The expanded queries specified by the entries of the expanded queries data structure can be used to define a segment of users expected to have interests characterized by the seed queries.

Claims (34)

1. A method in a computing system for constructing an index usable to identify expanded queries for a set of seed queries, comprising:

receiving a query history identifying, for each of a plurality of queries received from users, text of the query, a user submitting the query, and a time at which the query was submitted;

for each unique query identified by the query history:

for each user:

for every submission of the unique query by the user:

adding to an entry of the index for the unique query an instance of any query submitted by the user within a predetermined time period of the submission of the unique query by the user;

receiving a set of seed queries;

for each of the seed queries of the set:

identifying an entry of the index corresponding to the seed query;

submitting to a search engine a request to match the query instances added to the identified entry against the query instances added to the entries of the index other than the identified entry;

receiving from the search engine a score for each entry of the index other than the identified entry indicating the extent to which the query instances added to the identified entry matches the query instances added to the entry; and

selecting as expanded queries the queries corresponding to the entries of the index other than the identified entry having the highest scores.

2. The method of claim 1 , further comprising, before the adding, normalizing the text of the queries identified by the query history.

3. The method of claim 1 , further comprising constructing a segment definition based on the selected expanded queries.

4. The method of claim 3 wherein the constructed segment definition is further based on the set of seed queries.

5. A computer-readable medium whose contents cause a computing system to perform a method for constructing an index usable to identify expanded queries for a set of seed queries, the method comprising:

receiving a query history identifying, for each of a plurality of queries received from users, text of the query, a user submitting the query, and a time at which the query was submitted;

for each unique query identified by the query history:

for each of a plurality of publicly-available information sources:

submitting the unique query as a query to the publicly-available information source;

receiving a response to the submitted query; and

storing text contained by the response in an entry of the index for the unique query

receiving a set of seed queries;

for each of the seed queries of the set:

identifying an entry of the index corresponding to the seed query;

submitting to a search engine a request to match the text stored in the identified entry against the text stored in the entries of the index other than the identified entry;

receiving from the search engine a score for each entry of the index other than the identified entry indicating the extent to which the text stored in the identified entry matches the text stored in the entry; and

selecting as expanded queries the queries corresponding to the entries of the index other than the identified entry having the highest scores.

6. The computer-readable medium of claim 5 , the method further comprising, before the adding, normalizing the text of the queries identified by the query history.

7. The computer-readable medium of claim 5 , the method further comprising:

storing in each entry indications of the information source from which different portions of the text stored in the entry was received;

for each query corresponding to the entries of the index other than the identified entry, before the selecting, weighting the score in accordance with the number of information sources from which text matching the text stored in the identified entry was received.

8. The computer-readable medium of claim 5 , the method further comprising constructing a segment definition based on the selected expanded queries.

9. The computer-readable medium of claim 8 wherein the constructed segment definition is further based on the set of seed queries.

Assignments (4)
SECURITY INTEREST Recorded Sep 25, 2015
From: AUDIENCESCIENCE INC.
To: ORIX VENTURES, LLC
Reel/Frame 036654/0640 →
RELEASE OF SECURITY INTEREST Recorded Sep 11, 2015
From: GOLD HILL CAPITAL 2008, LP
To: AUDIENCESCIENCE, INC.
Reel/Frame 036587/0489 →
SECURITY AGREEMENT Recorded Nov 21, 2011
From: AUDIENCESCIENCE INC.
To: SILICON VALLEY BANK
Reel/Frame 027256/0756 →
SECURITY AGREEMENT Recorded Oct 12, 2011
From: AUDIENCESCIENCE, INC.
To: GOLD HILL CAPITAL 2008, LP
Reel/Frame 027047/0780 →