Data processing: database and file management or data structures – Database and file access – Record – file – and data search and comparisons
Reexamination Certificate
2011-01-11
2011-01-11
Rones, Charles (Department: 2164)
Data processing: database and file management or data structures
Database and file access
Record, file, and data search and comparisons
C707S769000
Reexamination Certificate
active
07870147
ABSTRACT:
An information retrieval system includes a query revision architecture providing one or more query revisers, each of which implements a query revision strategy. A query rank reviser suggests known highly-ranked queries as revisions to a first query by initially assigning a rank to all queries, and identifying a set of known highly-ranked queries (KHRQ). Queries with a strong probability of being revised to a KHRQ are identified as nearby queries (NQ). Alternative queries that are KHRQs are provided as candidate revisions for a given query. For alternative queries that are NQs, the corresponding known highly-ranked queries are provided as candidate revisions.
REFERENCES:
patent: 5826260 (1998-10-01), Byrd et al.
patent: 5897627 (1999-04-01), Leivian et al.
patent: 6006221 (1999-12-01), Liddy et al.
patent: 6006222 (1999-12-01), Culliss
patent: 6014665 (2000-01-01), Culliss
patent: 6078916 (2000-06-01), Culliss
patent: 6088692 (2000-07-01), Driscoll
patent: 6169986 (2001-01-01), Bowman et al.
patent: 6182068 (2001-01-01), Culliss
patent: 6243076 (2001-06-01), Hatfield
patent: 6285999 (2001-09-01), Page
patent: 6311175 (2001-10-01), Adriaans et al.
patent: 6397211 (2002-05-01), Cooper
patent: 6411950 (2002-06-01), Moricz et al.
patent: 6463430 (2002-10-01), Brady et al.
patent: 6519585 (2003-02-01), Kohli
patent: 6523020 (2003-02-01), Weiss
patent: 6539377 (2003-03-01), Culliss
patent: 6546388 (2003-04-01), Edlund et al.
patent: 6546389 (2003-04-01), Agrawal et al.
patent: 6651054 (2003-11-01), de Judicibus
patent: 6671711 (2003-12-01), Pirolli et al.
patent: 6675159 (2004-01-01), Lin et al.
patent: 6701309 (2004-03-01), Beeferman et al.
patent: 6714929 (2004-03-01), Micaelian et al.
patent: 6718363 (2004-04-01), Ponte
patent: 6732088 (2004-05-01), Glance
patent: 6738764 (2004-05-01), Mao et al.
patent: 6751611 (2004-06-01), Krupin et al.
patent: 6772150 (2004-08-01), Whitman et al.
patent: 6782390 (2004-08-01), Lee et al.
patent: 6799176 (2004-09-01), Page
patent: 6829599 (2004-12-01), Chidlovskii
patent: 6856957 (2005-02-01), Dumoulin
patent: 6981040 (2005-12-01), Konig et al.
patent: 7031961 (2006-04-01), Pitkow et al.
patent: 7058628 (2006-06-01), Page
patent: 7065524 (2006-06-01), Lee
patent: 7222127 (2007-05-01), Bem et al.
patent: 7293017 (2007-11-01), Hurst-Hiller et al.
patent: 7383258 (2008-06-01), Harik et al.
patent: 7516118 (2009-04-01), Badros et al.
patent: 7565345 (2009-07-01), Bailey et al.
patent: 7617205 (2009-11-01), Bailey et al.
patent: 2002/0002438 (2002-01-01), Ohmura et al.
patent: 2002/0083067 (2002-06-01), Tamayo et al.
patent: 2003/0014399 (2003-01-01), Hansen et al.
patent: 2003/0093408 (2003-05-01), Brown et al.
patent: 2003/0135413 (2003-07-01), Nishi et al.
patent: 2003/0144994 (2003-07-01), Wen et al.
patent: 2003/0172075 (2003-09-01), Reisman
patent: 2003/0210666 (2003-11-01), Trossen et al.
patent: 2003/0212666 (2003-11-01), Basu et al.
patent: 2003/0217052 (2003-11-01), Rubenczyk et al.
patent: 2003/0220912 (2003-11-01), Fain et al.
patent: 2004/0068486 (2004-04-01), Chidlovskii
patent: 2004/0083211 (2004-04-01), Bradford
patent: 2004/0186827 (2004-09-01), Anick et al.
patent: 2004/0199419 (2004-10-01), Kim et al.
patent: 2004/0199498 (2004-10-01), Kapur et al.
patent: 2004/0236721 (2004-11-01), Pollack
patent: 2004/0254920 (2004-12-01), Brill et al.
patent: 2005/0027691 (2005-02-01), Brin et al.
patent: 2005/0044224 (2005-02-01), Jun et al.
patent: 2005/0071337 (2005-03-01), Baranczyk et al.
patent: 2005/0125215 (2005-06-01), Wu et al.
patent: 2005/0149499 (2005-07-01), Franz et al.
patent: 2005/0198068 (2005-09-01), Mukherjee et al.
patent: 2005/0210024 (2005-09-01), Hurst-Hiller et al.
patent: 2005/0256848 (2005-11-01), Alpert et al.
patent: 2006/0023005 (2006-02-01), Katsuyama et al.
patent: 2006/0026013 (2006-02-01), Kraft
patent: 2006/0031214 (2006-02-01), Solaro et al.
patent: 2006/0041560 (2006-02-01), Forman et al.
patent: 2006/0074883 (2006-04-01), Teevan et al.
patent: 2006/0218475 (2006-09-01), Bodin et al.
patent: 2006/0230022 (2006-10-01), Bailey
patent: 2007/0100804 (2007-05-01), Cava
patent: 2007/0106937 (2007-05-01), Cucerzan et al.
patent: 01/80070 (2001-10-01), None
patent: 01/82134 (2001-11-01), None
Boyan, J.A. et al., “Learning Evaluation Functions for Global Optimization and Boolean Satisfiability,” 1998, [online] Retrieved from the Internet<URL:http://www.autonlab.org/autonweb/14682/version/2/part/5/data/boyan-learning.pdf?branch=main&language=en>.
Jaczynski, M. et al., “Broadway: A Case-Based System for Cooperative Information Browsing on the World-Wide-Web,” INRIA Sophia-Antipolis, Action AID, 12 pages.
PCT International Search Report and Written Opinion, PCT/US05/10681, Oct. 18, 2006, 7 pages.
U.S. Appl. No. 11/096,726, filed Mar. 30, 2005, Lamping et al.
U.S. Appl. No. 11/090,302, filed Mar. 28, 2005, Lamping et al.
U.S. Appl. No. 10/900,021, filed Jul. 26, 2004, Patterson.
U.S. Appl. No. 10/878,926, filed Jun. 28, 2004, Battle et al.
U.S. Appl. No. 10/734,584, filed Dec. 15, 2003, Bem et al.
U.S. Appl. No. 10/676,571, filed Sep. 30, 2003, Harik et al.
U.S. Appl. No. 10/668,721, filed Sep. 22, 2003, Haahr et al.
Chang, D. T., “HieNet: A User-Centered Approach for Automatic Link Generation,” ACM, Hypertext '93 Proceedings, Nov. 1993, pp. 145-158.
“How the Vivisimo Clustering Engine Works”, Vivisimo, Inc., 2003, 2 pages.
PCT International Search Report and Written Opinion, PCT/US06/09076, Sep. 20, 2007, 8 pages.
Cui, Hang et al., “Probabilistic Query Expansion Using Query Logs”, Proceedings of the 11th International Conference on the World Wide Web, May 7-11, 2002, Honolulu, HI, 8 pages.
Harmann, D., “Towards interactive query expansion,” Proceedings of the 11thAnnual International ACM-SIGIR Conference on Research and Development in Information Retrieval, [Online] 1988, pp. 321-331, XP002527677 Grenoble, France, ISBN: 2-7061-0309-4, Retrieved from the Internet: URL:http://portal.acm.org/citation.cfm?id=62437.62469. [retrieved on May 12, 2009] *the whole document.*
Magennis et al., “The Potential and Actual Effectiveness of Interactive Query Expansion,” Proceedings of the 20thAnnual International ACM-SIGIR Conference on Research and Development in Information Retrieval, Philadelphia, PA, Jul. 27-31, 1997; Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, Jul. 27, 1997, pp. 324-332, XP000782015, ISBN: 978-0-89791-836-7, *the whole document.*
Office Action for Application No. 05 731 419.7 -2201, Reference EPP98293, mailed Sep. 23, 2009.
U.S. Appl. No. 10/878,926, mailed Jun. 28, 2004, Battle et al.
Weis et al.: Rule-based Machine Learning Methods for Functional Prediction, Journal of AI Research, vol. 3, Dec. 1995, pp. 383-403.
Crestani, F. et al., “Is This Document Relevant? . . . Probably”: A Survey of Probablistic Models in Information Retrieval, ACM Computing Surveys, vol. 30., No. 4, Dec. 1998, pp. 528-552.
Friedman, J. et al., “Additive Logistic Regressing: A Statistical View of Boosting,” Department of Statistics, Stanford University Technical Report, Aug. 20, 1009, pp. 1-4.
Joachims, T. et al., “Evaluating Retrieval Performance Using Clickthrough Data,” Department of Computer Science, Cornell University, pp. 1-18.
Joachims, T. et al., “Optimizing Search Engines Using Clickthrough Data,” Department of Computer Science, Cornell University, pp. 1-10.
Ng, A. et al., “On Discriminativevs.Generative Classifiers: A Comparison of Logistic Regression and Naïve Bayes,” Dietterich (eds.), Advances in Neural Information Processing Systems 14, Cambridge, MA, MIT Press, 2002, pp. 841-848.
European Examiner Tzvetanka Herry, Supplementary European Search Report , EP06738165.7, dated Jan. 20, 2010.
Agnes Wittmann-Regis, International Preliminary Report on Patentability for PCT/US2005/010681, dated Oct. 18, 2006 (4 pages).
Office Action from U.S. Appl. No. 10/878,926, dated Dec. 12, 2006 (16 pages).
A
Bailey David R.
Battle Alexis J.
Cohn David Ariel
Engelhardt Barbara
Nayak P. Pandurang
Choi Yuk Ting
Fish & Richardson P.C.
Google Inc.
Rones Charles
LandOfFree
Query revision using known highly-ranked queries does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Query revision using known highly-ranked queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Query revision using known highly-ranked queries will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2688408