A new algorithm is proposed which accelerates the mini-batch k-means algorithm of Sculley (2010) by using the distance bounding approach of Elkan (2003). We argue that, when incorporating distance bounds into a mini-batch algorithm, already used data should preferentially be reused. To this end we propose using nested mini-batches, whereby data in a mini-batch at iteration t is automatically re...

A modified method for better superpixel generation based on simple linear iterative clustering (SLIC) is presented and named BSLIC in this paper. By initializing cluster centers in hexagon distribution and performing k-means clustering in a limited region, the generated superpixels are shaped into regular and compact hexagons. The additional cluster centers are initialized as edge pixels to imp...

This paper attempts to discover the most desired attributes of a model ERP implementation project. The analysis, based on research conducted among a few dozen companies implementing an ERP system, employs the statistical methods of element grouping. First, using an agglomeration method, the number of groups was determined, which was used as a parameter in the subsequently applied k-Means method...

There is often a large disparity between the size of a game we wish to solve and the size of the largest instances solvable by the best algorithms; for example, a popular variant of poker has about 10 nodes in its game tree, while the currently best approximate equilibrium-finding algorithms scale to games with around 10 nodes. In order to approximate equilibrium strategies in these games, the ...

Non-local means is a recently proposed denoising technique that better preserves image structures than other methods. However, the computational cost of non-local means is prohibitive, especially for large 3D images. Modifications have previously been proposed to reduce the cost, which result in image artefacts. This paper proposes a compact rotation invariant descriptor. Testing demonstrates i...