DeepAI AI Chat
Log In Sign Up

Learning MR-Sort Models from Non-Monotone Data

by   Pegdwende Minoungou, et al.

The Majority Rule Sorting (MR-Sort) method assigns alternatives evaluated on multiple criteria to one of the predefined ordered categories. The Inverse MR-Sort problem (Inv-MR-Sort) computes MR-Sort parameters that match a dataset. Existing learning algorithms for Inv-MR-Sort consider monotone preferences on criteria. We extend this problem to the case where the preferences on criteria are not necessarily monotone, but possibly single-peaked (or single-valley). We propose a mixed-integer programming based algorithm that learns the preferences on criteria together with the other MR-Sort parameters from the training data. We investigate the performance of the algorithm using numerical experiments and we illustrate its use on a real-world case study.


page 1

page 2

page 3

page 4


An efficient SAT formulation for learning multiple criteria non-compensatory sorting rules from examples

The literature on Multiple Criteria Decision Analysis (MCDA) proposes se...

Qualitative Decision Methods for Multi-Attribute Decision Making

The fundamental problem underlying all multi-criteria decision analysis ...

DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization

The development of parallelizable algorithms for monotone, submodular ma...

Making Learners (More) Monotone

Learning performance can show non-monotonic behavior. That is, more data...

E2E Refined Dataset

Although the well-known MR-to-text E2E dataset has been used by many res...

Contextual Reasoning for Scene Generation (Technical Report)

We present a continuation to our previous work, in which we developed th...