With the explosive increase of multimedia objects represented as high-dimensional vectors, clustering techniques for these objects have received much attention in recent years. However, clustering methods usually require a large amount of computational cost when calculating the distances between these objects. In this paper, for accelerating the greedy K-medoids clustering algorithm with L1 distance, we propose a new method consisting of the fast first medoid selection, lazy evaluation, and pivot pruning techniques, where the efficiency of the pivot construction is enhanced by our new pivot generation method called PGM2. In our experiments using real image datasets where each object is represented as a high-dimensional vector and L1 distance is recommended as their dissimilarity, we show that our proposed method achieved a reasonably high acceleration performance.
CITATION STYLE
Fushimi, T., Saito, K., Ikeda, T., & Kazama, K. (2017). Accelerating greedy K-medoids clustering algorithm with L1 distance by pivot generation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10352 LNAI, pp. 87–96). Springer Verlag. https://doi.org/10.1007/978-3-319-60438-1_9
Mendeley helps you to discover research relevant for your work.