An approximate  difference algorithm for massive data streams.

Fong, Jessica H.; Strauss, Martin

On Shanks' algorithm for computing the continued fraction of ${log}_{b} a$ .

Jackson, Terence, Matthews, Keith (2002)

Journal of Integer Sequences [electronic only]

Similarity:

Interpretation and optimization of the $k$ -means algorithm

Kristian Sabo, Rudolf Scitovski (2014)

Applications of Mathematics

Similarity:

The paper gives a new interpretation and a possible optimization of the well-known $k$ -means algorithm for searching for a locally optimal partition of the set $𝒜 = {a_{i} \in ℝ^{n} : i = 1, \dots, m}$ which consists of $k$ disjoint nonempty subsets $π_{1}, \dots, π_{k}$ , $1 \leq k \leq m$ . For this purpose, a new divided $k$ -means algorithm was constructed as a limit case of the known smoothed $k$ -means algorithm. It is shown that the algorithm constructed in this way coincides with the $k$ -means algorithm if during the iterative procedure no data points appear in the...

Displaying similar documents to “An approximate L p difference algorithm for massive data streams.”

On Shanks' algorithm for computing the continued fraction of log b a .

Interpretation and optimization of the k -means algorithm

Displaying similar documents to “An approximate $L^{p}$ difference algorithm for massive data streams.”

On Shanks' algorithm for computing the continued fraction of ${log}_{b} a$ .

Interpretation and optimization of the $k$ -means algorithm