Learning context-dependent choice functions
From MaRDI portal
Publication:2069057
DOI10.1016/j.ijar.2021.10.002OpenAlexW3205259120MaRDI QIDQ2069057
Eyke Hüllermeier, Karlson Pfannschmidt, Pritha Gupta, Björn Haddenhorst
Publication date: 20 January 2022
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.10860
Related Items (1)
Uses Software
Cites Work
- ASlib: a benchmark library for algorithm selection
- On label dependence and loss minimization in multi-label classification
- Impossibility results with resoluteness
- Approximating the volume of unions and intersections of high-dimensional geometric objects
- Measuring constructed preferences: Towards a building code. (With commentaries)
- Anonymous, neutral, and resolute social choice revisited
- Advanced conjoint analysis using feature selection via support vector machines
- A Survey and Empirical Comparison of Object Ranking Methods
- Discrete Choice Methods with Simulation
- NON-NULL RANKING MODELS. I
- Preference Learning
- Context-Dependent Preferences
- A new partitioning around medoids algorithm
- Rationalizing Choice Functions By Multiple Rationales
- Choice Functions and Revealed Preference
- Polychotomous Quantal Response in Biological Assay
- Multistage Ranking Models
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Learning context-dependent choice functions