Parallelising the k-medoids clustering problem using space-partitioning
| dc.contributor.author | Arbelaez, Alejandro | en |
| dc.contributor.author | Quesada, Luis | en |
| dc.contributor.funder | Japan Society for the Promotion of Science | en |
| dc.contributor.funder | Science Foundation Ireland | en |
| dc.date.accessioned | 2024-02-06T12:44:59Z | |
| dc.date.available | 2024-02-06T12:44:59Z | |
| dc.date.issued | 2013 | en |
| dc.description.abstract | The k-medoids problem is a combinatorial optimisation problem with multiples applications in Resource Allocation, Mobile Computing, Sensor Networks and Telecommunications.Real instances of this problem involve hundreds of thousands of points and thousands of medoids.Despite the proliferation of parallel architectures, this problem has been mostly tackled using sequential approaches.In this paper, we study the impact of space-partitioning techniques on the performance of parallel local search algorithms to tackle the k-medoids clustering problem, and compare these results with the ones obtained using sampling.Our experiments suggest that approaches relying on partitioning scale more while preserving the quality of the solution. | en |
| dc.description.sponsorship | Japan Society for the Promotion of Science (JSPS Postdoctoral Program and the kakenhi Grant-in-aid for Scientific Research); Science Foundation Ireland (Grant No. 08/CE/I523) | en |
| dc.description.status | Peer reviewed | en |
| dc.description.version | Accepted Version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Arbelaez, A. and Quesada, L. (2013) 'Parallelising the k-medoids clustering problem using space-partitioning', Proceedings of the International Symposium on Combinatorial Search 4(1), pp. 20-28. doi: https://doi.org/10.1609/socs.v4i1.18282 | en |
| dc.identifier.doi | https://doi.org/10.1609/socs.v4i1.18282 | en |
| dc.identifier.endpage | 28 | en |
| dc.identifier.issn | 2832-9163 | en |
| dc.identifier.issn | 2832-9171 | en |
| dc.identifier.issued | 1 | en |
| dc.identifier.journaltitle | Proceedings of the International Symposium on Combinatorial Search | en |
| dc.identifier.startpage | 20 | en |
| dc.identifier.uri | https://hdl.handle.net/10468/15496 | |
| dc.identifier.volume | 4 | en |
| dc.language.iso | en | en |
| dc.publisher | Association for the Advancement of Artificial Intelligence | en |
| dc.relation.ispartof | Proceedings of the International Symposium on Combinatorial Search | en |
| dc.rights | © 2013, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. | en |
| dc.subject | Local search | en |
| dc.subject | Parallel search | en |
| dc.subject | k-medoids | en |
| dc.subject | Clustering | en |
| dc.title | Parallelising the k-medoids clustering problem using space-partitioning | en |
| dc.type | Conference item | en |
| oaire.citation.issue | 1 | en |
| oaire.citation.volume | 4 | en |
