Matching Final Year Project Topics with Students using Stable Marriage Model
Every semester, a new batch of final year students needs to find a topic and a supervisor to complete their final year project requirement. The problem with the current approach is that it is based on first come first serve. So, the pairing between student and supervisor is not the optimal ones, i.e...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis
2018-01-01
|
Series: | Journal of Computing Research and Innovation |
Subjects: | |
Online Access: | https://crinn.conferencehunter.com/index.php/jcrinn/article/view/27 |
id |
doaj-02f1588de40c48a4804249b3a7c762d5 |
---|---|
record_format |
Article |
spelling |
doaj-02f1588de40c48a4804249b3a7c762d52021-02-01T02:32:12ZengFaculty of Computer and Mathematical Sciences, Universiti Teknologi MARA PerlisJournal of Computing Research and Innovation2600-87932018-01-0121293518Matching Final Year Project Topics with Students using Stable Marriage ModelNaimah Mohd HussinAmmar AzlanEvery semester, a new batch of final year students needs to find a topic and a supervisor to complete their final year project requirement. The problem with the current approach is that it is based on first come first serve. So, the pairing between student and supervisor is not the optimal ones, i.e. some students may not get their preferred topic or supervisor. Plus, it is also time consuming for both students and supervisors. The researcher is motivated to solve this long overdue problem by applying a stable marriage model that is introduced by Gale and Shapley hence the name Gale-Shapley Algorithm. To determine the functionality of this approach, a system prototype has been constructed and a random dataset is used. The result, 60% of the students get their first choice topics while the remaining students get their second or third choice. This is a remarkable outcome considering the time and effort saved compared to the current process. Therefore, stable marriage model is applicable in solving student-topic pairinghttps://crinn.conferencehunter.com/index.php/jcrinn/article/view/27gale-shapley algorithmstable marriage modelmatchingoptimizationpairingfinal year project |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Naimah Mohd Hussin Ammar Azlan |
spellingShingle |
Naimah Mohd Hussin Ammar Azlan Matching Final Year Project Topics with Students using Stable Marriage Model Journal of Computing Research and Innovation gale-shapley algorithm stable marriage model matching optimization pairing final year project |
author_facet |
Naimah Mohd Hussin Ammar Azlan |
author_sort |
Naimah Mohd Hussin |
title |
Matching Final Year Project Topics with Students using Stable Marriage Model |
title_short |
Matching Final Year Project Topics with Students using Stable Marriage Model |
title_full |
Matching Final Year Project Topics with Students using Stable Marriage Model |
title_fullStr |
Matching Final Year Project Topics with Students using Stable Marriage Model |
title_full_unstemmed |
Matching Final Year Project Topics with Students using Stable Marriage Model |
title_sort |
matching final year project topics with students using stable marriage model |
publisher |
Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA Perlis |
series |
Journal of Computing Research and Innovation |
issn |
2600-8793 |
publishDate |
2018-01-01 |
description |
Every semester, a new batch of final year students needs to find a topic and a supervisor to
complete their final year project requirement. The problem with the current approach is that
it is based on first come first serve. So, the pairing between student and supervisor is not the
optimal ones, i.e. some students may not get their preferred topic or supervisor. Plus, it is also
time consuming for both students and supervisors. The researcher is motivated to solve this
long overdue problem by applying a stable marriage model that is introduced by Gale and
Shapley hence the name Gale-Shapley Algorithm. To determine the functionality of this
approach, a system prototype has been constructed and a random dataset is used. The result,
60% of the students get their first choice topics while the remaining students get their second
or third choice. This is a remarkable outcome considering the time and effort saved compared
to the current process. Therefore, stable marriage model is applicable in solving student-topic
pairing |
topic |
gale-shapley algorithm stable marriage model matching optimization pairing final year project |
url |
https://crinn.conferencehunter.com/index.php/jcrinn/article/view/27 |
work_keys_str_mv |
AT naimahmohdhussin matchingfinalyearprojecttopicswithstudentsusingstablemarriagemodel AT ammarazlan matchingfinalyearprojecttopicswithstudentsusingstablemarriagemodel |
_version_ |
1724315825066737664 |