Journal of Applied Mathematics / 2017 / Article / Tab 4

Research Article

A Greedy Clustering Algorithm Based on Interval Pattern Concepts and the Problem of Optimal Box Positioning

Table 4

Dependency of Rand index values and the running time for our and -means clustering methods on number of iterations performed (100 program runs for each value). Values of Rand index are presented in terms of medians and interquartile ranges (IQR).

Number of iterationsClustering methodRand index median
(adjusted/raw)
Rand index IQR
(adjusted/raw)
Average running time (in seconds)

20Our method
(with outliers)
0.43/0.730.12/0.050.8
Our method
(no outliers)
0.39/0.730.10/0.040.8
-means0.32/0.700.21/0.090.02

50Our method
(with outliers)
0.43/0.730.08/0.052.4
Our method
(no outliers)
0.39/0.730.06/0.032.5
-means0.27/0.680.20/ 0.090.05

100Our method
(with outliers)
0.42/0.740.08/0.044.2
Our method
(no outliers)
0.39/0.730.06/0.034.3
-means0.31/0.700.20/0.090.09

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.