Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Consensus ranking under the exponential model
Marina Meila, Kapil Phadnis, Arthur Patterson, Jeff Bilmes
Abstract:
We analyze the generalized Mallows model, a popular exponential model over rankings. Estimating the central (or consensus) ranking from data is NP-hard. We obtain the following new results: (1) We show that search methods can estimate both the central ranking pi0 and the model parameters theta exactly. The search is n! in the worst case, but is tractable when the true distribution is concentrated around its mode; (2) We show that the generalized Mallows model is jointly exponential in (pi0; theta), and introduce the conjugate prior for this model class; (3) The sufficient statistics are the pairwise marginal probabilities that item i is preferred to item j. Preliminary experiments confirm the theoretical predictions and compare the new algorithm and existing heuristics.
Keywords:
Pages: 285-294
PS Link:
PDF Link: /papers/07/p285-meila.pdf
BibTex:
@INPROCEEDINGS{Meila07,
AUTHOR = "Marina Meila and Kapil Phadnis and Arthur Patterson and Jeff Bilmes",
TITLE = "Consensus ranking under the exponential model",
BOOKTITLE = "Proceedings of the Twenty-Third Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-07)",
PUBLISHER = "AUAI Press",
ADDRESS = "Corvallis, Oregon",
YEAR = "2007",
PAGES = "285--294"
}


hosted by DSL   •   site info   •   help