Journal
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS
Volume 6, Issue 3, Pages 511-521Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s13042-014-0278-5
Keywords
Total ranking; Partial ranking; Similarity degree; Support degree; Granular computing
Categories
Funding
- National Natural Science Foundation of China [71031006]
- Shanxi Provincial Foundation for Returned Scholars [2013-101]
- Construction Project of the Science and Technology Basic Condition Platform of Shanxi Province [2012091002-0101]
- Research Projects in Education Teaching of Yuncheng University [JY2011025]
Ask authors/readers for more resources
Deriving the consensus ranking(s) from a set of rankings plays an important role in group decision making. However, the relative importance, i.e. weight of a decision maker, is ignored in most of the ordinal ranking methods. This paper aims to determine the weights of decision makers by measuring the support degree of each pair of ordinal rankings. We first define the similarity degree of dominance granular structures to depict the mutual relations of the ordinal rankings. Then, the support degree, which is obtained from similarity degree, is presented to determine weights of decision makers. Finally, an improved programming model is proposed to compute the consensus rankings by minimizing the violation with the weighted ranking(s). Two examples are given to illustrate the rationality of the proposed model.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available