Data processing: database and file management or data structures – Database and file access – Preparing data for information retrieval
Reexamination Certificate
2011-08-16
2011-08-16
Bashore, William L (Department: 2175)
Data processing: database and file management or data structures
Database and file access
Preparing data for information retrieval
C707S706000, C707S713000, C707S737000
Reexamination Certificate
active
08001121
ABSTRACT:
A method and system for propagating the relevance of labeled documents to a query to unlabeled documents is provided. The propagation system provides training data that includes queries, documents labeled with their relevance to the queries, and unlabeled documents. The propagation system then calculates the similarity between pairs of documents in the training data. The propagation system then propagates the relevance of the labeled documents to similar, but unlabeled, documents. The propagation system may iteratively propagate labels of the documents until the labels converge on a solution. The training data with the propagated relevances can then be used to train a ranking function.
REFERENCES:
patent: 5418951 (1995-05-01), Damashek
patent: 5619709 (1997-04-01), Caid et al.
patent: 5649193 (1997-07-01), Sumita et al.
patent: 5724567 (1998-03-01), Rose et al.
patent: 5768578 (1998-06-01), Kirk et al.
patent: 5897639 (1999-04-01), Greef et al.
patent: 6182091 (2001-01-01), Pitkow et al.
patent: 6272507 (2001-08-01), Pirolli et al.
patent: 6286018 (2001-09-01), Pitkow et al.
patent: 6314420 (2001-11-01), Lang et al.
patent: 6463433 (2002-10-01), Baclawski
patent: 6691108 (2004-02-01), Li
patent: 6738678 (2004-05-01), Bharat et al.
patent: 7024418 (2006-04-01), Childress
patent: 7143091 (2006-11-01), Charnock et al.
patent: 7281005 (2007-10-01), Canright et al.
patent: 7305389 (2007-12-01), Zeng et al.
patent: 2002/0049705 (2002-04-01), Haviv-Segal et al.
patent: 2004/0098362 (2004-05-01), Gargi
patent: 2004/0133566 (2004-07-01), Ishiguro et al.
patent: 2005/0102251 (2005-05-01), Gillespie
patent: 2006/0004753 (2006-01-01), Coifman et al.
“Silk from a Sow's Ear: Extracting Usable Structures from the Web”, by Prolli et al., published 1996, pp. 1-14.
U.S. Appl. No. 11/364,807, filed Feb. 27, 2006, Wang et al.
Brinker, Klaus, “Active Learning of Label Ranking Functions,” Appearing in Proceedings of the 21st International Conference on Machine Learning, Canada, 2004, 8 pages.
Burges, Chris et al., “Learning to Rank using Gradient Descent,” Appearing in Proceedings of the 22nd International Conference on Machine Learning, Germany, 2005, 8 pages.
Cohen, William W., “Learning to Order Things,” Published May 1999, Journal of Artificial Intelligence Research, vol. 10, 1999, © 1999 AI Access Foundation and Morgan Kaufmann Publishers, pp. 243-270.
Crammer, Koby and Yoram Singer, “Pranking with Ranking,” NIPS 2002, 7 pages.
Freund, Yoav et al., “An Efficient Boosting Algorithm for Combining Preferences,” Published Nov. 2003, 2003 Journal of Machine Learning Research, vol. 4, pp. 933-969.
Harman, Donna, “Overview of the Third Text Retrieval Conference (TREC-3),” NIST Special Publication 500-226, 1995, 19 pages.
Harrington, Edward F., “Online Ranking/Collaborative Filtering using the Perceptron Algorithm,” Proceedings of the 20th International Conference on Machine Learning (ICML-2003), Washington DC, 2003, 8 pages.
He, Jingrui et al., “Manifold-Ranking Based Image Retrieval,” MM'04, Oct. , New York, © 2004 ACM, 8 pages.
Herbrich, Ralf, Thore Graepel and Klaus Obermayer, “Large Margin Rank Boundaries for Ordinal Regression,” Smola, Bartlett, Scholkopf, and Schuurmans: Advances in Large Margin Classifiers, Mar. 26, 2000, MIT Press, pp. 115-132.
Inoue, Kohei and Kiichi Urahama, “Recognition and Retrieval of Face Images by Semi-supervised Learning,” PCM 2004, © 2004 Springer-Verlag Berlin Heidelberg, pp. 561-568.
Jarvelin, Kalervo and Jaana Kekalainen, “IR evaluation methods for retrieving highly relevant documents,” SIGIR 2000, Athens, Greece, © 2000 ACM, pp. 41-48.
Pass, Greg, Ramin Zabih and Justin Miller, “Comparing Images Using Color Coherence Vectors,” 14th ACM International Conference on Multimedia, 1997, pp. 1-14.
Shi, Jianbo and Jitendra Malik, “Normalized Cuts and Image Segmentation,” Nov. 16, 1999, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, No. 8, Aug. 2000, © 2000 IEEE, pp. 888-905.
Stricker, Markus and Markus Orengo, “Similarity of Color Images,” Storage and Retrieval for Image and Video Databases, Proceedings of SPIE 1995, San Jose, California, pp. 1-12.
Zhou, Dengyong et al., “Learning with Local and Global Consistency,” NIPS 2003, 8 pages.
Zhou, Dengyong et al., “Ranking on Data Manifolds,” NIPS 2003, 8 pages.
PCT International Search Report, Aug. 14, 2007, PCT/US2007/005149.
Qin, Tao et al., A Study of Relevance Propagation for Web Search, SIGIR'05, Aug. 15-19, 2005, Salvador, Brazil, © 2005 ACM, pp. 408-415.
Shakery, Azadeh and ChengXiang Zhai, “Relevance Propagation for Topic Distillation UIUC TREC-2003 Web Track Experiments,” NIST Special Publication 500-255: The Twelfth Text Retrieval Conference, Gaithersburg, Maryland, 2003.
Wang, Xin-Jing et al., “Multi-Model Similarity Propagation and its Application for Web Image Retrieval,” ACM Multimedia'04, Oct. 10-16, 2004, New York, NY, © 2004 ACM, pp. 944-951.
Supplementary European Search Report; European Application No. 07751873, Mailed on Feb. 18, 2010.
Supplementary European Search Report; European Patent Application No. 07751881, Mailed on Feb. 18, 2010.
Jing, Feng, et al., “Keyword Propagation for Image Retrieval,” IEEE Symposium on Circuits and Systems, 2004, vol. 2, pp. 53-56.
Burges, Christopher, “Ranking as learning structured outputs,” Proceedings of the NIPS 2005 Workshop on Learning, 4 pages.
Trotman, Andrew, “Learning to Rank,” Information Retrieval, Kluwer Academic Publishers, BO, vol. 8, No. 3, Jan. 1, 2005, pp. 359-381.
Li Mingjing
Li Zhiwei
Ma Wei-Ying
Wang Jue
Bashore William L
Distefano Gregory A
Microsoft Corporation
Perkins Coie LLP
LandOfFree
Training a ranking function using propagated document relevance does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Training a ranking function using propagated document relevance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Training a ranking function using propagated document relevance will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2779829