Initial Centroid Optimization of K-Means Algorithm Using Cosine Similarity
نویسندگان
چکیده
منابع مشابه
A new Initial Centroid finding Method based on Dissimilarity Tree for K-means Algorithm
—Cluster analysis is one of the primary data analysis technique in data mining and K-means is one of the commonly used partitioning clustering algorithm. In K-means algorithm, resulting set of clusters depend on the choice of initial centroids. If we can find initial centroids which are coherent with the arrangement of data, the better set of clusters can be obtained. This paper proposes a meth...
متن کاملEnhanced Initial Centroids for K-means Algorithm
This paper focuses on the enhanced initial centroids for the K-means algorithm. The original kmeans is using the random choice of init ial seeds which is a major limitation of the orig inal K-means algorithm because it produces less reliab le result of clustering the data. The enhanced method of the k-means algorithm includes the computation of the weighted mean to improve the centroids initial...
متن کاملDetermining a Cluster Centroid of K-Means Clustering Using Genetic Algorithm
Clustering is a function of data mining that served to define clusters (groups) of the object in which objects are in one cluster have in common with other objects that are in the same cluster and the object is different from the other objects in different clusters. One method of clustering that can be used is the KMeans Clustering are included in the category of partitioning methods. One of th...
متن کاملOptimization Fusion Approach For Image Segmentation Using K-Means Algorithm
This paper presents a new ,simple and Efficient segmentation approach,based on a fusion procedure which aims at combining several segmentation maps associated to simpler partition models in order to finally get a more reliable, accurate and a non-overlapped image result. The main objective of the paper is to get a non-overlapping and a reliable output by using k-means and genetic algorithm. The...
متن کاملOptimization Fusion Approach for Image Segmentation Using K-Means Algorithm
This paper presents a new, simple and efficient segmentation approach, based on a fusion procedure which aims at combining several segmentation maps associated to simpler partition models in order to finally get a more reliable, accurate and a non-overlapped image result. The main objective of the paper is to get a non-overlapping and a reliable output by using k-means and genetic algorithm. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING
سال: 2020
ISSN: 2549-6255,2549-6247
DOI: 10.31289/jite.v3i2.3211