K-means is a well-known clustering algorithm often used for its simplicity and potential efficiency. Its properties limitations have been investigated by many works reported in the literature. K-means, though, suffers from computational problems when dealing with large datasets dimensions great number of clusters. Therefore, authors proposed experimented different techniques parallel execution ...

Abstract We study parallel online algorithms: For some fixed integer k , a collective of processes that perform decisions on the same sequence events forms - copy algorithm . any given time and input sequence, overall performance is determined by best individual total results. Problems this type have been considered for makespan minimization; they are also related to optimization with advice fu...