Efficient Probabilistic Inference with Partial Ranking Queries

Details Efficient Probabilistic Inference with Partial Ranking Queries Efficient Probabilistic Inference with Partial Ranking Queries

2012-02-14

arxiv.org/abs/1202.3734v1

Computer Science

Learning

Scientific paper

Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distributions. We approach the modeling problem from the computational principle that one should make structural assumptions which allow for efficient calculation of typical probabilistic queries. For ranking models, "typical" queries predominantly take the form of partial ranking queries (e.g., given a user's top-k favorite movies, what are his preferences over remaining movies?). In this paper, we argue that riffled independence factorizations proposed in recent literature [7, 8] are a natural structural assumption for ranking distributions, allowing for particularly efficient processing of partial ranking queries.

Affiliated with

Also associated with

No associations

Rating

Efficient Probabilistic Inference with Partial Ranking Queries 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 Efficient Probabilistic Inference with Partial Ranking Queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Probabilistic Inference with Partial Ranking Queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90508