A New Approach to the Group Ranking Problem: Finding Consensus Ordered Segments from Users' Preference Data1. Issue 6 (December 2013)

• Record Type: Journal Article
• Authors: Chen, Yen‐Liang; Cheng, Li‐Chen; Hsu, Weu‐Yu
• Is Part Of: Decision sciences. Volume 44:Issue 6(2013)
• Page Start: 1091
• Page End: 1119
• Publication Date: 2013-12
• Subjects: Decision making -- Periodicals; Policy sciences -- Periodicals; 658.40305
• DOI: 10.1111/deci.12048
• Languages: English
• ISSNs: 0011-7315

Abstract

<abstract abstract-type="main"> <title>ABSTRACT</title> <p>The group ranking problem involves constructing coherent aggregated results from users' preference data. The goal of most group ranking problems is to generate an ordered list of all items that represents the user consensus. There are, however, two weaknesses to this approach. First, a complete list of ranked items is always output even when there is no consensus or only a slight consensus. Second, due to similarity of performance, in many practical situations, it is very difficult to differentiate whether one item is really better than another within a set. These weaknesses have motivated us to apply the clustering concept to the group ranking problem, to output an ordered list of segments containing a set of similarly preferred items, called consensus ordered segments. The advantages of our approach are that (i) the list of segments is based on the users' consensuses, (ii) the items with similar preferences are grouped together in the same segment, and (iii) the relationships between items can be easily seen. An algorithm is developed to construct the consensus of the ordered segments from the users' total ranking data. Finally, the experimental results indicate that the proposed method is computationally efficient, and can effectively identify consensus ordered segments.</p> </abstract>