Author： Wu Hsin-Hung Shieh Jiunn-I Liao Anthony Y.H. Lin Shih-Yen
Publisher： Inderscience Publishers
ISSN： 1745-7645
Source： International Journal of Operational Research, Vol.3, Iss.1-2, 2007-12, pp. : 19-35
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
A case study of applying the generalised K-means algorithm with different p values is provided to discuss the applicants' selection under a variety of criteria in an admission process. The properties of the generalised K-means algorithm are exploited in a decision-making process. When p is smaller and closer to zero, the results show the priorities are identical, which is to look for the applicants with even performance. In contrast, the most commonly used p values in K-means algorithm do not generate a systematic pattern. When p becomes larger and approaches ∞, the results show the priorities are difficult to tell, but the intention is to separate alternatives with a number of clusters, which is to look for the applicants with the greatest potential. Finally, in this case study, using smaller p values might provide stable priorities to select 21 applicants out of 36 participants.
Related content
By Arvapally Ravi Santosh Liu Xiaoqing (Frank)
Knowledge Management Research & Practice, Vol. 10, Iss. 4, 2012-12 ,pp. :
Access to resources
Recommend
