IDEAS home Printed from https://ideas.repec.org/a/epw/comput/v3y2023i3id10106.html

A Hybrid Clustering Model for Determining Financially Needy Students for Sponsorship

Author

Listed:
  • Samuel King Opoku

    (Kumasi Technical University, Ghana)

  • Asare Yaw Obeng

    (Kumasi Technical University, Ghana)

Abstract

Many organizations in the world are seeking effective means to provide financial assistance to brilliant but needy students. Many research works have been conducted to determine needy students based on classification methods which fail to separate financially stable students from needy ones as the class labels for the classification methods are affected by manual reviews, randomness and the discretion of the selection committee. This paper presents a hybrid clustering method for determining needy students based on income and expenditure using the K-Means and Expectation-Maximization methods with the logical AND operator to eliminate the limitations associated with the classification methods. The study reveals that hybridizing clustering methods yield better results. Also, for a normalized data categorization, the Euclidean distance gives better results than the Manhattan distance in the K-Means algorithm.

Suggested Citation

Handle: RePEc:epw:comput:v:3:y:2023:i:3:id:10106
DOI: 10.24018/compute.2023.3.3.106
as

Download full text from publisher

File URL: https://eu-opensci.org/index.php/compute/article/view/10106
File Function: Abstract page
Download Restriction: no

File URL: https://eu-opensci.org/index.php/compute/article/download/10106/1820
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.24018/compute.2023.3.3.106?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

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:epw:comput:v:3:y:2023:i:3:id:10106. 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: Support Team (email available below). General contact details of provider: https://eu-opensci.org/index.php/compute .

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.