EURASIP Journal on Advances in Signal Processing

Table 11 The execution time required for obtaining the weights

From: A parallel ADMM-based convex clustering method

Data set size	k for KNN	Time
\(200{,}000\times 3\)	10	24.4 s
\(200{,}000\times 3\)	100	61.38 s
\(200{,}000\times 3\)	1000	959.32 s
\(2{,}000{,}000\times 3\)	10	18.46 min
\(2{,}000{,}000\times 3\)	100	59.05 min

Back to article page