Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Mining decision-rule preference model from rough approximation of preference relation

Authors

[ 1 ] Instytut Informatyki (II), Wydział Informatyki i Zarządzania, Politechnika Poznańska | [ P ] employee

Year of publication

2002

Chapter type

paper

Publication language

english

Abstract

EN Given a ranking of actions evaluated by a set of evaluation criteria, we construct a rough approximation of the preference relation known from this ranking. The rough approximation of the preference relation is a starting point for mining " if... then" decision rules constituting a symbolic preference model. The set of rules is induced such as to be compatible with a concordance-discordance preference model used in well-known multicriteria decision aiding methods. An application of the set of decision rules to a new set of actions gives a fuzzy outranking graph. Positive and negative flows are calculated for each action in the graph, giving arguments about its strength and weakness. Aggregation of both arguments leads to a final ranking, either partial or complete. The approach can be applied to support a multicriteria choice and ranking of actions when the input information is a ranking of some reference actions.

Pages (from - to)

1129 - 1134

DOI

10.1109/CMPSAC.2002.1045163

URL

https://ieeexplore.ieee.org/document/1045163

Book

26th Annual International Computer Software and Applications Conference. Proceedings

Presented on

26th IEEE Annual International Conference on Computer Software and Applications, COMPSAC 2002, 26-29.08.2002, Oxford, United Kingdom

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.