Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-07-10
2007-07-10
Gaffin, Jeffrey (Department: 2165)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
10909162
ABSTRACT:
Improving ranking algorithms for information retrieval. The ranking algorithms operate on search results obtained from a search engine. Input information including information describing a first ranking algorithm, a first score associated with the first ranking algorithm, a second ranking algorithm, a second score associated with the second ranking algorithm, and causal information relating a difference between the first ranking algorithm and the second ranking algorithm with a difference between the first score and the second score is received. An optimizing algorithm is applied to the received input information to identify an optimal ranking algorithm having an optimal score. The optimal ranking algorithm is defined by a plurality of parameters and a plurality of weights associated with the plurality of parameters.
REFERENCES:
patent: 4417321 (1983-11-01), Chang et al.
patent: 6070158 (2000-05-01), Kirsch et al.
patent: 6526440 (2003-02-01), Bharat
patent: 6529903 (2003-03-01), Smith et al.
patent: 6606620 (2003-08-01), Sundaresan et al.
patent: 6615209 (2003-09-01), Gomes et al.
patent: 6658423 (2003-12-01), Pugh et al.
patent: 6678681 (2004-01-01), Brin
patent: 6701314 (2004-03-01), Conover et al.
patent: 6714929 (2004-03-01), Micaelian et al.
patent: 6728932 (2004-04-01), Chundi et al.
patent: 6757667 (2004-06-01), Patel
patent: 6944609 (2005-09-01), Witbrock
patent: 7010527 (2006-03-01), Alpha
patent: 2002/0123988 (2002-09-01), Dean et al.
patent: 2002/0133481 (2002-09-01), Smith et al.
patent: 2004/0002973 (2004-01-01), Chaudhuri et al.
patent: 2004/0010497 (2004-01-01), Bradley et al.
patent: 2004/0049514 (2004-03-01), Burkov
patent: 2004/0199419 (2004-10-01), Kim et al.
patent: 2005/0149504 (2005-07-01), Ratnaparkhi
patent: 2005/0210042 (2005-09-01), Goedken
patent: 2005/0234904 (2005-10-01), Brill et al.
patent: WO 01/46870 (2001-06-01), None
patent: WO 01/55905 (2001-08-01), None
patent: WO 02/41190 (2002-05-01), None
Brin, S. et al., “The Anatomy of a Large-Scale Hypertextual Web Search Engine” available at http://www7.scu.edu.au/programme/fullpapers/1921/com1921.htm dated Mar. 24, 2004, 18 pages.
Joachims, “Optimizing Search Engines Using Clickthrough Data,” Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery, 2002, pp. 133-142, ACM Press, New York, U.S.A.
Chowdhury et al., “Automatic Evaluation of World Wide Web Search Services,” Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2002, pp. 421-422, ACM Press, New York, U.S.A.
Salzberg, et al., “Comparison of Access Methods for Time-Evolving Data,” ACM Computing Surveys (CSUR), Jun. 1999, pp. 158-221, vol. 31, Issue 2, ACM Press, New York, U.S.A.
Singhal et al., “A Case Study in Web Search Using TREC Algorithms,” Proceedings of the Tenth International Conference on World Wide Web, 2001, pp. 708-716, ACM Press, New York, U.S.A.
Zhang et al., “Question Classification Using Support Vector Machines,” Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2003, pp. 26-32, ACM Press, New York, U.S.A.
Sormunen, “Liberal Relevance Criteria of TREC—Counting on Negligible Documents?”, Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2002, pp. 324-330, ACM Press, New York, U.S.A.
Freund et al., “An efficient Boosting Algorithm for Combining Preferences,” The Journal of Machine Learning Research, Dec. 2003, pp. 933-969, vol. 4, MIT Press, Cambridge, MA, U.S.A.
Crammer, “A Family of Additive Online Algorithms for Category Ranking,” The Journal of Machine Learning Research, Mar. 2003, pp. 1025-1058, vol. 3, MIT Press, Cambridge, MA, U.S.A.
Goffe, “Abstract: Simulated Annealing—Global Optimization Method That Distinguishes Between Different Local Optima,” 1995, 2 pages.
Brewer Brett D.
Hamilton Nicole Ashley
Hurst-Hiller Oliver
Naam Ramez
Gaffin Jeffrey
Microsoft Corporation
Senniger Powers
Veillard Jacques
LandOfFree
Machine directed improvement of ranking algorithms does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Machine directed improvement of ranking algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Machine directed improvement of ranking algorithms will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3786727