[期刊论文]


Novel Clustering Algorithm Using K Harmonic Means and Improved Time Complexity

作   者:

暂无

出版年:2019

页     码:33 - 35
出版社:TechScience Publications


摘   要:

Clustering algorithm is one of the most popular unsupervised learning algorithms in machine learning. K means clustering is one of the widely used clustering methods for various applications in data mining, image processing and computer vision. Many solutions have been offered to make the k-means clustering algorithm more efficient. This paper proposes an improved k-means clustering algorithm by initializing cluster seeds and improving the time complexity of the algorithm.



关键字:

K-means clustering; unsupervised learning.


全文
所属期刊
International Journal of Computer Science and Information Technologies
ISSN:
来自:TechScience Publications