ASIA unversity:Item 310904400/8986
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90452/105769 (86%)
Visitors : 11946575      Online Users : 399
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item:

    Title: An Application of the Generalized K-Means Algorithm in Decision-Making Processes
    Authors: Jiunn-I Shieh;Hsin-Hung Wu
    Date: 2008
    Issue Date: 2010-04-21 10:55:29 (UTC+8)
    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.
    Relation: International Journal of Operational Research 3(1/2):19-35
    Appears in Collections:[Department of Applied Informatics and Multimedia] Journal Article

    Files in This Item:

    File Description SizeFormat

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback