Preference Learning from Interval Pairwise Data. A Distance-Based Approach
Preference learning has recently received a lot of attention within the machine learning field, concretely learning by pairwise comparisons is a well-established technique in this field. We focus on the problem of learning the overall preference weights of a set of alternatives from the (possibly conflicting) uncertain and imprecise information given by a group of experts into the form of interval pairwise comparison matrices. Because of the complexity of real world problems, incomplete information or knowledge and different patterns of the experts, interval data provide a flexible framework to account uncertainty and imprecision. In this context, we propose a two-stage method in a distance-based framework, where the impact of the data certainty degree is captured. First, it is obtained the group preference matrix that best reflects imprecise information given by the experts. Then, the crisp preference weights and the associated ranking of the alternatives are derived from the obtained group matrix. The proposed methodology is made operational by using an Interval Goal Programming formulation.
KeywordsPreference learning pairwise comparison matrices interval data distance methods interval goal programming
Unable to display preview. Download preview PDF.
- 2.Fürnkranz, J., Hüllermeier, E.: Pairwise preference learning and ranking. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) ECML 2003. LNCS (LNAI), vol. 2837, pp. 145–156. Springer, Heidelberg (2003)Google Scholar
- 16.Dopazo, E., González-Pachón, J.: Consistency-driven approximation of a pairwise comparison matrix. Kybernetyca 39(5), 561–568 (2003)Google Scholar
- 17.Dopazo, E., Ruiz-Tagle, M.: A GP formulation for aggregating preferences with interval assessments. In: 7th International Conference on Multiobjective Programming and Goal Programming (submitted, 2006)Google Scholar