Skip to main content

Table 1 Notations

From: Decreasing the execution time of reducers by revising clustering based on the futuristic greedy approach

Notation

Description

Vi

i-th data point

\(\varvec{Mapper}_{\varvec{i}}\)

i-th mapper

\(\varvec{C}_{{\varvec{ij}}}\)

j-th cluster of i-th mapper

\(\varvec{O}_{{\varvec{ij}}}\)

j-th outlier if i-th mapper

\(\hat{\varvec{C}}_{{\varvec{ij}}}\)

cluster centre of Cij or

n

Number of data points

N

Number of input data

\(\varvec{reducer}_{\varvec{i}}\)

i-th reducer

j

Number of jobs in each cluster

k

Number of new clusters before centroids clustering

p

Number of new clusters after centroids clustering

\(\varvec{C^{\prime}}_{{\varvec{ij}}}\)

New cluster after centroids clustering

\(\varvec{C^{\prime\prime}}_{{\varvec{ij}}}\)

Produced cluster of centroids clustering

F

number of reducers

\(\varvec{ETA}_{\varvec{k}}\)

Density average of jobs in k-th cluster.

  1. Notice: cluster centre for each outlier is same as \(\varvec{O}_{{\varvec{ij}}}\)