Learning Lexicographic Preference Trees from Positive Examples
Abstract
This paper considers the task of learning the preferences of users on a combinatorial set of alternatives, as it can be the case for example with online configurators. In many settings, what is available to the learner is a set of positive examples of alternatives that have been selected during past interactions. We propose to learn a model of the users' preferences that ranks previously chosen alternatives as high as possible. In this paper, we study the particular task of learning conditional lexicographic preferences. We present an algorithm to learn several classes of lexicographic preference trees, prove convergence properties of the algorithm, and experiment on both synthetic data and on a real-world bench in the domain of recommendation in interactive configuration.
Cite
Text
Fargier et al. "Learning Lexicographic Preference Trees from Positive Examples." AAAI Conference on Artificial Intelligence, 2018. doi:10.1609/AAAI.V32I1.11808Markdown
[Fargier et al. "Learning Lexicographic Preference Trees from Positive Examples." AAAI Conference on Artificial Intelligence, 2018.](https://mlanthology.org/aaai/2018/fargier2018aaai-learning/) doi:10.1609/AAAI.V32I1.11808BibTeX
@inproceedings{fargier2018aaai-learning,
title = {{Learning Lexicographic Preference Trees from Positive Examples}},
author = {Fargier, Hélène and Gimenez, Pierre-François and Mengin, Jérôme},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2018},
pages = {2959-2966},
doi = {10.1609/AAAI.V32I1.11808},
url = {https://mlanthology.org/aaai/2018/fargier2018aaai-learning/}
}