以新奇的方法有序共識群應用於群體決策問題; A Novel Approach To Group Ranking Decision Problem By Consensus Ordered Segments

NCUIR > School of Management at National Central University > Graduate Institute of Information Management > Electronic Thesis & Dissertation > Item 987654321/48965

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/48965

Title:	以新奇的方法有序共識群應用於群體決策問題;A Novel Approach To Group Ranking Decision Problem By Consensus Ordered Segments
Authors:	許瑋淯;Wei-yu Hsu
Contributors:	資訊管理研究所
Keywords:	群體決策;有序共識群;資料挖掘;Consensus ordered segments;Data mining;Group decision making
Date:	2011-07-11
Issue Date:	2012-01-05 15:11:37 (UTC+8)
Abstract:	群體決策問題已經越來越被關注且被認為是一個重要的研究領域，由於此研究領域已經被廣泛的應用。為了解決群體決策問題，傳統的解決方法分別提出兩種輸出格式：產生一個完整且有序的序列和許多的共識序列。但是，不管哪一種輸出格式，針對群體決策問題仍然存在一些缺點。因此，我們定義了有序共識群來當作一種新的輸出格式。此研究主要結合分群的方法且採用有序的概念來說服先前研究的缺點。之後我們提出一個演算法，從使用者的序列資列中來發掘有序共識群。最後，關於實驗的部份，我們使用真實與合成資料集來表示有序共識群的可用性。 The group ranking problem has received more and more attention due to its widespread applications. Traditional solution either produces an ordering list of all items or many consensus sequences as output. Unfortunately, no matter which output is generated, some weaknesses exist in the group ranking problem. Accordingly, this research combines the clustering methods with the ordering concepts to address the weaknesses of previous research, and define the consensus ordered segments as a new type of output of the group ranking problem. We also proposed an algorithm to mine consensus ordered segments from users’ ranking data. Finally, extensive experiments have been carried out using the real and synthetic dataset to demonstrate the usefulness of consensus ordered segments.
Appears in Collections:	[Graduate Institute of Information Management] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	532	View/Open

社群 sharing

Loading...