Improved Parameterless K-Means: Auto-Generation Centroids and Distance Data Point Clusters
K-means is an unsupervised learning and partitioning clustering algorithm. It is popular and widely used for its simplicity and fastness. K-means clustering produce a number of separate flat (non-hierarchical) clusters and suitable for generating globular clusters. The main drawback of the k-means...
Main Authors: | Wan Maseri, Wan Mohd, Beg, Abul Hashem, Herawan, Tutut, Noraziah, Ahmad |
---|---|
Format: | Article |
Language: | English |
Published: |
IGI Global
2011
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/9328/ http://umpir.ump.edu.my/id/eprint/9328/ http://umpir.ump.edu.my/id/eprint/9328/ http://umpir.ump.edu.my/id/eprint/9328/7/improved-parameterless-k-means_-auto-generation-centroids-and-distance-data-point-clusters%281%29.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) -
Max-D clustering K-means algorithm for Autogeneration of Centroids and Distance of Data Points Cluster
by: Wan Maseri, Wan Mohd, et al. -
RMF: Rough Set Membership Function-based for Clustering Web Transactions
by: Herawan, Tutut, et al.
Published: (2013) -
Intrusion detection systems using K-means clustering system
by: Nor Dzuhairah Hani, Jamaludin
Published: (2019) -
Clustering techniques for human posture recognition: K-Means, FCM and SOM
by: Kiran, Maleeha, et al.
Published: (2009)