We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3 times faster. We also propose a general improvement of existing state-of-the-art accelerated exact k-means algorithms through better estimates of the distance bounds used to reduce the number of distance calculations, and get a speedup in 36 of 44 experiments, up to 1.8 times faster. We have conducted experiments with our own implementations of existing methods to ensure homogeneous evaluation of performance, and we show that our implementations perform as well or better than existing available implementations. Finally, we propose simplified variants of standard approaches and show that they are faster than their fully-fledged counterparts in 59 of 62 experiments.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1602.02514")
get_code_for_paper("1602.02514")
have("1602.02514")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1602.02514.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1602.02514)
Connect an agent — have() is free.