Results 271 to 280 of about 11,198,889 (292)

Cartesian K-Means

2013 IEEE Conference on Computer Vision and Pattern Recognition, 2013
A fundamental limitation of quantization techniques like the k-means clustering algorithm is the storage and run-time cost associated with the large numbers of clusters required to keep quantization errors small and model fidelity high. We develop new models with a compositional parameterization of cluster centers, so representational capacity ...
Mohammad Norouzi 0002, David J. Fleet
openaire   +1 more source

Balanced k-Means

2017
K-Means is a very common method of unsupervised learning in data mining. It is introduced by Steinhaus in 1956. As time flies, many other enhanced methods of k-Means have been introduced and applied. One of the significant characteristic of k-Means is randomize.
Chen-Ling Tai, Chen-Shu Wang
openaire   +1 more source

K*-Means: An Effective and Efficient K-Means Clustering Algorithm

2016 IEEE International Conferences on Big Data and Cloud Computing (BDCloud), Social Computing and Networking (SocialCom), Sustainable Computing and Communications (SustainCom) (BDCloud-SocialCom-SustainCom), 2016
K-means is a widely used clustering algorithm in field of data mining across different disciplines in the past fifty years. However, k-means heavily depends on the position of initial centers, and the chosen starting centers randomly may lead to poor quality of clustering.
Jianpeng Qi   +3 more
openaire   +1 more source

PERFORMANCE COMPARISON OF K-MEANS, PARALLEL K-MEANS AND K-MEANS++

K-means clustering is a fundamental unsupervised machine learning technique widely applied in various domains such as data analysis, pattern recognition, and clustering-based tasks. However, its efficiency and scalability can be challenged, particularly when dealing with large-scale datasets and complex data structures.
Aliguliyev, Ramiz, Shalala F. Tahirzada
openaire   +1 more source

Home - About - Disclaimer - Privacy