K-means clustering algorithm for data distribution in cloud computing environment
by Hailan Pan; Yongmei Lei; Shi Yin
International Journal of Grid and Utility Computing (IJGUC), Vol. 12, No. 3, 2021

Abstract: This study analyses the data structure in cluster analysis. It is a clustering method that randomly selects a known number of points and then continues to expand. Through the comparative experiments on the clustering accuracy of different similarity matrices, the experimental analysis on the effectiveness of the model, the distribution of e-commerce data under cloud computing and the calculation time of different clustering algorithms, we can better understand the K-means clustering algorithm and the status of e-commerce in cloud computing environment. The experimental results show that if the appropriate similarity function is selected, the result of spectral clustering is usually not lower than that of simple K-means clustering. When the number of users reaches 4000, the list reading time of the K-means clustering algorithm is 3.15 s, while the other three algorithms consume more time.

Online publication date: Mon, 04-Oct-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com