TOPSIS Sorting with Optimized Cutoff Values

doi:10.6186/IJIMS.202406_35(2).0005

機構典藏 > College of Business and Management > Graduate Institute & Department of Information Management > Journal Article > Item 987654321/126858

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/126858

Title:	TOPSIS Sorting with Optimized Cutoff Values
Authors:	Jou, Chi-chang
Keywords:	Multiple criteria decision making;TOPSIS;Ordered sorting;Cutoff value.
Date:	2024-06
Issue Date:	2025-03-20 09:27:37 (UTC+8)
Abstract:	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.
Relation:	International Journal of Information and Management Sciences (IJIMS) 35(2),　p.175-190
DOI:	10.6186/IJIMS.202406_35(2).0005
Appears in Collections:	[Graduate Institute & Department of Information Management] Journal Article

Files in This Item:

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

Loading...