Analisis Algoritma Clustering Dalam Kasus Penentuan Jenis Bunga Iris
DOI:
https://doi.org/10.33488/1.ma.2017.2.75Abstract
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
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
Issue
Section
License
Media Aplikom applies the Creative Commons Attribution (CC BY) license to works we publish. Under this license, authors retain ownership of the copyright for their content, grant the journal right of first publication, but allow anyone to download, reuse, reprint, modify, distribute and/or copy the content as long as the original authors and source are cited. No permission is required from the authors or the publishers. Appropriate attribution can be provided by simply citing the original article.
