TY - GEN
T1 - Improving the performance of k-means clustering through computation skipping and data locality optimizations
AU - Kislal, Orhan
AU - Berman, Piotr
AU - Kandemir, Mahmut
PY - 2012/6/28
Y1 - 2012/6/28
N2 - We present three different optimization techniques for k-means clustering algorithm to improve the running time without decreasing the accuracy of the cluster centers significantly. Our first optimization restructures loops to improve cache behavior when executing on multicore architectures. The remaining two optimizations skip select points to reduce execution latency. Our sensitivity analysis suggests that the performance can be enhanced through a good understanding of the data and careful configuration of the parameters.
AB - We present three different optimization techniques for k-means clustering algorithm to improve the running time without decreasing the accuracy of the cluster centers significantly. Our first optimization restructures loops to improve cache behavior when executing on multicore architectures. The remaining two optimizations skip select points to reduce execution latency. Our sensitivity analysis suggests that the performance can be enhanced through a good understanding of the data and careful configuration of the parameters.
UR - http://www.scopus.com/inward/record.url?scp=84862655938&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84862655938&partnerID=8YFLogxK
U2 - 10.1145/2212908.2212951
DO - 10.1145/2212908.2212951
M3 - Conference contribution
AN - SCOPUS:84862655938
SN - 9781450312158
T3 - CF '12 - Proceedings of the ACM Computing Frontiers Conference
SP - 273
EP - 275
BT - CF '12 - Proceedings of the ACM Computing Frontiers Conference
T2 - ACM Computing Frontiers Conference, CF '12
Y2 - 15 May 2012 through 17 May 2012
ER -