Skip to content
naulon
Not checkedNot checked for notices yet.

An Improved K-means Clustering Algorithm Applicable to Massive High-dimensional Matrix Datasets

Li Dong-Yuan, Cao Cai-Feng

ITM Web of Conferences · 2017

doi:10.1051/itmconf/20171104001 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Since K-means clustering algorithm is easy to implement and high efficient, it has been widely used in cluster analysis of massive datasets. The value of k is difficult to determine in advance and the randomness of choosing initial centers leads to a series of social problems, such as instability, local optimal solution sensitivity to outliers. Results from hierarchical clustering are more natural than those from K-means clustering, but its high time complexity and space complexity makes it difficult to be applied to a large data set. In this paper, through combination of hierarchical clustering and K-means clustering, we have proposed an improved K-means clustering algorithm, and have done experiments using datasets provided by MovieLens.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.