An approach to group ranking decisions in a dynamic environment

NCU Institutional Repository > 管理學院 > 資訊管理學系 > 期刊論文 > Item 987654321/51797

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

题名:	An approach to group ranking decisions in a dynamic environment
作者:	Chen,YL;Cheng,LC
贡献者:	資訊管理學系
日期:	2010
上传时间:	2012-03-27 19:06:24 (UTC+8)
出版者:	國立中央大學
摘要:	The group ranking problem is used to construct coherent aggregate results from preference data provided by decision makers. Although there have been different input formats used to represent user preferences, they share a common weakness, that the input mode is static. In other words, users must provide all the preference data at one time. To overcome this weakness, we propose a framework which allows users to provide partial and/or incomplete preference data at multiple times. Since this is a complicated issue, we specifically focus on a particular aspect as a first attempt at this framework. Accordingly, we reexamine a variant of the group ranking problem, the maximum consensus mining problem, which will give the longest ranking lists of alternatives that agree with the majority and disagree only with the minority, under the dynamic input mode assumption. An algorithm is developed to determine the maximum consensus sequences from the users' partial ranking data. Finally, extensive experiments are carried out using synthetic data sets. The results indicate that the proposed method is computationally efficient, and can effectively identify consensus among all users. (C) 2009 Elsevier B.V. All rights reserved.
關聯:	DECISION SUPPORT SYSTEMS
显示于类别:	[資訊管理學系] 期刊論文

文件中的档案:

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

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

社群 sharing

数据加载中.....