MaxD K-Means: A clustering algorithm for auto-generation of centroids and distance of data points in clusters
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...
Saved in:
Main Authors: | Wan Maseri, Wan Mohd, Beg, Abul Hashem, Herawan, Tutut, Fazley Rabbi, Khandakar |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer, Berlin, Heidelberg
2012
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/27004/1/MaxD%20K-Means-%20A%20clustering%20algorithm%20for%20auto-generation%20of%20centroids.pdf http://umpir.ump.edu.my/id/eprint/27004/ https://doi.org/10.1007/978-3-642-34289-9_22 https://doi.org/10.1007/978-3-642-34289-9_22 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Similar Items
-
Max-D clustering K-means algorithm for Autogeneration of Centroids and Distance of Data Points Cluster
by: Wan Maseri, Wan Mohd, et al. -
Improved Parameterless K-Means: Auto-Generation Centroids and Distance Data Point Clusters
by: Wan Maseri, Wan Mohd, et al.
Published: (2011) -
MT2Way: A novel strategy for pair-wise test data generation
by: Rabbi, Khandakar Fazley, et al.
Published: (2012) -
RMF: Rough Set Membership Function-based for Clustering Web Transactions
by: Herawan, Tutut, et al.
Published: (2013) -
Modified ACS centroid memory for data clustering
by: Jabbar, Ayad Mohammed, et al.
Published: (2019)