z-logo
open-access-imgOpen Access
Pengujian Algoritma Clustering Affinity Propagation dan Adaptive Affinity Propagation terhadap IPK dan Jarak Rumah
Author(s) -
Millati Izzatillah,
Achmad Benny Mutiara
Publication year - 2020
Publication title -
string (satuan tulisan riset dan inovasi teknologi)
Language(s) - English
Resource type - Journals
eISSN - 2549-2837
pISSN - 2527-9661
DOI - 10.30998/string.v4i3.6197
Subject(s) - physics , microbiology and biotechnology , biology
Clustering which is a method to classify data easily is used fora purpose of look ing at the correlation among data attributes. Clustering is also a data point grouping based on similarity value to determine the cluster center. Affinity Propagation (AP) and Adaptive Affinity Propagation (Adaptive AP) are clustering algorithms that produce number of cluster, cluster members and exemplar of each cluster. T his researchis conducted to find out a more effective algorithm when clustering data. Besides, to know the correction offered by Adaptive AP Algorithm which is the developed form of AP Algorithm, the researcher implemented and tested both algorithms by using Matlab R2013a 8.10 with 250 data taken from students’ GPA and the distance from their houses to campus. The a naly sis oftest result application from both algorithms shows that the best algorithm is Adaptive AP because it produces optimal clustering. Another result is no correlation between GPA and home distance.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here