Data processing: database and file management or data structures – Database and file access – Query optimization
Reexamination Certificate
2011-04-12
2011-04-12
Stevens, Robert (Department: 2162)
Data processing: database and file management or data structures
Database and file access
Query optimization
C707S723000, C707S736000
Reexamination Certificate
active
07925644
ABSTRACT:
A method and system for use in information retrieval includes, for each of a plurality of terms, selecting a predetermined number of top scoring documents for the term to form a corresponding document set for the term. When a plurality of terms are received, optionally as a query, the system ranks, using an inverse document frequency algorithm, the plurality of terms for importance based on the document sets for the plurality of terms. Then a number of ranked terms are selected based on importance and a union set is formed based on the document sets associated with the selected number of ranked terms.
REFERENCES:
patent: 5263159 (1993-11-01), Mitsui
patent: 5826260 (1998-10-01), Byrd et al.
patent: 5907840 (1999-05-01), Evans
patent: 5920854 (1999-07-01), Kirsch et al.
patent: 5926811 (1999-07-01), Miller et al.
patent: 6138114 (2000-10-01), Horowitz
patent: 6205443 (2001-03-01), Evans
patent: 6408294 (2002-06-01), Getchius et al.
patent: 6519586 (2003-02-01), Anick et al.
patent: 6546388 (2003-04-01), Edlund et al.
patent: 6594658 (2003-07-01), Woods
patent: 6947930 (2005-09-01), Anick et al.
patent: 7047242 (2006-05-01), Ponte
patent: 7203675 (2007-04-01), Papierniak et al.
patent: 7243092 (2007-07-01), Woehler et al.
patent: 7269545 (2007-09-01), Agichtein et al.
patent: 7424488 (2008-09-01), Aggarwal et al.
patent: 7685091 (2010-03-01), Boone et al.
patent: 2002/0169595 (2002-11-01), Agichtein et al.
patent: 2003/0217047 (2003-11-01), Marchisio
patent: 2005/0210006 (2005-09-01), Robertson et al.
patent: 2006/0074883 (2006-04-01), Teevan et al.
patent: 2006/0259482 (2006-11-01), Altevogt et al.
patent: 2006/0277173 (2006-12-01), Li et al.
patent: 2007/0185871 (2007-08-01), Canright et al.
patent: 2007/0198459 (2007-08-01), Boone et al.
patent: 2008/0288483 (2008-11-01), Lin et al.
“Okapi BM25”, Wikipedia, downloaded from en.wikipedia.org/wiki/Okapi—BM25, Jun. 18, 2010, pp. 1-4.
Cao, Yunbo, et al., “Adapting Ranking SVM to Document Retrieval”, SIGIR '06, Seattle, WA, Aug. 6-11, 2006, pp. 186-193.
Robertson, Stephen, “Understanding Inverse Document Frequency: On Theoretical Arguments for IDF”, Journal of Documentation, vol. 60. No. 5, © 2004, pp. 1-19.
Trotman, Andrew, “Choosing Document Structure Weights”, Information Processing and Management, vol. 41, Issue 2, Mar. 2005, pp. 243-264.
Singhal, Amit, et al., “Document Length Normalization”, Information Processing and Management, vol. 32, Issue 5, Sep. 1996, pp. 619-633.
Hawking, David, et al., “Toward Better Weighting of Anchors”, SIGIR '04, Sheffield, South Yorkshire, UK, Jul. 25-29, 2004, pp. 512-513.
Anh, Vo Ngoc, et al., “Simplified Similarity Scoring Using Term Ranks”, SIGIR '05, Salvador, Brazil, Aug. 15-19, 2005, pp. 226-233.
Mishra, Rajeev Kumar, et al., “KhojYantra: An Integrated MetaSearch Engine with Classification, Clustering and Ranking”, IDEAS 2000, Yokohama, Japan, Sep. 18-20, 2000, pp. 122-131.
Yang, Lingpeng, et al., “Document Re-ranking Using Cluster Validation and Label Propagation”, CIKM '06, Arlington, VA, Nov. 5-11, 2006, pp. 690-697.
Vechtomova, Olga, et al., “Interactive search refinement techniques for Hard tasks”, www.scientificcommons.org/43269845, © 2004, pp. 1-8.
Cummins, Ronan, et al., “Evolving General Term-Weighting Schemes for Information Retrieval: Tests on Larger Collections”, Artificial Intelligence Review, vol. 24, Nos. 3-4, Nov. 2005, pp. 277-299.
Vinay, Vishwa, et al., “On Ranking the Effectiveness of Searches”, SIGIR '06, Seattle, WA, Aug. 6-11, 2006, pp. 398-404.
Osiński, Stanislaw, et al., “Lingo: Search Results Clustering Algorithm Based on Singular Value Decomposition”, Springer Verlag, © 2004, pp. 359-368.
Gravano, Luis, et al., “GIOSS: Text-Source Discovery over the Internet”, ACM Transactions on Database Systems, vol. 24, No. 2, Jun. 1999, pp. 229-264.
Li, Longzhuang, et al., “Improvement of HITS-based Algorithms on Web Documents”, WWW 2002, Honolulu, HI, May 7-11, 2002, pp. 527-535.
Chen Zheng
Ji Lei
Lin Chenxi
Wang Jian
Zeng Hua-Jun
Lee & Hayes PLLC
Microsoft Corporation
Stevens Robert
LandOfFree
Efficient retrieval algorithm by query term discrimination does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Efficient retrieval algorithm by query term discrimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient retrieval algorithm by query term discrimination will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2707964