View in EDS

A new consensus mining approach to group ranking problems involving different intensities of preferences.

Saved in:
Bibliographic Details
Title: A new consensus mining approach to group ranking problems involving different intensities of preferences.
Authors: Ma, Li-Ching1 lcma@nuu.edu.tw
Source: Computers & Industrial Engineering. May2019, Vol. 131, p320-326. 7p.
Subjects: Data mining, Problem solving, Group decision making, Mathematical optimization, Computer users
Abstract: • A total ranking list involving group consensus preferences is achieved. • A group consensus mining approach is proposed without candidate generation. • An optimization model involving maximum consensus sequences is developed. • Flexibility is provided in solving ranking problems using different input formats. • Minimum consensus levels and maximum disagreement levels are adjustable. Discovering the group priority from a set of user preferences plays an important role in group decision making because of its extensive applications in practice. In most group ranking problems, users are supposed to input a ranking of alternatives regardless of the intensities of preference. However, if two users specify that they prefer A to B, the intensities of preference may be quite different. In addition, most researchers have tried to determine a total ranking list by minimizing total differences among user preferences, but users might have little consensus on the final results. This study aims to propose a new consensus-based approach for group ranking problems involving different intensities of preference. Stemming from the concept of consensus mining, consensus relationships are discovered by three accumulation matrices and consensus thresholds. An optimization model incorporating the consensus relationships and the concept of Borda majority count is then developed to derive a total ranking list. Compared to previous studies, the proposed approach can treat group ranking problems involving different intensities of preference, reduce the occurrence of ties, and achieve a total ranking list reflecting the consensus preference of the majority of users. [ABSTRACT FROM AUTHOR]
Copyright of Computers & Industrial Engineering is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:• A total ranking list involving group consensus preferences is achieved. • A group consensus mining approach is proposed without candidate generation. • An optimization model involving maximum consensus sequences is developed. • Flexibility is provided in solving ranking problems using different input formats. • Minimum consensus levels and maximum disagreement levels are adjustable. Discovering the group priority from a set of user preferences plays an important role in group decision making because of its extensive applications in practice. In most group ranking problems, users are supposed to input a ranking of alternatives regardless of the intensities of preference. However, if two users specify that they prefer A to B, the intensities of preference may be quite different. In addition, most researchers have tried to determine a total ranking list by minimizing total differences among user preferences, but users might have little consensus on the final results. This study aims to propose a new consensus-based approach for group ranking problems involving different intensities of preference. Stemming from the concept of consensus mining, consensus relationships are discovered by three accumulation matrices and consensus thresholds. An optimization model incorporating the consensus relationships and the concept of Borda majority count is then developed to derive a total ranking list. Compared to previous studies, the proposed approach can treat group ranking problems involving different intensities of preference, reduce the occurrence of ties, and achieve a total ranking list reflecting the consensus preference of the majority of users. [ABSTRACT FROM AUTHOR]
ISSN:03608352
DOI:10.1016/j.cie.2019.04.001