Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains
DOI10.1007/s10472-019-09645-7zbMath1452.68191OpenAlexW2953712163MaRDI QIDQ2278102
Xu-Dong Liu, Miroslaw Truszczynski
Publication date: 9 December 2019
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-019-09645-7
voting theorysocial choice theorymaximum satisfiabilitypreference learningcomputational complexity theorylexicographic preference modelspreference modeling and reasoning
Learning and adaptive systems in artificial intelligence (68T05) Voting theory (91B12) Knowledge representation (68T30) Social choice (91B14)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Sequential composition of voting rules in multi-issue domains
- Ordinal preference representations
- Preference learning and optimization for partial lexicographic preference forests over combinatorial domains
- Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting
- Condorcet's paradox and the likelihood of its occurrence: Different perspectives on balanced preferences
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers
- Learning conditionally lexicographic preference relations
- Reasoning with Preference Trees over Combinatorial Domains
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Random forests
This page was built for publication: Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains
