Analisis Algoritma Clustering Dalam Kasus Penentuan Jenis Bunga Iris

Main Article Content

Diwahana Mutiara Candrasari

Abstract

Clustering is one process of data mining that aims to partition existing data into one or more cluster objects based on the characteristics it has. Data with the same characteristics are grouped in one cluster and data with different characteristics are grouped into another cluster. In this study will perform comparation and analyze the best algorithm for categorize flowers by using iris dataset. Clustering algorithm techniques used include K-means, and K-medoids,. The value of davies bouldin and number of clusters will be investigated using the rapidminer tool. The results show that the K-Means algorithm has the lowest davies bouldin value of 0.167, while K-Medoids yields davies bouldin value of 0.291, but among the three algorithms, the K-Means algorithm is the most dominant and best in the comparative process of grouping iris flowers.


 


Keywords: K-means, K-medoids , clustering

Article Metrics

PDF Downloads:

Download data is not yet available.

Article Details

Abstract Reads:

500 times on this page.