New learning methods for supervised and unsupervised preference aggregation

MaRDI QIDQ2934027zbMATH OpenFDO

Authors Maksims N. Volkovs, Richard Zemel

Publication date 8 December 2014

Full work available at URL http://jmlr.csail.mit.edu/papers/v15/volkovs14a.html

zbMATH Keywords

collaborative filteringpreference aggregationlearning-to-rankmeta-search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Statistical ranking and selection procedures (62F07)

Recommendations

• Pairwise preference learning and ranking.
• Effective sampling and learning for Mallows models with pairwise-preference data
• 10.1162/1532443041827916
• The asymptotics of ranking algorithms
• Probabilistic preference learning with the Mallows rank model

Cited in

(14)

• scientific article; zbMATH DE number 7370536 (Why is no real title available?)
• Collaborative Ranking: An Aggregation Algorithm for Individuals’ Preference Estimation
• Learning Aggregation Operators for Preference Modeling
• An indifference result for social choice rules in large societies
• Probabilistic preference learning with the Mallows rank model
• Analysis of ranking data
• A preference optimization based unifying framework for supervised learning problems
• Do performances of violin virtuosi fade over time? A response using the Nash collective utility function
• Kernel-based learning methods for preference aggregation
• A universal voting system based on the potential method
• Scalable Bayesian preference learning for crowds
• Does cross-validation work in telling rankings apart?
• Stagewise learning for noisy \(k\)-ary preferences
• Robust Plackett-Luce model for k-ary crowdsourced preferences

This page was built for publication: New learning methods for supervised and unsupervised preference aggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934027)