Listwise ranking

Details Listwise ranking Listwise ranking

2007-10-18

2010-06-08

Le, Debbie (Department: 2168)

Data processing: database and file management or data structures

Database and file access

Preparing data for information retrieval

C707S752000

Reexamination Certificate

active

07734633

ABSTRACT:
Procedures for learning and ranking items in a listwise manner are discussed. A listwise methodology may consider a ranked list, of individual items, as a specific permutation of the items being ranked. In implementations, a listwise loss function may be used in ranking items. A listwise loss function may be a metric which reflects the departure or disorder from an exemplary ranking for one or more sample listwise rankings used in learning. In this manner, the loss function may approximate the exemplary ranking for the plurality of items being ranked.

REFERENCES:
patent: 5752241 (1998-05-01), Cohen
patent: 6775664 (2004-08-01), Lang et al.
patent: 7424469 (2008-09-01), Ratnaparkhi
patent: 7472096 (2008-12-01), Burges et al.
patent: 7593934 (2009-09-01), Li et al.
patent: 2005/0149504 (2005-07-01), Ratnaparkhi
patent: 2005/0210025 (2005-09-01), Dalton et al.
patent: 2006/0026152 (2006-02-01), Zeng et al.
patent: 2006/0074910 (2006-04-01), Yun et al.
patent: 2006/0195406 (2006-08-01), Burges et al.
patent: 2006/0248031 (2006-11-01), Kates et al.
patent: 2007/0078849 (2007-04-01), Slothouber
patent: 2007/0094171 (2007-04-01), Burges et al.
patent: 2007/0094285 (2007-04-01), Agichtein et al.
patent: 2007/0106659 (2007-05-01), Lu et al.
patent: 2008/0208836 (2008-08-01), Zheng et al.
patent: EP1006458 (2000-06-01), None
Seinjuti Chakraborty, Learning to Rank Using Mixture of Experts and Matching Loss Functions, Department of Computer Science University of California, Sandta Cruz, Jun. 2009, p. 1-15.
Agichtein, et al., “Improving Web Search Ranking by Incorporating User Behavior Information”, available at least as early as Jun. 13, 2007, at <<http://www.mathcs.emory.edu/˜eugene/papers/sigir2006ranking.pdf>>, ACM, 2006, 8 page.
Cao, et al., “Learning to Rank: From Pairwise Approach to Listwise Approach”, retrieved on Jun. 14, 2007, at <<http://research.microsoft.com/research/pubs/view.aspx?0rc=p&type=technical+report&id=1282>>, Microsoft Corporation, 2007, 1 page.
Carterette, et al., “Learning a Ranking from Pairwise Preferences”, available at least as early as Jun. 13, 2007, at <<http://ciir.cs.umass.edu/˜carteret/sigir06-poster.pdf>>, ACM, 2006, 2 page.
Fagin, et al., Comparing Top k Lists: Siam J. Discrete Math, vol. 17, No. 1, 2003, pp. 134-160.
Mashiach, “Learning to Rank: A Machine Learning Approach to Static Ranking”, available at least as early as Jun. 13, 2007, at <<http://www.cs.technion.ac.il/˜litalma
otes—lectures/LearningtoRank.pdf>>, 2006, 5 pages.
Pessiot, et al., “Learning to rank for collaborative filtering”, available at least as early as Jun. 13, 2007, at <<http://connex.lip6.fr/˜pessiot/papiers/iceis—2007.pdf>>, 7 pages.

Affiliated with

Also associated with

Rating

Listwise ranking does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4194520