Logo image
Back
Workload-driven learning of mallows mixtures with pairwise preference data
Conference proceeding   Open access

Workload-driven learning of mallows mixtures with pairwise preference data

Julia Stoyanovich, Lovro Ilijasic, Haoyue Ping and Hechun Ping
Proceedings of the 19th International Workshop on web and databases, pp 1-6
26 Jun 2016
DOI: https://doi.org/10.1145/2932194.2932202
url
https://doi.org/10.1145/2932194.2932202View
Published, Version of Record (VoR)Maybe Open Access (Publisher Bronze),  Open

Abstract

In this paper we present a framework for learning mixtures of Mallows models from large samples of incomplete preferences. The problem we address is of significant practical importance in social choice, recommender systems, and other domains where it is required to aggregate, or otherwise analyze, preferences of a heterogeneous user base. We improve on state-of-the-art methods for learning mixtures of Mallows models with pairwise preference data. Exact sampling from the Mallows posterior in presence of arbitrary pairwise evidence is known to be intractable even for a single Mallows. This motivated to the development of an approximate sampler called AMP. In this paper we propose AMPx, an ensemble method for approximate sampling from the Mallows posterior that combines AMP with frequency-based estimation of posterior probabilities. We experimentally demonstrate that AMPx achieves faster convergence and higher accuracy than AMP alone. We also adapt state-of-the-art clustering techniques that have not been used in this setting, for learning parameters of the Mallows mixture, and show experimentally that mixture parameters can be learned accurately and efficiently.

Metrics

9 Record Views
4 citations in Scopus

Details

Logo image