Canopy with k-means clustering algorithm for big data analytics
Küçük Resim Yok
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
. Recently, Big Data is gathered from various sources in different types, and it is not easy to analyze them by traditional methods. Apache Hadoop is a robust solution to the problems of saving and processing large datasets by providing HDFS (Hadoop Distributed File System) and MapReduce for storing and processing data. One of the essential methods for analyzing big data to discover new patterns is the clustering algorithms. In this paper, we have used the canopy clustering algorithm provided by Distributed Machine Learning with Apache Mahout as preprocessing step for the k-means clustering algorithm. The results showed that using Canopy as a preprocessing step has sped up the time of managing the massive scale of the healthcare insurance dataset, and it also reduces the execution time of the k-means by providing initial centroids for the given dataset.
Açıklama
Anahtar Kelimeler
Big Data, k-means, canopy, Mahout, Health Care, confusion matrix, HDFS
Kaynak
Fourth International Conference of Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Sagheer, N.S. ve Yousif, S.A. (2021). Canopy with k-means clustering algorithm for big data analytics. Fourth International Conference of Mathematical Sciences, Maltepe Üniversitesi. s. 1-4.