4.7 Article

Ordinal consensus measure with objective threshold for heterogeneous large-scale group decision making

Journal

KNOWLEDGE-BASED SYSTEMS
Volume 180, Issue -, Pages 62-74

Publisher

ELSEVIER
DOI: 10.1016/j.knosys.2019.05.019

Keywords

Large-scale group decision making; Heterogeneous; Ordinal consensus; k-means clustering; Preference relation

Funding

  1. National Natural Science Foundation of China [71771156]
  2. 2019 Soft Science Project of Sichuan Science and Technology Department [2019JDR0141]
  3. 2019 Sichuan Planning Project of Social Science [SC18A007]
  4. Graduate Student's Research and Innovation Fund of Sichuan University, China [2018YJSY038]

Ask authors/readers for more resources

Because of the increasing complexity of real-world decision-making environment, there is a trend that a large number of decision-makers are becoming involved in group decision making problems. In large-scale group decision making problems, owing to various backgrounds and psychological cognition, it is natural to use heterogeneous representation forms (quantitative or qualitative) to express distinct preference information for different decision-makers. In this paper, we investigate the consensus reaching process in the environment of heterogeneous large-scale group decision making. A novel ordinal consensus measure with an objective threshold based on preference orderings is proposed. This process contains five parts: (1) obtaining ordinal preferences; (2) classifying all decision-makers into several subgroups using the ordinal k-means clustering algorithm; (3) measuring consensus levels of subgroups and the global group using novel ordinal consensus indexes; (4) providing suggestions for decision-makers to revise preferences using feedback strategies; (5) obtaining final decision result. An illustrative example is provided to verify the implementation of the proposed consensus model. Lastly, we discuss the approaches to determine the appropriate number of clusters and the initialization center points for the proposed ordinal k-means clustering algorithm. (C) 2019 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available