PENGELOMPOKKAN TOPIK TUGAS AKHIR MAHASISWA FAKULTAS ILMU KOMPUTER MENGGUNAKAN K-MEDOIDS CLUSTERING

FIRMANSYAH, MUHAMMAD YUANSHEVA and Arsalan, Osvari and Kurniati, Rizki (2024) PENGELOMPOKKAN TOPIK TUGAS AKHIR MAHASISWA FAKULTAS ILMU KOMPUTER MENGGUNAKAN K-MEDOIDS CLUSTERING. Undergraduate thesis, Sriwijaya University.

[thumbnail of RAMA_55201_09021282025063.pdf] Text
RAMA_55201_09021282025063.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (2MB) | Request a copy
[thumbnail of RAMA_55201_09021282025063_TURNITIN.pdf] Text
RAMA_55201_09021282025063_TURNITIN.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (2MB) | Request a copy
[thumbnail of RAMA_55201_09021282025063_0028068806_0012079104_01_front_ref.pdf] Text
RAMA_55201_09021282025063_0028068806_0012079104_01_front_ref.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (1MB) | Request a copy
[thumbnail of RAMA_55201_09021282025063_0028068806_0012079104_02.pdf] Text
RAMA_55201_09021282025063_0028068806_0012079104_02.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (378kB) | Request a copy
[thumbnail of RAMA_55201_09021282025063_0028068806_0012079104_03.pdf] Text
RAMA_55201_09021282025063_0028068806_0012079104_03.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (371kB) | Request a copy
[thumbnail of RAMA_55201_09021282025063_0028068806_0012079104_04.pdf] Text
RAMA_55201_09021282025063_0028068806_0012079104_04.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (908kB) | Request a copy
[thumbnail of RAMA_55201_09021282025063_0028068806_0012079104_05.pdf] Text
RAMA_55201_09021282025063_0028068806_0012079104_05.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (480kB) | Request a copy
[thumbnail of RAMA_55201_09021282025063_0028068806_0012079104_06.pdf] Text
RAMA_55201_09021282025063_0028068806_0012079104_06.pdf - Accepted Version
Available under License Creative Commons Public Domain Dedication.

Download (145kB)
[thumbnail of RAMA_55201_09021282025063_0028068806_0012079104_07_ref.pdf] Text
RAMA_55201_09021282025063_0028068806_0012079104_07_ref.pdf - Bibliography
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (168kB) | Request a copy
[thumbnail of RAMA_55201_09021282025063_0028068806_0012079104_08_lamp.pdf] Text
RAMA_55201_09021282025063_0028068806_0012079104_08_lamp.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (354kB) | Request a copy

Abstract

Students are required to complete a final project to obtain a bachelor's degree. However, there is an uneven distribution in the selection of final project topics, which affects students' interest distribution. This study aims to implement the K-Medoids algorithm to cluster student final project titles and analyze the quality of the resulting clusters using the Davies-Bouldin Index (DBI). The K-Medoids algorithm was chosen for its capability to group data with multiple variables and produce stable clusters. This study tests variations in the number of clusters ranging from 2 to 10 to evaluate the algorithm's performance. The analysis results show that the DBI value decreases as the number of clusters increases, with the lowest value recorded at 10 clusters, at 11.40 adn the highest value recorded ad 2 clusters, indicating better clustering quality. Additionally, several trends in the selection of final project titles were found across different departments, indicating an imbalance in students' interests toward certain topics. These findings provide valuable insights for the Faculty of Computer Science in developing a curriculum that is more relevant and aligned with student interests. Thus, this study contributes to the development of clustering methods in an academic context and a deeper understanding of students' interests in various research topics.

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: Clustering, Tugas Akhir, K-Medoids, DBI, Topik Penelitian
Subjects: Q Science > Q Science (General) > Q334-342 Computer science. Artificial intelligence. Algorithms. Robotics. Automation.
Divisions: 09-Faculty of Computer Science > 55201-Informatics (S1)
Depositing User: Muhammad Yuansheva Firmansyah
Date Deposited: 08 Jan 2025 02:33
Last Modified: 08 Jan 2025 02:33
URI: http://repository.unsri.ac.id/id/eprint/162971

Actions (login required)

View Item View Item