Recommendation System for Specialization Selection Using K-Means Density Canopy

Abstract

The carelessly selection of specialization course leaves some students with difficulty. Therefore, it is needed a recommendation system to solve it. Several approaches could be used to build the system, one of them was K-Means. K-Means required the number of initial centroid at random, so its result was not yet optimal. To determine the optimal initial centroid, Density Canopy (DC) algorithms had been proposed. In this research, DC and K-Means (DCKM) was implemented to build the recommendation system in the problem. The alpha criterion was also proposed to improve the performance of DCKM. The academic quality dataset in the 2018 informatics programs students of ITTP was used. There were three main stages in the system, namely determination of the weight of the course in dataset, implementation of DCKM, and determination of specialization recommendations. The results showed that the system by using DCKM has good quality based on the Silhouette results (at least 0.655). The system also used standar valuation scale in ITTP and silhouette index in the process of system. The results showed that 176 (65.91%) students were recommended in IT specialization, 25 (9.36%) students were recommended in MM specialization and 66 (24.7%) students were recommended in SC specialization.

Unsupervised Feature Selection Based on Self-configuration Approaches using Multidimensional Scaling

“…The hierarchical clustering algorithms are single linkage, complete linkage, average linkage, and ward linkage. Meanwhile, in non-hierarchical clustering, the k-means algorithm is the most popular and widely applied in various fields like education [19][20][21], the problems in incomplete data [22], and the problems in shape data [23].…”