IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/4151168.html
   My bibliography  Save this article

Decision Tree Algorithm in the Performance Evaluation of School-Enterprise Cooperation for Higher Vocational Education

Author

Listed:
  • Yi Yan
  • Naeem Jan

Abstract

With the development of China’s economy and the internet, machine learning has become one of the people’s favorite ways of working. This study aims to solve the problems of brain drain, inefficiency, and injustice in the performance appraisal of school-enterprise cooperation. Decision tree technology is used to establish an assessment system. After the assessment index data are segmented, and the fuzzy version of the C4.5 algorithm is used to calculate and count different data segments. Finally, different data types are used to classify and construct decision trees. The school-enterprise cooperation performance appraisal system has been established and perfected for higher vocational education. In this way, the performance appraisal system is optimized in the school-enterprise cooperation. The system improves work efficiency while reducing manual labor and improves the problems in the performance appraisal of other colleges and universities’ cooperation. Facts have proved that the establishment of decision trees can effectively solve the problems of duplication of indicators and complex calculations in performance appraisal. After being optimized, the C4.5 algorithm will increase the calculation accuracy to 95%. The overall speed of establishment is increased by 5% based on the algorithm before optimization. This breaks the traditional performance appraisal system and promotes the performance appraisal of school-enterprise cooperation to be more open, transparent, fair, and equal.

Suggested Citation

  • Yi Yan & Naeem Jan, 2022. "Decision Tree Algorithm in the Performance Evaluation of School-Enterprise Cooperation for Higher Vocational Education," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-9, June.
  • Handle: RePEc:hin:jnlmpe:4151168
    DOI: 10.1155/2022/4151168
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/4151168.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/4151168.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/4151168?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    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:hin:jnlmpe:4151168. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.