Skripsi
PENGELOMPOKKAN TOPIK TUGAS AKHIR MAHASISWA FAKULTAS ILMU KOMPUTER MENGGUNAKAN K-MEDOIDS CLUSTERING
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.
Inventory Code | Barcode | Call Number | Location | Status |
---|---|---|---|---|
2507000036 | T162971 | T1629712024 | Central Library (Reference) | Available but not for loan - Not for Loan |
No other version available