Learning intransitive reciprocal relations with kernel methods
From MaRDI portal
Publication:976508
DOI10.1016/j.ejor.2010.03.018zbMath1188.68234OpenAlexW2014306710WikidataQ60257452 ScholiaQ60257452MaRDI QIDQ976508
Tapio Salakoski, Bernard De Baets, Evgeni Tsivtsivadze, Tapio Pahikkala, Willem Waegeman
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.018
game theorydecision theorytransitivitykernel methodsutility functionsreciprocal relationspreference learning
Related Items (10)
Generalized vec trick for fast learning of pairwise kernel models ⋮ Do transitive preferences always result in indifferent divisions? ⋮ Enhancing data consistency in decision matrix: adapting Hadamard model to mitigate judgment contradiction ⋮ Multicriteria decision systems for financial problems ⋮ Multi-target prediction: a unifying view on problems and methods ⋮ Modelling Human Decision Behaviour with Preference Learning ⋮ Robust low-rank multiple kernel learning with compound regularization ⋮ A Comparative Study of Pairwise Learning Methods Based on Kernel Ridge Regression ⋮ Efficient regularized least-squares algorithms for conditional ranking on relational data ⋮ When \textit{I cut, you choose} method implies intransitivity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Support Vector Ordinal Regression
- On the cycle-transitivity of the mutual rank probability relation of a poset
- On the ERA ranking representability of pairwise bipartite ranking functions
- Rock-scissors-paper game in a chaotic flow: the effect of dispersion on the cyclic competition of microorganisms
- Optimal strategies for equal-sum dice games
- Consistent models of transitivity for reciprocal preferences on a finite ordinal scale
- Counting linear extension majority cycles in partially ordered sets on up to 13 elements
- Matrix representations, linear transformations, and kernels for disambiguation in natural language
- Optimal strategies for symmetric matrix games with partitions
- Kernel-based learning methods for preference aggregation
- Biorder families, valued relations, and preference modelling
- Thurstonian-type representations for ``same-different discriminations: deterministic decisions and independent images.
- General transitivity conditions for fuzzy reciprocal preference matrices.
- On the cycle-transitivity of the dice model
- Individual-valued preferences and their aggregation: consistency analysis in a real case
- A multicriteria classification approach based on pairwise comparisons
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
- Transitivity and fuzzy preferences.
- An existence theorem for fuzzy utility functions: A new elementary proof
- An efficient algorithm for learning to rank from preference graphs
- Nontransitive preferences in decision theory
- Label ranking by learning pairwise preferences
- Cyclic evaluation of transitivity of reciprocal relations
- Transitivity frameworks for reciprocal relations: cycle-transitivity versus \(FG\)-transitivity
- Modelling intransitive preferences: a random-effects approach
- Inferring Electre's veto-related parameters from outranking examples
- Utility function of fuzzy preferences on a countable set under max-\(*\)-transitivity
- 10.1162/1532443041827916
- Machine Learning: ECML 2003
- Using assignment examples to infer weights for ELECTRE TRI method: some experimental results.
This page was built for publication: Learning intransitive reciprocal relations with kernel methods
