Optimization of discontinuous rank metrics

Details Optimization of discontinuous rank metrics Optimization of discontinuous rank metrics

2011-08-30

2011-08-30

Perveen, Rehana (Department: 2155)

Data processing: database and file management or data structures

Database and file access

Preparing data for information retrieval

C707S722000, C707S736000, C706S012000

Reexamination Certificate

active

08010535

ABSTRACT:
Methods to enable optimization of discontinuous rank metrics are described. The search scores associated with a number of search objects are written as score distributions and these are converted into rank distributions for each object in an iterative process. Each object is selected in turn and the score distribution of the selected object is compared to the score distributions of each other object in turn to generate a probability that the selected object is ranked in a particular position. For example, with three documents the rank distribution may give a 20% probability that a document is ranked first, a 60% probability that the document is ranked second and a 20% probability that the document is ranked third. In some embodiments, the rank distributions may then be used in the optimization of discontinuous rank metrics.

REFERENCES:
patent: 6654742 (2003-11-01), Kobayashi et al.
patent: 6701312 (2004-03-01), Lau et al.
patent: 7024404 (2006-04-01), Gerasoulis et al.
patent: 7257577 (2007-08-01), Fagin et al.
patent: 7895206 (2011-02-01), Narayanan et al.
patent: 2005/0060310 (2005-03-01), Tong et al.
patent: 2005/0065916 (2005-03-01), Ge et al.
patent: 2006/0074910 (2006-04-01), Yun et al.
patent: 2007/0016574 (2007-01-01), Carmel et al.
patent: 2007/0038620 (2007-02-01), Ka et al.
patent: 2007/0038622 (2007-02-01), Meyerzon et al.
patent: 2007/0094171 (2007-04-01), Burges et al.
patent: 2007/0239702 (2007-10-01), Vassilvitskii et al.
patent: 2007/0288438 (2007-12-01), Epstein
patent: 2008/0010281 (2008-01-01), Berkhin et al.
patent: 2008/0027936 (2008-01-01), Liu et al.
patent: 2009/0125498 (2009-05-01), Cao et al.
patent: 1006458 (2000-06-01), None
Agichtein, et al., “Improving Web Search Ranking by Incorporating User Behavior Information”, ACM, 2006, pp. 8.
Balakrishnan, et al., “Polynomial Approximation Algorithms for Belief Matrix Maintenance in Identity Management”, Dept. of Aeronautics and Astronautics, Stanford University, pp. 8.
Burges, et al., “Learning to Rank using Gradient Descent”, Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany, 2005, pp. 8.
Burges, at al., “Learning to Rank with Nonsmooth Cost Functions”, <<http://research.microsoft.com/˜cburges/papers/LambdaRank.pdf>>, pp. 8.
Cao, et al., “Learning to Rank: From Pairwise Approach to Listwise Approach”, ICML, 2007, pp. 9.
Caruana, at al., “Using the Future to “Sort Out” the Present: Rankprop and Multitask Learning for Medical Risk Evaluation”, <<http://www.cs.cmu.edu/afs/cs/project/theo-11/www
ips95.ps>>, pp. 7.
Chu, et al., “Gaussian Processes for Ordinal Regression”, Wei Chu and Zoubin Ghahramani, 2005, pp. 1019-1041.
Crammer, et al., “Pranking with Ranking”, <<http://citeseer.ist.psu.edu/cache/papers/cs/26676/http:zSzzSzwww-2.cs.cmu.eduzSzGroupszSzNIPSzSzNIPS2001zSzpaperszSzpsgzzSzAA65.pdf/crammer01pranking.pdf>>, pp. 7.
Diaz, “Regularizing Ad Hoc Retrieval Scores”, ACM, 2005, pp. 8.
Herbrich, et al., “Large Margin Rank Boundaries for Ordinal Regression” <<http://research.microsoft.com/˜rherb/papers/herobergrae99.ps.gz,>>, pp. 116-132.
Jarvelin, et al., “IR Evaluation Methods for Retrieving Highly Relevant Documents”, ACM, 2000, pp. 41-48.
Joachims, “Optimizing Search Engines using Click through Data”, ACM, 2002, pp. 10.
LeCun, et al., “Efficient BackProp” Springer, 1998, pp. 44.
Metzler, et al., “Lessons Learned From Three Terabyte Tracks”, University of Massachusetts, pp. 4.
Robertson, et al., “On Rank-Based Effectiveness Measures and Optimization”, Information Retrieval, vol. 10, 2007, pp. 1-28.
Robertson, et al., “Simple BM 25 Extension to Multiple Weighted Fields”, Microsoft Research,, pp. 8.
Snelson, et al., “Soft Rank with Gaussian Processes”, Microsoft Research, 2007, pp. 8.
Taylor, et al., “Optimization Methods for Ranking Functions with Multiple Parameters”, ACM, 2006, pp. 9.
Taylor, et al., “Soft Rank; Optimising Non-Smooth Rank Metrics”, ACM,2000, pp. 10.
Zhai, et al., “A Study of Smoothing Methods for Language Models Applied to Ad Hoc Information Retrieval”, ACM, 2001, pp. 9.

Affiliated with

Also associated with

Rating

Optimization of discontinuous rank metrics does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimization of discontinuous rank metrics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimization of discontinuous rank metrics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2641358