Max-D clustering K-means algorithm for Autogeneration of Centroids and Distance of Data Points Cluster
K-Means is one of the unsupervised learning and partitioning clustering algorithms. It is very popular and widely used for its simplicity and fastness. The main drawback of this algorithm is that user should specify the number of cluster in advance. As an iterative clustering strategy, K-Means algor...
Main Authors: | Wan Maseri, Wan Mohd, Beg, Abul Hashem, Tutut, Herawan, K., F.Rabbi |
---|---|
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/6871/ http://umpir.ump.edu.my/id/eprint/6871/ http://umpir.ump.edu.my/id/eprint/6871/1/Max-D_clustering_K-means_algorithm_for_Autogeneration.pdf |
Similar Items
-
MaxD K-Means: A clustering algorithm for auto-generation of centroids and distance of data points in clusters
by: Wan Maseri, Wan Mohd, et al.
Published: (2012) -
Improved Parameterless K-Means: Auto-Generation Centroids and Distance Data Point Clusters
by: Wan Maseri, Wan Mohd, et al.
Published: (2011) -
Data clustering using max-max roughness and its application to cluster patients suspected heart disease
by: Mohd Amirol Redzuan, Mat Rofi
Published: (2012) -
Clustering of rainfall data using k-means algorithm
by: Mohd Sham, Mohamad, et al.
Published: (2019) -
Rough Clustering For Cancer Datasets
by: Herawan, Tutut
Published: (2010)