Systems and methods for query expansion

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000, C707S793000, C707S793000

Reexamination Certificate

active

10365294

ABSTRACT:
Systems and methods for query expansion are described. In one aspect, new terms are extracted from a newly submitted query. Terms to expand the new terms are identified to a relevant document list. The expansion term are identified at least in part on the new terms and probabilistic correlations from information in a query log. The query log information includes one or more query terms and a corresponding set of document identifiers (IDs). The query terms were previously submitted to a search engine. The document IDs represent each document selected from a list generated by the search engine in response to searching for information relevant to corresponding ones of the query terms.

REFERENCES:
patent: 5787422 (1998-07-01), Tukey et al.
patent: 5864845 (1999-01-01), Voorhees et al.
patent: 6128613 (2000-10-01), Wong et al.
patent: 6169986 (2001-01-01), Bowman et al.
patent: 6701309 (2004-03-01), Beeferman et al.
patent: 6772150 (2004-08-01), Whitman et al.
patent: 6856957 (2005-02-01), Dumoulin
patent: 6886010 (2005-04-01), Kostoff
patent: 6925433 (2005-08-01), Stensmo
patent: 2002/0099701 (2002-07-01), Rippich
patent: 2002/0133726 (2002-09-01), Kawamae et al.
patent: 2003/0004968 (2003-01-01), Romer et al.
patent: 2004/0220925 (2004-11-01), Liu et al.
patent: 2004/0243568 (2004-12-01), Wang et al.
Automatic Feedback Using Past Queries: Social Searching?, Author: Larry Fitzpatrick et al Published: Jul. 1997.
Wong, S.K.M. and Yao, Y.Y.; “A Probabilistic Method for Computing Term-by-term Relationships” Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada; 24 pages.
Cui, Hang et al.; “Probabilistic Query Expansion Using Query Logs” Microsoft Research Asia, Beijing, Tianjin University, Tianjin, P.R. China, May 2002, 8 pages.
Xu, Jinxi and Croft, W. Bruce; “Improving the Effectiveness of Information Retrieval with Local Context Analysis” ACM Transactions on Information Systems, vol. 18, No. 1, Jan. 2000, pp. 79-112.
Buckley, Chris et al.; “Automatic Query Expansion Using SMART : TREC 3” Department of Computer Science, Cornell University, Ithaca, NY; 1998, 11 pages.
Attar, R. and Fraenkel, A.S.; “Local Feedback in Full-Text Retrieval Systems” Journal of the Association for Computing Machinery, vol. 24, No. 3, Jul. 1977, pp. 397-417.
S.K.M. Wong et al., “A Probabilistic Method for Computing Term-by-term Relationships,” Journal of the American Society for Information Science, 44(8), 1993, pp. 431-439.
Hang Cui et al., “Probabilistic Query Expansion Using Query Logs,” WWW 2002, May 7-11, 2002, Honolulu, Hawaii, USA (8 pages).
Jinxi Xu et al., “Improving the Effectiveness of Information Retrieval with Local Context Analysis,” ACM Transactions on Information Systems, vol. 18, No. 1, Jan. 2000, pp. 79-112.
Chris Buckley et al., “Automatic Query Expansion Using SMART : Trec 3,” Department of Computer Science, Cornell University, Ithaca, NY, 1995, (11 pages).
R. Attar et al., “Local Feedback in Full-Text Retrieval Systems,” Journal of the Association for Computing Machinery, vol. 24, No. 3, Jul. 1977, 397-417.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Systems and methods for query expansion does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Systems and methods for query expansion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for query expansion will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3877903

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.