Pages that link to "Item:Q3061113"
From MaRDI portal
The following pages link to Preference Learning and Ranking by Pairwise Comparison (Q3061113):
Displaying 23 items.
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances (Q316726) (← links)
- Scalable Bayesian preference learning for crowds (Q782436) (← links)
- Learning valued preference structures for solving classification problems (Q835222) (← links)
- Ranking procedures by pairwise comparison using random sets and the imprecise Dirichlet model (Q864784) (← links)
- Learning intransitive reciprocal relations with kernel methods (Q976508) (← links)
- Kernel-based learning methods for preference aggregation (Q1040731) (← links)
- On predictive accuracy and risk minimization in pairwise label ranking (Q1049275) (← links)
- Dyad ranking using Plackett-Luce models based on joint feature representations (Q1640577) (← links)
- On learning of weights through preferences (Q1750016) (← links)
- Cautious classification based on belief functions theory and imprecise relabelling (Q2076976) (← links)
- A review on instance ranking problems in statistical learning (Q2127240) (← links)
- Information efficient learning of complexly structured preferences: elicitation procedures and their application to decision making under uncertainty (Q2128891) (← links)
- Simple ranking method using reference profiles: incremental elicitation of the preference parameters (Q2168782) (← links)
- Editorial: Preference learning and ranking (Q2251428) (← links)
- Robust ordinal regression in preference learning and ranking (Q2251445) (← links)
- Label ranking by learning pairwise preferences (Q2389690) (← links)
- Learning preferences from paired opposite-based semantics (Q2407945) (← links)
- Scaling-invariant maximum margin preference learning (Q2658026) (← links)
- Collaborative Preference Learning (Q3061136) (← links)
- Inferring Sparse Preference Lists from Partial Information (Q5141707) (← links)
- Machine Learning: ECML 2003 (Q5897342) (← links)
- \texttt{GLISp-r}: a preference-based optimization algorithm with convergence guarantees (Q6166660) (← links)
- Unequal Singleton Pair Distance for Evidential Preference Clustering (Q6488062) (← links)
