TOPSIS Sorting with Optimized Cutoff Values

淡江大學機構典藏 > 商管學院 > 資訊管理學系暨研究所 > 期刊論文 > Item 987654321/126858

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/126858

题名:	TOPSIS Sorting with Optimized Cutoff Values
作者:	Jou, Chi-chang
关键词:	Multiple criteria decision making;TOPSIS;Ordered sorting;Cutoff value.
日期:	2024-06
上传时间:	2025-03-20 09:27:37 (UTC+8)
摘要:	Many real-world decision problems require sorting alternatives into ordered classes, and often they involve multiple measures, making them multi-criteria sorting problems. Previous research on applying TOPSIS (The Technique for Order of Preference by Similarity to Ideal Solution) to these practical problems has focused on proposing criteria weights and computing relative closeness, obtained by comparing distances of alternatives to the positive and negative ideal solutions. However, the issue of how to determine the cutoff values has not been attacked before. We propose a general approach to determine optimized cutoff values, with objective weights for the TOPSIS sorting process. These cutoff values are obtained by minimizing the sum of deviations for randomly selected representative alternatives of neighboring classes. The procedure is demonstrated using two public datasets. It is then analyzed and compared with previous research and traditional data mining techniques, and the results demonstrate that TOPSIS is an effective tool for ordered sorting.
關聯:	International Journal of Information and Management Sciences (IJIMS) 35(2),　p.175-190
DOI:	10.6186/IJIMS.202406_35(2).0005
显示于类别:	[資訊管理學系暨研究所] 期刊論文

文件中的档案:

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

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章