Please use this identifier to cite or link to this item:
|Title:||Learning and Ensembling Lexicographic Preference Trees with Multiple Kernels|
|Authors:||Kelwin Alexander Correia|
|Abstract:||We study the problem of learning lexicographic preferences on multiattribute domains, and propose Rankdom Forests as a compact way to express preferences in learning to rank scenarios. We start generalizing Conditional Lexicographic Preference Trees by introducing multiple kernels in order to handle non-categorical attributes. Then, we define a learning strategy for inferring lexicographic rankers from partial pairwise comparisons between options. Finally, a Lexicographic Ensemble is introduced to handle multiple weak partial rankers, being Rankdom Forests one of these ensembles. We tested the performance of the proposed method using several datasets and obtained competitive results when compared with other lexicographic rankers.|
|Appears in Collections:||CTM - Articles in International Conferences|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.