Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2008-04-22
2008-04-22
Alam, Hosain (Department: 2166)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
07363296
ABSTRACT:
Rating information retrieval algorithms. A query is received and submitted to a search engine for execution on an index file. A list of index documents and a plurality of attributes are received from the search engine in response to the submitted query. A portion of the received list of index documents and the received plurality of attributes are stored in a subindex file. The received query is executed on the subindex file to obtain a list of subindex documents. The obtained list of subindex documents is ranked by a particular ranking algorithm using the attributes associated therewith. The list of ranked subindex documents is compared with a list of subjectively ranked documents to generate a score for the particular ranking algorithm. The generated score represents a degree of correlation between the list of ranked subindex documents and the list of subjectively ranked documents.
REFERENCES:
patent: 4417321 (1983-11-01), Chang et al.
patent: 6070158 (2000-05-01), Kirsch et al.
patent: 6178419 (2001-01-01), Legh-Smith et al.
patent: 6334131 (2001-12-01), Chakrabarti 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: 6725259 (2004-04-01), Bharat
patent: 6728932 (2004-04-01), Chundi et al.
patent: 6757667 (2004-06-01), Patel
patent: 6785671 (2004-08-01), Bailey et al.
patent: 6810395 (2004-10-01), Bharat
patent: 6944609 (2005-09-01), Witbrock
patent: 7003513 (2006-02-01), Geiselhart
patent: 7010527 (2006-03-01), Alpha
patent: 7219090 (2007-05-01), Travis, Jr.
patent: 7219099 (2007-05-01), Kuntala et al.
patent: 2002/0123988 (2002-09-01), Dean et al.
patent: 2002/0133481 (2002-09-01), Smith et al.
patent: 2003/0212699 (2003-11-01), Denesuk 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
Abdur Chowdhury and Ian Soboroff,“Automatic Evaluation of World Wide Web Search Services”, ACM, SIGIR 2002.
Brin, S. et al., “The Anatomy of a Large-Scale Hypertextual Web Search Engine” Proceedings of the 7th International World Wide Web Conference, 1998, 18 pages, available at http://www7.scu.edu.au/programme/fullpapers/1921/com1921.htm WWW Consortium, Australia.
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, 2003, pp. 933-969, vol. 4, MIT Press, Cambridge, MA, U.S.A.
Crammer et al., “A Family of Additive Online Algorithms for Category Ranking,” The Journal of Machine Learning Research, 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, available at http://emlab.berkeley.edu/Software/abstracts/goffe895.html, 2 pages.
Brewer Brett D.
Hamilton Nicole Ashley
Hurst-Hiller Oliver
Naam Ramez
Alam Hosain
Lin Shew-Fen
Microsoft Corporation
Senniger Powers LLP
LandOfFree
Generating a subindex with relevant attributes to improve... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Generating a subindex with relevant attributes to improve..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generating a subindex with relevant attributes to improve... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2769754