Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
This model assigns a permutation π over n items a probability that decays exponentially with its distance to a central permutation σ. Here we study this class of models in the limit n → ∞, with the assumption that out of the infinitely many items ordered, one only observes those occupying the first t ranks.
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker ...
People also ask
This paper introduces a stagewise ranking model that operates with finite ordered lists called top-t orderings over an infinite space of items, ...
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large.
Oct 20, 2015 · This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is ...
An Exponential Model for Infinite Rankings Marina Meil and Le Bao ; Journal: Journal of Machine Learning Research, ; Volume: 11 ; URL: http://www.jmlr.org/papers/ ...
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large.
Nov 30, 2010 · From a statistical point of view, we show that the GM model is an exponential family, and introduce the conjugate prior for this model class.
An Exponential Model for Infinite Rankings · M. MeilăLe Bao · Journal of machine learning research ; Tractable Search for Learning Exponential Models of Rankings.
We analyze the generalized Mallows model, a popular exponential model over rankings. Estimating the central (or consensus) rank- ing from data is NP-hard.