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...
Saved in:
Main Authors: | Wan Maseri, Wan Mohd, Beg, Abul Hashem, Tutut, Herawan, K., F.Rabbi |
---|---|
格式: | Article |
语言: | English |
主题: | |
在线阅读: | http://umpir.ump.edu.my/id/eprint/6871/1/Max-D_clustering_K-means_algorithm_for_Autogeneration.pdf http://umpir.ump.edu.my/id/eprint/6871/ http://onlinepresent.org/proceedings/vol7_2012/3.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
MaxD K-Means: A clustering algorithm for auto-generation of centroids and distance of data points in clusters
由: Wan Maseri, Wan Mohd, et al.
出版: (2012) -
Improved Parameterless K-Means: Auto-Generation Centroids and Distance Data Point Clusters
由: Wan Maseri, Wan Mohd, et al.
出版: (2011) -
RMF: Rough Set Membership Function-based for Clustering Web Transactions
由: Herawan, Tutut, et al.
出版: (2013) -
Modified ACS centroid memory for data clustering
由: Jabbar, Ayad Mohammed, et al.
出版: (2019) -
Applying Variable Precision Rough Set for Clustering Diabetics Dataset
由: Herawan, Tutut, et al.
出版: (2014)