Analisis Algoritma Clustering Dalam Kasus Penentuan Jenis Bunga Iris

Authors

  • Diwahana Mutiara Candrasari Sekolah Tinggi Ilmu Komputer Yos Sudarso Purwokerto

DOI:

https://doi.org/10.33488/1.ma.2017.2.75

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

Downloads

Download data is not yet available.

References

Han, Jiawei; & Kamber, Micheline. (2001). Data MiningConceptsandTechnique Second Edition. San Francisco: Morgan Kauffman.

Leela,V, Sakthi, P.K, dan Manikandan, R .(2014), Comparative Study Of Clustering Techniques Iris Datasets. World Applied Sciences Journal, 29 (Data Mining and Soft Computing Techniques): 24-29.

Srinivas, Bhaskara A, Vardhan, Visnu B, dkk (2013). An Efficient Data ClusteringAlgorithm Over Iris Dataset. Journal OfAdvanced Research In Computer Science and Softwre Engineering.

Downloads

Published

2017-12-01

Issue

Section

Article

How to Cite

[1]
“Analisis Algoritma Clustering Dalam Kasus Penentuan Jenis Bunga Iris”, Media Aplikom, vol. 9, no. 2, pp. 72 – 84, Dec. 2017, doi: 10.33488/1.ma.2017.2.75.