Probabilistic Models over Ordered Partitions with Application in Learning to Rank

Details Probabilistic Models over Ordered Partitions with Application in Learning to Rank Probabilistic Models over Ordered Partitions with Application in Learning to Rank

2010-09-09

arxiv.org/abs/1009.1690v2

Computer Science

Information Retrieval

19 pages, 2 figures

Scientific paper

This paper addresses the general problem of modelling and learning rank data with ties. We propose a probabilistic generative model, that models the process as permutations over partitions. This results in super-exponential combinatorial state space with unknown numbers of partitions and unknown ordering among them. We approach the problem from the discrete choice theory, where subsets are chosen in a stagewise manner, reducing the state space per each stage significantly. Further, we show that with suitable parameterisation, we can still learn the models in linear time. We evaluate the proposed models on the problem of learning to rank with the data from the recently held Yahoo! challenge, and demonstrate that the models are competitive against well-known rivals.

Affiliated with

Also associated with

No associations

Rating

Probabilistic Models over Ordered Partitions with Application in Learning to Rank does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Probabilistic Models over Ordered Partitions with Application in Learning to Rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Models over Ordered Partitions with Application in Learning to Rank will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558581