A Computational Comparison of Parallel and Distributed K-median Clustering Algorithms on Large-Scale Image Data-Reference-Cited by-同舟云学术

A Computational Comparison of Parallel and Distributed K-median Clustering Algorithms on Large-Scale Image Data

Published:2019 Issue: Volume: Page:119-130
ISSN:1865-0929
Container-title:Mathematical Optimization Theory and Operations Research
language:
Short-container-title:

Author:

Ushakov Anton V.^ORCID,Vasilyev Igor^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-33394-2_10

Reference30 articles.

1. Irkutsk supercomputer center of SB RAS. http://hpc.icc.ru . Accessed 15 Feb 2019

2. An, H.-C., Svensson, O.: Recent developments in approximation algorithms for facility location and clustering problems. In: Fukunaga, T., Kawarabayashi, K. (eds.) Combinatorial Optimization and Graph Algorithms, pp. 1–19. Springer, Singapore (2017). https://doi.org/10.1007/978-981-10-6147-9_1

3. Arbelaez, A., Quesada, L.: Parallelising the k-medoids clustering problem using space-partitioning. In: Helmert, M., Röger, G. (eds.) Proceedings the 6th Annual Symposium on Combinatorial Search, SoCS 2013, pp. 20–28. AAAI (2013)

4. Avella, P., Boccia, M., Salerno, S., Vasilyev, I.: An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39(7), 1625–1632 (2012)

5. Avella, P., Boccia, M., Sforza, A., Vasilyev, I.: An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15(6), 597–615 (2008)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Application of the K-medians Clustering Algorithm for Test Analysis in E-learning;Software Engineering Application in Systems Design;2023