Pengelompokan Penerimaan Mahasiswa Baru Dengan Algoritma K-Means Untuk Meningkatkan Potensi Pemasaran

  • Daniel D
  • Fauziah S
  • Danny M
N/ACitations
Citations of this article
47Readers
Mendeley users who have this article in their library.

Abstract

Utilization of the existing PMB dataset through the clustering method approach can be applied in analyzing the rate of acceptance of new students. The K-Medoid Cluster algorithm model that is applied has results that show a new insight, namely the grouping of new student acceptance rates based on 3 clusters, cluster 1 (C0) is a high level consisting of 49 data from 86 datasets tested and cluster 2 (C1) is a low level consisting of 11 data from 86 datasets tested and cluster 3 (C2) is a medium level consisting of 26 data from 86 datasets tested. The results of the Davies Bouldin Index or DBI value are based on the RapidMiner Studio application obtained from data testing, with a Davies-Bouldin Index evaluation value of 0.769. Keywords: Data Mining, K-Medoid Cluster, Klastrer, PMB

Cite

CITATION STYLE

APA

Daniel, D. T., Fauziah, S., & Danny, M. (2023). Pengelompokan Penerimaan Mahasiswa Baru Dengan Algoritma K-Means Untuk Meningkatkan Potensi Pemasaran. Bulletin of Information Technology (BIT), 4(3), 294–298. https://doi.org/10.47065/bit.v4i3.732

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free