We consider sorting problems where information about categories is represented by a Learning Set (LS), i.e. a set of alternatives and their related labels. The distinctive feature of our approach relies on the fact that both precise and imprecise information about the LS can be handled. More precisely, we assume that each alternative of the LS may belong to a unique category or a disjunction of successive categories. Our method proceeds in four stages: the comparison, the definition of Basic Belief Assignments (BBA's), the combination and the assignment. Artificial data sets are used to test the method and to compare its results with those provided by an ELECTRE TRI like procedure.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.