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

University Students Behaviour Modelling Using the K-Prototype Clustering Algorithm

Author

Listed:
  • Delali Kwasi Dake
  • Esther Gyimah
  • Charles Buabeng-Andoh
  • Venkatesan Rajinikanth

Abstract

Counselling students remains a pre-eminence for most tertiary institutions in Ghana to the extent that institutions now have counselling units that extend to the departmental level. This study used the K-prototype machine learning algorithm to cluster students’ behaviour based on 28 relevant attributes and further proposed a classification model. The analysis of the experimental outcomes using the elbow method reveals the formation of three distinct clusters with decreasing intra-cluster similarities and increasing inter-cluster distances. The first cluster uniquely consists of active learners with three or more roommates, primarily in the first year. The second cluster with the highest membership consists mainly of second-year students who exhibit passive classroom conduct and reside in a two-occupancy hostel. The third cluster contains a mixture of third and final-year students who are highly passive in class and live in a tenancy occupancy of two. After clustering, the K-nearest neighbours, logistic regression, naïve Bayes (NB), and AdaBoost ensemble algorithms were implemented to create a model for future learner cluster prediction. Simulation results using the tenfold cross-validation technique show that AdaBoost (NB) has the highest accuracy of 99.88% with an F-measure score of 0.999 and receiver operating characteristic–area under the curve value of 1.00.

Suggested Citation

  • Delali Kwasi Dake & Esther Gyimah & Charles Buabeng-Andoh & Venkatesan Rajinikanth, 2023. "University Students Behaviour Modelling Using the K-Prototype Clustering Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2023, pages 1-13, August.
  • Handle: RePEc:hin:jnlmpe:5507814
    DOI: 10.1155/2023/5507814
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2023/5507814.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2023/5507814.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2023/5507814?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:5507814. 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.