Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains
We study preference representation models based on partial lexicographic preference trees (PLP-trees). We propose to represent preference relations as forests of small PLP-trees (PLP-forests), and to use voting rules to aggregate orders represented by the individual trees into a single order to be t...
Saved in:
Published in | Annals of mathematics and artificial intelligence Vol. 87; no. 1-2; pp. 137 - 155 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Cham
Springer International Publishing
01.10.2019
Springer Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!