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...

詳細記述

保存先:
書誌詳細
主要な著者: Wan Maseri, Wan Mohd, Beg, Abul Hashem, Tutut, Herawan, K., F.Rabbi
フォーマット: 論文
言語: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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!