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

Data Analysis of College Students’ Mental Health Based on Clustering Analysis Algorithm

Author

Listed:
  • Yichen Chu
  • Xiaojian Yin
  • Zhihan Lv

Abstract

Mental health is an important basic condition for college students to become adults. Educators gradually attach importance to strengthening the mental health education of college students. This paper makes a detailed analysis and research on college students’ mental health, expounds the development and application of clustering analysis algorithm, applies the distance formula and clustering criterion function commonly used in clustering analysis, and makes a specific description of some classic algorithms of clustering analysis. Based on expounding the advantages and disadvantages of fast-clustering analysis algorithm and hierarchical clustering analysis algorithm, this paper introduces the concept of the two-step clustering algorithm, discusses the algorithm flow of clustering model in detail, and gives the algorithm flow chart. The main work of this paper is to analyze the clustering algorithm of students’ mental health database formed by mental health assessment tool test, establish a data mining model, mine the database, analyze the state characteristics of different college students’ mental health, and provide corresponding solutions. In order to meet the needs of the psychological management system based on the clustering analysis method, the clustering analysis algorithm is used to cluster the data. Based on the original database, this paper establishes the methods of selecting, cleaning, and transforming the data of students’ psychological archives. Finally, it expounds on the application of data mining in students’ psychological management system and summarizes and prospects the implementation of the system.

Suggested Citation

  • Yichen Chu & Xiaojian Yin & Zhihan Lv, 2021. "Data Analysis of College Students’ Mental Health Based on Clustering Analysis Algorithm," Complexity, Hindawi, vol. 2021, pages 1-10, April.
  • Handle: RePEc:hin:complx:9996146
    DOI: 10.1155/2021/9996146
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9996146.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/9996146.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/9996146?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:complx:9996146. 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.