Unsupervised K-Means Clustering Algorithm

Explore this paper's citation graph

Summary

An unsupervised learning schema is constructed for the k-means algorithm so that it is free of initializations without parameter selection and can also simultaneously find an optimal number of clusters.

Type
article
Published
2020-04-20
Cited by
1,833
References
39
Access
Open access

Keywords

Computer science, Cluster analysis, Artificial intelligence, Canopy clustering algorithm, Unsupervised learning

References

Cited by

Related papers