IDEAS home Printed from https://ideas.repec.org/h/spr/advbcp/978-94-6463-272-9_19.html

A Fuzzy Comprehensive Evaluation System for Performance Appraisal Based on Clustering Algorithm

In: Proceedings of the 2023 3rd International Conference on Financial Management and Economic Transition (FMET 2023)

Author

Listed:
  • Kai Zhang

    (Gusu Laboratory, General Management Department)

Abstract

In response to the traditional performance evaluation methods that require a large amount of manpower and material resources to be uniformly allocated, and the storage methods of input data are not unified, resulting in low evaluation efficiency and accuracy, a performance evaluation fuzzy comprehensive evaluation system design method based on K-means clustering algorithm is proposed. The system consists of a data preparation module, a performance evaluation fuzzy evaluation module, a report processing module The system maintenance module constitutes the overall structure of the performance evaluation fuzzy comprehensive evaluation system. Using the Analytic Hierarchy Process to calculate the corresponding weights of performance evaluation indicators, a fuzzy evaluation model for performance evaluation is constructed. The K-means clustering algorithm is used to solve the fuzzy comprehensive evaluation model for performance evaluation, achieving the evaluation of performance evaluation and completing the design of the fuzzy comprehensive evaluation system for performance evaluation. The experimental results show that the evaluation efficiency and accuracy of this method are high.

Suggested Citation

  • Kai Zhang, 2024. "A Fuzzy Comprehensive Evaluation System for Performance Appraisal Based on Clustering Algorithm," Advances in Economics, Business and Management Research, in: Vilas Gaikar & Min Hou & Yan Li & Yan Ke (ed.), Proceedings of the 2023 3rd International Conference on Financial Management and Economic Transition (FMET 2023), pages 178-185, Springer.
  • Handle: RePEc:spr:advbcp:978-94-6463-272-9_19
    DOI: 10.2991/978-94-6463-272-9_19
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:advbcp:978-94-6463-272-9_19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.