Mining maximum consensus sequences from group ranking data

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29666

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29666

题名:	Mining maximum consensus sequences from group ranking data
作者:	Chen,YL;Cheng,LC
贡献者:	資訊管理研究所
关键词:	PARTIAL ORDINAL RANKINGS;PREFERENCE STRUCTURES;DECISION;AGGREGATION;PROPOSALS;DISTANCES;REVIEWERS;SET
日期:	2009
上传时间:	2010-06-29 20:37:44 (UTC+8)
出版者:	中央大學
摘要:	In the last decade, the problem of getting a consensus group ranking from all users' ranking data has received increased attention due to its widespread applications. Previous research solved this problem by consolidating the opinions of all users, thereby obtaining an ordering list of all items that represent the achieved consensus. The weakness of this approach, however, is that it always produces a ranking list of all items, regardless of how many conflicts exist among users. This work rejects the forced agreement of all items. Instead, we define a new concept, maximum consensus sequences, which are the longest ranking lists of items that agree with the majority and disagree only with the minority. Based on this concept, algorithm MCS is developed to determine the maximum consensus sequences from users' ranking data, and also to identify conflict items that need further negotiation. Extensive experiments are carried out using synthetic data sets, and the results indicate that the proposed method is computationally efficient. Finally, we discuss how the identified consensus sequences and conflict items information can be used in practice. (C) 2008 Elsevier B.V. All rights reserved.
關聯:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	435	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....